{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FMXHQ7SUAJGBVZWAIO4JQA437W","short_pith_number":"pith:FMXHQ7SU","canonical_record":{"source":{"id":"1205.6691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-30T14:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"2b31740850835ef11ef040c7138f1212ad6845566e1a6d7b4b7f85ddba77bb39","abstract_canon_sha256":"8a4f55ef7170bc801b54ac7db29f2016a0031291632988e60e6b346957bfd302"},"schema_version":"1.0"},"canonical_sha256":"2b2e787e54024c1ae6c043b898039bfdb61e569387059905704a8db7d8ea5393","source":{"kind":"arxiv","id":"1205.6691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6691","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6691v1","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6691","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"FMXHQ7SUAJGB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FMXHQ7SUAJGBVZWA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FMXHQ7SU","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FMXHQ7SUAJGBVZWAIO4JQA437W","target":"record","payload":{"canonical_record":{"source":{"id":"1205.6691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-30T14:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"2b31740850835ef11ef040c7138f1212ad6845566e1a6d7b4b7f85ddba77bb39","abstract_canon_sha256":"8a4f55ef7170bc801b54ac7db29f2016a0031291632988e60e6b346957bfd302"},"schema_version":"1.0"},"canonical_sha256":"2b2e787e54024c1ae6c043b898039bfdb61e569387059905704a8db7d8ea5393","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:38.212984Z","signature_b64":"NwK/60znXfA/xCuwadyyNFiHvNUkTs6iwsJEtD3kYf5E76Dx5EsbqgUjBP/xkxoNf3HYzT/MCD9NVvFKyWlyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b2e787e54024c1ae6c043b898039bfdb61e569387059905704a8db7d8ea5393","last_reissued_at":"2026-05-18T03:54:38.212349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:38.212349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.6691","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-18T03:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z95JWFSXZUJo2mJhwrMqw0VZTMLPquRRhzGUqp70MkUPuoEGnEhDYpDIwExoJqojR54DYfe7onXlfbFJYWTEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:15:37.066660Z"},"content_sha256":"34e3968049d0329e9818cd69e71234912d58cacfed2827d50971fc280cf09655","schema_version":"1.0","event_id":"sha256:34e3968049d0329e9818cd69e71234912d58cacfed2827d50971fc280cf09655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FMXHQ7SUAJGBVZWAIO4JQA437W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Subgraph Matching on Billion Node Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bin Shao, Haixun Wang, Hongzhi Wang, Jianzhong Li, Zhao Sun","submitted_at":"2012-05-30T14:32:16Z","abstract_excerpt":"The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear indexing space. Unfortunately, for very large graphs, super-linear approaches are almost always infeasible. In this paper, we study the problem of subgraph matching on billion-node graphs. We present a novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6691","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-18T03:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eH2EliFAEuqQNLfeHCnkK4Bal8zYZnuCT8ug0WWDwxIcnNTi0b1FQXqtXywGbYNhxRLSishPGqpQpaH4RDuzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:15:37.067329Z"},"content_sha256":"7893a8e78905706207b4db69dd6e1841e78c3aedd518773d4620a21c26ddcdb1","schema_version":"1.0","event_id":"sha256:7893a8e78905706207b4db69dd6e1841e78c3aedd518773d4620a21c26ddcdb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMXHQ7SUAJGBVZWAIO4JQA437W/bundle.json","state_url":"https://pith.science/pith/FMXHQ7SUAJGBVZWAIO4JQA437W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMXHQ7SUAJGBVZWAIO4JQA437W/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-07-02T10:15:37Z","links":{"resolver":"https://pith.science/pith/FMXHQ7SUAJGBVZWAIO4JQA437W","bundle":"https://pith.science/pith/FMXHQ7SUAJGBVZWAIO4JQA437W/bundle.json","state":"https://pith.science/pith/FMXHQ7SUAJGBVZWAIO4JQA437W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMXHQ7SUAJGBVZWAIO4JQA437W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FMXHQ7SUAJGBVZWAIO4JQA437W","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":"8a4f55ef7170bc801b54ac7db29f2016a0031291632988e60e6b346957bfd302","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-30T14:32:16Z","title_canon_sha256":"2b31740850835ef11ef040c7138f1212ad6845566e1a6d7b4b7f85ddba77bb39"},"schema_version":"1.0","source":{"id":"1205.6691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6691","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6691v1","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6691","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"FMXHQ7SUAJGB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FMXHQ7SUAJGBVZWA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FMXHQ7SU","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:7893a8e78905706207b4db69dd6e1841e78c3aedd518773d4620a21c26ddcdb1","target":"graph","created_at":"2026-05-18T03:54:38Z","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":"The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear indexing space. Unfortunately, for very large graphs, super-linear approaches are almost always infeasible. In this paper, we study the problem of subgraph matching on billion-node graphs. We present a novel ","authors_text":"Bin Shao, Haixun Wang, Hongzhi Wang, Jianzhong Li, Zhao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-30T14:32:16Z","title":"Efficient Subgraph Matching on Billion Node Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6691","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:34e3968049d0329e9818cd69e71234912d58cacfed2827d50971fc280cf09655","target":"record","created_at":"2026-05-18T03:54:38Z","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":"8a4f55ef7170bc801b54ac7db29f2016a0031291632988e60e6b346957bfd302","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-30T14:32:16Z","title_canon_sha256":"2b31740850835ef11ef040c7138f1212ad6845566e1a6d7b4b7f85ddba77bb39"},"schema_version":"1.0","source":{"id":"1205.6691","kind":"arxiv","version":1}},"canonical_sha256":"2b2e787e54024c1ae6c043b898039bfdb61e569387059905704a8db7d8ea5393","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b2e787e54024c1ae6c043b898039bfdb61e569387059905704a8db7d8ea5393","first_computed_at":"2026-05-18T03:54:38.212349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:38.212349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NwK/60znXfA/xCuwadyyNFiHvNUkTs6iwsJEtD3kYf5E76Dx5EsbqgUjBP/xkxoNf3HYzT/MCD9NVvFKyWlyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:38.212984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34e3968049d0329e9818cd69e71234912d58cacfed2827d50971fc280cf09655","sha256:7893a8e78905706207b4db69dd6e1841e78c3aedd518773d4620a21c26ddcdb1"],"state_sha256":"8103ede043e956f92acb5fc39aae8c8dbd57029e3728c7898584e4cc29df16c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsoOB7gqKJYLNPVz/5CO4SOarE++F0o53KIvT2q12hRyVwTBABXl3+1vqil5QFcciTgnWKkLEVT34BuyLYPIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T10:15:37.069998Z","bundle_sha256":"e04018632bfd588eeff50bac27f4e1fc76deb182858eab94692979d58e8db67c"}}