{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VTZ5MJUJR23SZKTZ2Z4L6776SU","short_pith_number":"pith:VTZ5MJUJ","schema_version":"1.0","canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","source":{"kind":"arxiv","id":"2502.15379","version":1},"attestation_state":"computed","paper":{"title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arijit Bishnu, Debarshi Chanda, Gopinath Mishra","submitted_at":"2025-02-21T11:04:43Z","abstract_excerpt":"Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \\varepsilon, \\delta <1$, along with \\texttt{Degree}, \\texttt{Neighbour}, \\texttt{Edge} and \\texttt{RandomEdge} query access to $G$, we provide a query based randomized algorithm to generate an estimate $\\widehat{T}$ of the number of triangles $T$ in $G$, such that $\\widehat{T} \\in [(1-\\varepsilon)T , (1+\\varepsilon)T]$ with probability at least $1-\\delta$. The query complexity of our algorithm is $\\widetilde{O}\\left({m \\alpha \\log(1/\\delta)}/{\\varepsilon^3 T}\\right)$, where $\\alpha$ is the arbo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.15379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-21T11:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"b29878eae38ad918352370cd25eeb92966281c940f5ea0916858940da3469f9a","abstract_canon_sha256":"079ed3f6d782a5522255b738c15988a9ece66d1cd8b01792797629dd1b080908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:00.919932Z","signature_b64":"BKVoS4IRbjTm3nAkRXWTRqInf25B+9IPAv7Ykk9sFF+4Y42dmrurJi/HR5NzAeLM4iJNg41T5QzKfwt7hoLQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","last_reissued_at":"2026-07-05T10:18:00.919495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:00.919495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arijit Bishnu, Debarshi Chanda, Gopinath Mishra","submitted_at":"2025-02-21T11:04:43Z","abstract_excerpt":"Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \\varepsilon, \\delta <1$, along with \\texttt{Degree}, \\texttt{Neighbour}, \\texttt{Edge} and \\texttt{RandomEdge} query access to $G$, we provide a query based randomized algorithm to generate an estimate $\\widehat{T}$ of the number of triangles $T$ in $G$, such that $\\widehat{T} \\in [(1-\\varepsilon)T , (1+\\varepsilon)T]$ with probability at least $1-\\delta$. The query complexity of our algorithm is $\\widetilde{O}\\left({m \\alpha \\log(1/\\delta)}/{\\varepsilon^3 T}\\right)$, where $\\alpha$ is the arbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15379","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.15379/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.15379","created_at":"2026-07-05T10:18:00.919549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15379v1","created_at":"2026-07-05T10:18:00.919549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15379","created_at":"2026-07-05T10:18:00.919549+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTZ5MJUJR23S","created_at":"2026-07-05T10:18:00.919549+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTZ5MJUJR23SZKTZ","created_at":"2026-07-05T10:18:00.919549+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTZ5MJUJ","created_at":"2026-07-05T10:18:00.919549+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20828","citing_title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU","json":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU.json","graph_json":"https://pith.science/api/pith-number/VTZ5MJUJR23SZKTZ2Z4L6776SU/graph.json","events_json":"https://pith.science/api/pith-number/VTZ5MJUJR23SZKTZ2Z4L6776SU/events.json","paper":"https://pith.science/paper/VTZ5MJUJ"},"agent_actions":{"view_html":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU","download_json":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU.json","view_paper":"https://pith.science/paper/VTZ5MJUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15379&json=true","fetch_graph":"https://pith.science/api/pith-number/VTZ5MJUJR23SZKTZ2Z4L6776SU/graph.json","fetch_events":"https://pith.science/api/pith-number/VTZ5MJUJR23SZKTZ2Z4L6776SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/action/storage_attestation","attest_author":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/action/author_attestation","sign_citation":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/action/citation_signature","submit_replication":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/action/replication_record"}},"created_at":"2026-07-05T10:18:00.919549+00:00","updated_at":"2026-07-05T10:18:00.919549+00:00"}