{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z4LIJPFR2XAPK6JJTSIM7X2SP5","short_pith_number":"pith:Z4LIJPFR","canonical_record":{"source":{"id":"1402.3444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-14T12:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"a3f60b56b9831c2a7aee51ed93775896bf1687024eb309763eea383be09db00e","abstract_canon_sha256":"672c0784a85a3685371cef2f4164045717d1990db87358c65d82417a0b125a27"},"schema_version":"1.0"},"canonical_sha256":"cf1684bcb1d5c0f579299c90cfdf527f780b5ec29a9ece63195cbdc2f51479c3","source":{"kind":"arxiv","id":"1402.3444","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3444","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3444v3","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3444","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z4LIJPFR2XAP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4LIJPFR2XAPK6JJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4LIJPFR","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z4LIJPFR2XAPK6JJTSIM7X2SP5","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-14T12:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"a3f60b56b9831c2a7aee51ed93775896bf1687024eb309763eea383be09db00e","abstract_canon_sha256":"672c0784a85a3685371cef2f4164045717d1990db87358c65d82417a0b125a27"},"schema_version":"1.0"},"canonical_sha256":"cf1684bcb1d5c0f579299c90cfdf527f780b5ec29a9ece63195cbdc2f51479c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:08.252582Z","signature_b64":"o2m69TxJGnFpc/SUok2+caZMonyjFGVCtWktjCxcn3VBJNajPAHcjZX/igNkUKmtcA0pN/1kiCHIsDq8zI+WBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf1684bcb1d5c0f579299c90cfdf527f780b5ec29a9ece63195cbdc2f51479c3","last_reissued_at":"2026-05-18T01:27:08.251907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:08.251907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3444","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-18T01:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdsLPLItSkHq1zpu2jkfT5yVgR7sGt1OTgr+n8fjdtgkwmAUP62/t/PT/KtlYdzrPL82Ty9KptVgh8xP3AcPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:29:19.393976Z"},"content_sha256":"ff01241aa7a13e9cf42c1a84bae6f61eae73b8820602e2004115a0fda947aa15","schema_version":"1.0","event_id":"sha256:ff01241aa7a13e9cf42c1a84bae6f61eae73b8820602e2004115a0fda947aa15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z4LIJPFR2XAPK6JJTSIM7X2SP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraph Enumeration in Massive Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri","submitted_at":"2014-02-14T12:01:47Z","abstract_excerpt":"We consider the problem of enumerating all instances of a given pattern graph in a large data graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges in the data graph, $k=O(1)$ be the number of vertices in the pattern graph, $B$ be the block length, and $M$ be the main memory size. The main results of the paper are two algorithms that enumerate all instances of the pattern graph. The first one is a deterministic algorithm that exploits a suitable independent set of the pattern graph of size $1\\leq s \\leq k/2$ and requires $O\\left(E^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3444","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-18T01:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COiWHTENzteZ9RMljlMv9ZyVvg2PuC3AGyEGw+M/dJrOdM8N1chqDPEcfq9lIGxkNnNc7BHA9K4fHRIj1HflDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:29:19.394330Z"},"content_sha256":"03b71fb16e2abf9fe1b17014fe9922899c27475edf34a4d7108b7bdd4acd4970","schema_version":"1.0","event_id":"sha256:03b71fb16e2abf9fe1b17014fe9922899c27475edf34a4d7108b7bdd4acd4970"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5/bundle.json","state_url":"https://pith.science/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5/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-04T00:29:19Z","links":{"resolver":"https://pith.science/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5","bundle":"https://pith.science/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5/bundle.json","state":"https://pith.science/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4LIJPFR2XAPK6JJTSIM7X2SP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z4LIJPFR2XAPK6JJTSIM7X2SP5","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":"672c0784a85a3685371cef2f4164045717d1990db87358c65d82417a0b125a27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-14T12:01:47Z","title_canon_sha256":"a3f60b56b9831c2a7aee51ed93775896bf1687024eb309763eea383be09db00e"},"schema_version":"1.0","source":{"id":"1402.3444","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3444","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3444v3","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3444","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z4LIJPFR2XAP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4LIJPFR2XAPK6JJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4LIJPFR","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:03b71fb16e2abf9fe1b17014fe9922899c27475edf34a4d7108b7bdd4acd4970","target":"graph","created_at":"2026-05-18T01:27:08Z","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 enumerating all instances of a given pattern graph in a large data graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges in the data graph, $k=O(1)$ be the number of vertices in the pattern graph, $B$ be the block length, and $M$ be the main memory size. The main results of the paper are two algorithms that enumerate all instances of the pattern graph. The first one is a deterministic algorithm that exploits a suitable independent set of the pattern graph of size $1\\leq s \\leq k/2$ and requires $O\\left(E^","authors_text":"Francesco Silvestri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-14T12:01:47Z","title":"Subgraph Enumeration in Massive Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3444","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:ff01241aa7a13e9cf42c1a84bae6f61eae73b8820602e2004115a0fda947aa15","target":"record","created_at":"2026-05-18T01:27:08Z","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":"672c0784a85a3685371cef2f4164045717d1990db87358c65d82417a0b125a27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-14T12:01:47Z","title_canon_sha256":"a3f60b56b9831c2a7aee51ed93775896bf1687024eb309763eea383be09db00e"},"schema_version":"1.0","source":{"id":"1402.3444","kind":"arxiv","version":3}},"canonical_sha256":"cf1684bcb1d5c0f579299c90cfdf527f780b5ec29a9ece63195cbdc2f51479c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf1684bcb1d5c0f579299c90cfdf527f780b5ec29a9ece63195cbdc2f51479c3","first_computed_at":"2026-05-18T01:27:08.251907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:08.251907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o2m69TxJGnFpc/SUok2+caZMonyjFGVCtWktjCxcn3VBJNajPAHcjZX/igNkUKmtcA0pN/1kiCHIsDq8zI+WBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:08.252582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3444","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff01241aa7a13e9cf42c1a84bae6f61eae73b8820602e2004115a0fda947aa15","sha256:03b71fb16e2abf9fe1b17014fe9922899c27475edf34a4d7108b7bdd4acd4970"],"state_sha256":"a47604e3fc67103c61e226fe2f090867bdaef34cb54c3792952381f5b5f3fed6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOap3GjnRKzEeT0HtH1+9Asl3om6k9kCLOKJ9v5zMCYIFZvZygcJT5e3gwTaDzTAB3znkU1ZgnxM31ecXN1KDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:29:19.396654Z","bundle_sha256":"8cb35237e6286f7ec3590566ac1387e5661906b704e65fa17aa6630d88c27261"}}