{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:73F7EEIIPCE6RZCGLMGOJIDFG7","short_pith_number":"pith:73F7EEII","canonical_record":{"source":{"id":"1612.09155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-12-29T14:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"436a18b97da52c8247145cad619a20c33a161c3eec0b017b32b072709b1dc87f","abstract_canon_sha256":"ae691b3da042b75d1e6659d9d34b83c8dd6a30504d83649625551ff13d83c1b3"},"schema_version":"1.0"},"canonical_sha256":"fecbf211087889e8e4465b0ce4a06537fd79e5bb40019062991799a812a351b8","source":{"kind":"arxiv","id":"1612.09155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09155","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09155v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09155","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"73F7EEIIPCE6","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"73F7EEIIPCE6RZCG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"73F7EEII","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:73F7EEIIPCE6RZCGLMGOJIDFG7","target":"record","payload":{"canonical_record":{"source":{"id":"1612.09155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-12-29T14:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"436a18b97da52c8247145cad619a20c33a161c3eec0b017b32b072709b1dc87f","abstract_canon_sha256":"ae691b3da042b75d1e6659d9d34b83c8dd6a30504d83649625551ff13d83c1b3"},"schema_version":"1.0"},"canonical_sha256":"fecbf211087889e8e4465b0ce4a06537fd79e5bb40019062991799a812a351b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:46.356944Z","signature_b64":"mHDmda3hEUCeOAISYCAv6TV2br8E1wF68zkTEnD6LOGldVPRtPm6iy0ari87bhCzGblvRnRrOiowq7fop4U5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fecbf211087889e8e4465b0ce4a06537fd79e5bb40019062991799a812a351b8","last_reissued_at":"2026-05-18T00:53:46.356538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:46.356538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.09155","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-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vErlX2NKPZFPJ08rlw/XuwJX6WAF8Q6BwONjdVjVOhsq2ycuWQO3CGna4QCMfyzQfdqaRF8XG6v6bbNe2CquCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:14:00.198293Z"},"content_sha256":"436ebdf51b2f5bffca029021fdc5ee08c523a4d5e99baa1b4d87b31c4abf8e67","schema_version":"1.0","event_id":"sha256:436ebdf51b2f5bffca029021fdc5ee08c523a4d5e99baa1b4d87b31c4abf8e67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:73F7EEIIPCE6RZCGLMGOJIDFG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MSQ-Index: A Succinct Index for Fast Graph Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Xiaoyang Chen","submitted_at":"2016-12-29T14:23:46Z","abstract_excerpt":"Graph similarity search has received considerable attention in many applications, such as bioinformatics, data mining, pattern recognition, and social networks. Existing methods for this problem have limited scalability because of the huge amount of memory they consume when handling very large graph databases with millions or billions of graphs.\n  In this paper, we study the problem of graph similarity search under the graph edit distance constraint. We present a space-efficient index structure based upon the q-gram tree that incorporates succinct data structures and hybrid encoding to achieve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09155","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-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmXDckkVob3hBbFD4FlMfBbE9y+ojme9Tgzwp6LbTv3/50mQWOnAmbG9vruEC4Au7UojzuQp+ZQTbv5cFDKoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:14:00.198648Z"},"content_sha256":"988d9fe838822990447e7a0c5ee37671f412f49df22ccf83853214605a98c035","schema_version":"1.0","event_id":"sha256:988d9fe838822990447e7a0c5ee37671f412f49df22ccf83853214605a98c035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73F7EEIIPCE6RZCGLMGOJIDFG7/bundle.json","state_url":"https://pith.science/pith/73F7EEIIPCE6RZCGLMGOJIDFG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73F7EEIIPCE6RZCGLMGOJIDFG7/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-27T17:14:00Z","links":{"resolver":"https://pith.science/pith/73F7EEIIPCE6RZCGLMGOJIDFG7","bundle":"https://pith.science/pith/73F7EEIIPCE6RZCGLMGOJIDFG7/bundle.json","state":"https://pith.science/pith/73F7EEIIPCE6RZCGLMGOJIDFG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73F7EEIIPCE6RZCGLMGOJIDFG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:73F7EEIIPCE6RZCGLMGOJIDFG7","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":"ae691b3da042b75d1e6659d9d34b83c8dd6a30504d83649625551ff13d83c1b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-12-29T14:23:46Z","title_canon_sha256":"436a18b97da52c8247145cad619a20c33a161c3eec0b017b32b072709b1dc87f"},"schema_version":"1.0","source":{"id":"1612.09155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09155","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09155v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09155","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"73F7EEIIPCE6","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"73F7EEIIPCE6RZCG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"73F7EEII","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:988d9fe838822990447e7a0c5ee37671f412f49df22ccf83853214605a98c035","target":"graph","created_at":"2026-05-18T00:53:46Z","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":"Graph similarity search has received considerable attention in many applications, such as bioinformatics, data mining, pattern recognition, and social networks. Existing methods for this problem have limited scalability because of the huge amount of memory they consume when handling very large graph databases with millions or billions of graphs.\n  In this paper, we study the problem of graph similarity search under the graph edit distance constraint. We present a space-efficient index structure based upon the q-gram tree that incorporates succinct data structures and hybrid encoding to achieve","authors_text":"Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Xiaoyang Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-12-29T14:23:46Z","title":"MSQ-Index: A Succinct Index for Fast Graph Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09155","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:436ebdf51b2f5bffca029021fdc5ee08c523a4d5e99baa1b4d87b31c4abf8e67","target":"record","created_at":"2026-05-18T00:53:46Z","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":"ae691b3da042b75d1e6659d9d34b83c8dd6a30504d83649625551ff13d83c1b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-12-29T14:23:46Z","title_canon_sha256":"436a18b97da52c8247145cad619a20c33a161c3eec0b017b32b072709b1dc87f"},"schema_version":"1.0","source":{"id":"1612.09155","kind":"arxiv","version":1}},"canonical_sha256":"fecbf211087889e8e4465b0ce4a06537fd79e5bb40019062991799a812a351b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fecbf211087889e8e4465b0ce4a06537fd79e5bb40019062991799a812a351b8","first_computed_at":"2026-05-18T00:53:46.356538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:46.356538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mHDmda3hEUCeOAISYCAv6TV2br8E1wF68zkTEnD6LOGldVPRtPm6iy0ari87bhCzGblvRnRrOiowq7fop4U5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:46.356944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.09155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:436ebdf51b2f5bffca029021fdc5ee08c523a4d5e99baa1b4d87b31c4abf8e67","sha256:988d9fe838822990447e7a0c5ee37671f412f49df22ccf83853214605a98c035"],"state_sha256":"6809f33e142537ce86e2427e78be371865c3687618a7f161e2f8b81bfa96e19e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LutITLlNUpK8q9X0XnYudafSc5dJPzUSLRxHnbcORPK4x9y+pwnzBrNC9X5GsIuOWH0cRbL3m5MGUHdKss7dDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:14:00.201095Z","bundle_sha256":"0293add9d8968e0738c18bb0478249a6e711e09040cbdeb7d67f39016744c9ea"}}