{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MWQQH2A7SRJTFQLG4QQLLW24PC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"19b5f33efb3793bc22394cc0c3b02b24848b027b9dc1e521d20b513db193b2ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T22:40:41Z","title_canon_sha256":"2f52feb3021dd2ba0feded90f68d214f7ac8c69c0c351bae53091cf7e7ee580e"},"schema_version":"1.0","source":{"id":"1504.00954","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00954","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00954v3","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00954","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"MWQQH2A7SRJT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MWQQH2A7SRJTFQLG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MWQQH2A7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:491a9f3c4fe1989ea9d84842be903920c336cf61f8fd7daa299bbbe708e825d7","target":"graph","created_at":"2026-05-18T00:58:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amit Levi, C. Seshadhri, Dana Ron, Talya Eden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T22:40:41Z","title":"Approximately Counting Triangles in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00954","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5cf2bacee8f870e45e5973f61ac17943278a9b96458340ec184d1d697623e9b","target":"record","created_at":"2026-05-18T00:58:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"19b5f33efb3793bc22394cc0c3b02b24848b027b9dc1e521d20b513db193b2ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T22:40:41Z","title_canon_sha256":"2f52feb3021dd2ba0feded90f68d214f7ac8c69c0c351bae53091cf7e7ee580e"},"schema_version":"1.0","source":{"id":"1504.00954","kind":"arxiv","version":3}},"canonical_sha256":"65a103e81f945332c166e420b5db5c78a5a02159d6c37615aa83dcf098c8fa50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a103e81f945332c166e420b5db5c78a5a02159d6c37615aa83dcf098c8fa50","first_computed_at":"2026-05-18T00:58:35.881855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.881855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fRjE9ZaYRnCdmgQw975c3Rc+UTuGCcKY/u4ZdvckNk0IXworWv2SapFCUoKvsXLHMQTZttYPXg3bxOZ38685BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.882457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00954","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5cf2bacee8f870e45e5973f61ac17943278a9b96458340ec184d1d697623e9b","sha256:491a9f3c4fe1989ea9d84842be903920c336cf61f8fd7daa299bbbe708e825d7"],"state_sha256":"986537104eec9427bb155131485585950a9aaeaaac478424b555eda81daed680"}