{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GR7N24G4FLTZEJQFHHPHMD5MAM","short_pith_number":"pith:GR7N24G4","canonical_record":{"source":{"id":"1610.09411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-10-28T21:49:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5d643ccae45bcd03f1dc6536bd178c3336df23c2661e91b03036a4dd51a07c0c","abstract_canon_sha256":"04f00160dc854fb67b6319ebd125eb4c66e28559ed8459bf4639a53a828743dd"},"schema_version":"1.0"},"canonical_sha256":"347edd70dc2ae792260539de760fac0320d1e5c1ce76e7353d9efe5cf5e28f57","source":{"kind":"arxiv","id":"1610.09411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09411","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09411v1","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09411","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"GR7N24G4FLTZ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GR7N24G4FLTZEJQF","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GR7N24G4","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GR7N24G4FLTZEJQFHHPHMD5MAM","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-10-28T21:49:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5d643ccae45bcd03f1dc6536bd178c3336df23c2661e91b03036a4dd51a07c0c","abstract_canon_sha256":"04f00160dc854fb67b6319ebd125eb4c66e28559ed8459bf4639a53a828743dd"},"schema_version":"1.0"},"canonical_sha256":"347edd70dc2ae792260539de760fac0320d1e5c1ce76e7353d9efe5cf5e28f57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.086251Z","signature_b64":"NkKEQyC4TLt5oAcR5niIB8UscEvdc01RR02dZu0s9c+cKGEEnCaEZj8Chvoa7FJCCeY2y3Xz0CoUSgfiCribDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347edd70dc2ae792260539de760fac0320d1e5c1ce76e7353d9efe5cf5e28f57","last_reissued_at":"2026-05-18T01:00:52.085592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.085592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09411","source_version":1,"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-18T01:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcBa6iJ/Xy4NpOHvioLbPjV1fxWcpnOou9T26gjRyZzhjMTMFmXJj0WBJcwHeZ0CcUKV6Vpo4NaS5jTeogL4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:44.080395Z"},"content_sha256":"6db4cf45bf41e1b7f1f664d91038bc3b9e0204ca2d090faa29dd02132a4a320b","schema_version":"1.0","event_id":"sha256:6db4cf45bf41e1b7f1f664d91038bc3b9e0204ca2d090faa29dd02132a4a320b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GR7N24G4FLTZEJQFHHPHMD5MAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ESCAPE: Efficiently Counting All 5-Vertex Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ali Pinar, C. Seshadhri, V. Vishal","submitted_at":"2016-10-28T21:49:44Z","abstract_excerpt":"Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special case of triangle counting has received much attention. Getting results for 4-vertex or 5-vertex patterns is highly challenging, and there are few practical results known that can scale to massive sizes.\n  We introduce an algorithmic framework that can be adopted to count any small pattern in a graph and apply this framework to compute exact counts for \\emph{all} 5-vertex subgraphs. Our framework is built on cutting a pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09411","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":""},"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-18T01:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYxAvK+usKqV5yzP/ywbVUlXAHEhNMOwkFt00BxnpAVlQ3JOPrK0GariVretdeyHj1/WxLxbFa9YgAGoQzhTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:44.080770Z"},"content_sha256":"ca2b05913087deb464f31550561a5e8c44912cf122fe48736c313333a89f1d28","schema_version":"1.0","event_id":"sha256:ca2b05913087deb464f31550561a5e8c44912cf122fe48736c313333a89f1d28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GR7N24G4FLTZEJQFHHPHMD5MAM/bundle.json","state_url":"https://pith.science/pith/GR7N24G4FLTZEJQFHHPHMD5MAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GR7N24G4FLTZEJQFHHPHMD5MAM/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-02T04:42:44Z","links":{"resolver":"https://pith.science/pith/GR7N24G4FLTZEJQFHHPHMD5MAM","bundle":"https://pith.science/pith/GR7N24G4FLTZEJQFHHPHMD5MAM/bundle.json","state":"https://pith.science/pith/GR7N24G4FLTZEJQFHHPHMD5MAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GR7N24G4FLTZEJQFHHPHMD5MAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GR7N24G4FLTZEJQFHHPHMD5MAM","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":"04f00160dc854fb67b6319ebd125eb4c66e28559ed8459bf4639a53a828743dd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-10-28T21:49:44Z","title_canon_sha256":"5d643ccae45bcd03f1dc6536bd178c3336df23c2661e91b03036a4dd51a07c0c"},"schema_version":"1.0","source":{"id":"1610.09411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09411","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09411v1","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09411","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"GR7N24G4FLTZ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GR7N24G4FLTZEJQF","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GR7N24G4","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:ca2b05913087deb464f31550561a5e8c44912cf122fe48736c313333a89f1d28","target":"graph","created_at":"2026-05-18T01:00:52Z","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":"Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special case of triangle counting has received much attention. Getting results for 4-vertex or 5-vertex patterns is highly challenging, and there are few practical results known that can scale to massive sizes.\n  We introduce an algorithmic framework that can be adopted to count any small pattern in a graph and apply this framework to compute exact counts for \\emph{all} 5-vertex subgraphs. Our framework is built on cutting a pa","authors_text":"Ali Pinar, C. Seshadhri, V. Vishal","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-10-28T21:49:44Z","title":"ESCAPE: Efficiently Counting All 5-Vertex Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09411","kind":"arxiv","version":1},"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:6db4cf45bf41e1b7f1f664d91038bc3b9e0204ca2d090faa29dd02132a4a320b","target":"record","created_at":"2026-05-18T01:00:52Z","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":"04f00160dc854fb67b6319ebd125eb4c66e28559ed8459bf4639a53a828743dd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-10-28T21:49:44Z","title_canon_sha256":"5d643ccae45bcd03f1dc6536bd178c3336df23c2661e91b03036a4dd51a07c0c"},"schema_version":"1.0","source":{"id":"1610.09411","kind":"arxiv","version":1}},"canonical_sha256":"347edd70dc2ae792260539de760fac0320d1e5c1ce76e7353d9efe5cf5e28f57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"347edd70dc2ae792260539de760fac0320d1e5c1ce76e7353d9efe5cf5e28f57","first_computed_at":"2026-05-18T01:00:52.085592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:52.085592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NkKEQyC4TLt5oAcR5niIB8UscEvdc01RR02dZu0s9c+cKGEEnCaEZj8Chvoa7FJCCeY2y3Xz0CoUSgfiCribDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:52.086251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db4cf45bf41e1b7f1f664d91038bc3b9e0204ca2d090faa29dd02132a4a320b","sha256:ca2b05913087deb464f31550561a5e8c44912cf122fe48736c313333a89f1d28"],"state_sha256":"a562924a731609b1c8dc80dc889f2471f0e6d99f0700e70ad2dbe8bbcab7777e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EqN9e9bi4NJkc0wpT3Wb7cqoR18ZLopmsPfexaQIPiWcy/3BvUJqerQ0rH9rulYe59GDynDPRrpbQfDJ7wMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:42:44.082789Z","bundle_sha256":"c9f3e693bb29dfc26282a1722de4a9f6da7c92fb99ea0e00ea6601130eedcd78"}}