{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MWQQH2A7SRJTFQLG4QQLLW24PC","short_pith_number":"pith:MWQQH2A7","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"},"canonical_sha256":"65a103e81f945332c166e420b5db5c78a5a02159d6c37615aa83dcf098c8fa50","source":{"kind":"arxiv","id":"1504.00954","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MWQQH2A7SRJTFQLG4QQLLW24PC","target":"record","payload":{"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"},"canonical_sha256":"65a103e81f945332c166e420b5db5c78a5a02159d6c37615aa83dcf098c8fa50","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"},"source_kind":"arxiv","source_id":"1504.00954","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Js4HzqVOOxkFE00luTxYyDzOoJaqtDhpSIOBuACaaVlVwiSNbTh3lvGs/esOIeVvAILmSicVZXGzHhaCukiMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:34:37.457695Z"},"content_sha256":"e5cf2bacee8f870e45e5973f61ac17943278a9b96458340ec184d1d697623e9b","schema_version":"1.0","event_id":"sha256:e5cf2bacee8f870e45e5973f61ac17943278a9b96458340ec184d1d697623e9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MWQQH2A7SRJTFQLG4QQLLW24PC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZu8beqbjIdQlktJNsDQWr+VAMSUNql5SiAvRBBwkykXNiOdGj9PrHjCMTy4mwEPo/8DiS5bMt+kZC54AqrrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:34:37.458024Z"},"content_sha256":"491a9f3c4fe1989ea9d84842be903920c336cf61f8fd7daa299bbbe708e825d7","schema_version":"1.0","event_id":"sha256:491a9f3c4fe1989ea9d84842be903920c336cf61f8fd7daa299bbbe708e825d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/bundle.json","state_url":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T16:34:37Z","links":{"resolver":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC","bundle":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/bundle.json","state":"https://pith.science/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWQQH2A7SRJTFQLG4QQLLW24PC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E69l0MrPiCB3KCdiAx8GGwGE77DIJ9RymmsY5T3AduZbMEZdiKR6Do9zxiLBjZQA4ak/8exy4Yz7uJtzh3r2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:34:37.459990Z","bundle_sha256":"c612eb7f5dd8a87d5b95ce0ec34de4edaf5a175960e339e0b4b4f41006a3480d"}}