<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-11T03:45:49Z</responseDate>
  <request metadataPrefix="jpcoar_1.0" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00233376">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00233376</identifier>
        <datestamp>2025-01-19T10:07:15Z</datestamp>
        <setSpec>1164:2592:11452:11525</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/1.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/1.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/1.0/jpcoar_scm.xsd">
          <dc:title>Private Triangle Counting for Degeneracy-bounded Graphs</dc:title>
          <dc:title xml:lang="en">Private Triangle Counting for Degeneracy-bounded Graphs</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>Quentin, Hillebrand</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>Vorapong, Suppakitpaisarn</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>Tetsuo, Shibuya</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Quentin, Hillebrand</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Vorapong, Suppakitpaisarn</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Tetsuo, Shibuya</jpcoar:creatorName>
          </jpcoar:creator>
          <datacite:description descriptionType="Other">This article introduces a new triangle counting algorithm under the framework of edge local differential privacy leveraging the degeneracy-bounded nature of real-world graphs. We describe a pre-processing step that performs a re-ordering of the vertices according to their degrees. Despite its small budget usage, this ordering effectively reduces the occurrence of some specific patterns in the graph. In turn, the diminished number of those patterns enable our triangle counting algorithm to minimize its error on the estimation. This results in the error of our triangle counting scaling as a function of the degeneracy unlike state of the art algorithms for which it was scaling with the maximal degree, effectively increasing the accuracy in practice.</datacite:description>
          <datacite:description descriptionType="Other">This article introduces a new triangle counting algorithm under the framework of edge local differential privacy leveraging the degeneracy-bounded nature of real-world graphs. We describe a pre-processing step that performs a re-ordering of the vertices according to their degrees. Despite its small budget usage, this ordering effectively reduces the occurrence of some specific patterns in the graph. In turn, the diminished number of those patterns enable our triangle counting algorithm to minimize its error on the estimation. This results in the error of our triangle counting scaling as a function of the degeneracy unlike state of the art algorithms for which it was scaling with the maximal degree, effectively increasing the accuracy in practice.</datacite:description>
          <dc:publisher xml:lang="ja">情報処理学会</dc:publisher>
          <datacite:date dateType="Issued">2024-03-14</datacite:date>
          <dc:language>eng</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_18gh">technical report</dc:type>
          <jpcoar:identifier identifierType="URI">https://ipsj.ixsq.nii.ac.jp/records/233376</jpcoar:identifier>
          <jpcoar:sourceIdentifier identifierType="ISSN">2188-8566</jpcoar:sourceIdentifier>
          <jpcoar:sourceIdentifier identifierType="NCID">AN1009593X</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle>研究報告アルゴリズム（AL）</jpcoar:sourceTitle>
          <jpcoar:volume>2024-AL-197</jpcoar:volume>
          <jpcoar:issue>1</jpcoar:issue>
          <jpcoar:pageStart>1</jpcoar:pageStart>
          <jpcoar:pageEnd>7</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="IPSJ-AL24197001.pdf">https://ipsj.ixsq.nii.ac.jp/record/233376/files/IPSJ-AL24197001.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>900.8 kB</jpcoar:extent>
            <datacite:date dateType="Available">2026-03-14</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
