{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MWQQH2A7SRJTFQLG4QQLLW24PC","short_pith_number":"pith:MWQQH2A7","schema_version":"1.0","canonical_sha256":"65a103e81f945332c166e420b5db5c78a5a02159d6c37615aa83dcf098c8fa50","source":{"kind":"arxiv","id":"1504.00954","version":3},"attestation_state":"computed","paper":{"title":"Approximately Counting Triangles in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, C. Seshadhri, Dana Ron, Talya Eden","submitted_at":"2015-04-03T22:40:41Z","abstract_excerpt":"We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\\em sublinear-time\\/} algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The allowed queries are degree queries, vertex-pair queries and neighbor queries.\n  We show that for any given approximation parameter $0<\\epsilon<1$, the algorithm provides an estimate $\\widehat{t}$ such that with high constant probabi"},"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":"1504.00954","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T22:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"2f52feb3021dd2ba0feded90f68d214f7ac8c69c0c351bae53091cf7e7ee580e","abstract_canon_sha256":"19b5f33efb3793bc22394cc0c3b02b24848b027b9dc1e521d20b513db193b2ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.882457Z","signature_b64":"fRjE9ZaYRnCdmgQw975c3Rc+UTuGCcKY/u4ZdvckNk0IXworWv2SapFCUoKvsXLHMQTZttYPXg3bxOZ38685BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a103e81f945332c166e420b5db5c78a5a02159d6c37615aa83dcf098c8fa50","last_reissued_at":"2026-05-18T00:58:35.881855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.881855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximately Counting Triangles in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, C. Seshadhri, Dana Ron, Talya Eden","submitted_at":"2015-04-03T22:40:41Z","abstract_excerpt":"We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\\em sublinear-time\\/} algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The allowed queries are degree queries, vertex-pair queries and neighbor queries.\n  We show that for any given approximation parameter $0<\\epsilon<1$, the algorithm provides an estimate $\\widehat{t}$ such that with high constant probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00954","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1504.00954","created_at":"2026-05-18T00:58:35.881947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00954v3","created_at":"2026-05-18T00:58:35.881947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00954","created_at":"2026-05-18T00:58:35.881947+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWQQH2A7SRJT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWQQH2A7SRJTFQLG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWQQH2A7","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC","json":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC.json","graph_json":"https://pith.science/api/pith-number/MWQQH2A7SRJTFQLG4QQLLW24PC/graph.json","events_json":"https://pith.science/api/pith-number/MWQQH2A7SRJTFQLG4QQLLW24PC/events.json","paper":"https://pith.science/paper/MWQQH2A7"},"agent_actions":{"view_html":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC","download_json":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC.json","view_paper":"https://pith.science/paper/MWQQH2A7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00954&json=true","fetch_graph":"https://pith.science/api/pith-number/MWQQH2A7SRJTFQLG4QQLLW24PC/graph.json","fetch_events":"https://pith.science/api/pith-number/MWQQH2A7SRJTFQLG4QQLLW24PC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/action/storage_attestation","attest_author":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/action/author_attestation","sign_citation":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/action/citation_signature","submit_replication":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/action/replication_record"}},"created_at":"2026-05-18T00:58:35.881947+00:00","updated_at":"2026-05-18T00:58:35.881947+00:00"}