{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4UUCGSSROVJUX6AB5D4EDMMLGW","short_pith_number":"pith:4UUCGSSR","canonical_record":{"source":{"id":"1810.11152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T00:38:04Z","cross_cats_sorted":["cs.DB","cs.SI"],"title_canon_sha256":"c564412a68c53b725c487bca0ee6a94422db5ad20ae0c30855b844aed35a9d3e","abstract_canon_sha256":"1306866810bf6c1aec0f2e0ccef6e21fac1725edcbd7aee9451b226d58c9161b"},"schema_version":"1.0"},"canonical_sha256":"e528234a5175534bf801e8f841b18b35b0b80a7bc0738d754e8180c0a962d5a6","source":{"kind":"arxiv","id":"1810.11152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11152","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11152v1","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11152","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"4UUCGSSROVJU","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UUCGSSROVJUX6AB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UUCGSSR","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4UUCGSSROVJUX6AB5D4EDMMLGW","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T00:38:04Z","cross_cats_sorted":["cs.DB","cs.SI"],"title_canon_sha256":"c564412a68c53b725c487bca0ee6a94422db5ad20ae0c30855b844aed35a9d3e","abstract_canon_sha256":"1306866810bf6c1aec0f2e0ccef6e21fac1725edcbd7aee9451b226d58c9161b"},"schema_version":"1.0"},"canonical_sha256":"e528234a5175534bf801e8f841b18b35b0b80a7bc0738d754e8180c0a962d5a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:15.062632Z","signature_b64":"JwKsD+vds7Zkf2EE4h+nZUCHNgomXNUPwJkwfx2F1mfY/xsj7imC9I8v/g2FVHmiV4cHbgY/LtcY46cc+yniDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e528234a5175534bf801e8f841b18b35b0b80a7bc0738d754e8180c0a962d5a6","last_reissued_at":"2026-05-18T00:02:15.061949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:15.061949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11152","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFksTe/vsJ1EVZ1XyUFdyDl4Fy/K990mhazIxMAPsikY2JzLepAi5/CTd+8SiH9POU6cs+oPrtPaYlQ8/USbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:04:41.063019Z"},"content_sha256":"58cb9ab3a483f5280a4c8e7d57a60025351deefbb8501eb1af809395a55bada9","schema_version":"1.0","event_id":"sha256:58cb9ab3a483f5280a4c8e7d57a60025351deefbb8501eb1af809395a55bada9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4UUCGSSROVJUX6AB5D4EDMMLGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.SI"],"primary_cat":"cs.DS","authors_text":"Haida Zhang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Zengfeng Huang, Zhe Lin","submitted_at":"2018-10-26T00:38:04Z","abstract_excerpt":"Driven by many real applications, we study the problem of seeded graph matching. Given two graphs $G_1 = (V_1, E_1)$ and $G_2 = (V_2, E_2)$, and a small set $S$ of pre-matched node pairs $[u, v]$ where $u \\in V_1$ and $v \\in V_2$, the problem is to identify a matching between $V_1$ and $V_2$ growing from $S$, such that each pair in the matching corresponds to the same underlying entity. Recent studies on efficient and effective seeded graph matching have drawn a great deal of attention and many popular methods are largely based on exploring the similarity between local structures to identify m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11152","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBqN/cSUO785lOWU3KMct0yRr1uLSH9fQJgGmZOMsRs8VvKl0YA6Wjp/dbvUDW906X1msW3wLaftcsjU9/jPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:04:41.063403Z"},"content_sha256":"15c07073fae94a707b79d88f732a7341dea66cc277be2a426bef2fd36bf86e12","schema_version":"1.0","event_id":"sha256:15c07073fae94a707b79d88f732a7341dea66cc277be2a426bef2fd36bf86e12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/bundle.json","state_url":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/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-05-30T20:04:41Z","links":{"resolver":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW","bundle":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/bundle.json","state":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4UUCGSSROVJUX6AB5D4EDMMLGW","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":"1306866810bf6c1aec0f2e0ccef6e21fac1725edcbd7aee9451b226d58c9161b","cross_cats_sorted":["cs.DB","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T00:38:04Z","title_canon_sha256":"c564412a68c53b725c487bca0ee6a94422db5ad20ae0c30855b844aed35a9d3e"},"schema_version":"1.0","source":{"id":"1810.11152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11152","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11152v1","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11152","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"4UUCGSSROVJU","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UUCGSSROVJUX6AB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UUCGSSR","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:15c07073fae94a707b79d88f732a7341dea66cc277be2a426bef2fd36bf86e12","target":"graph","created_at":"2026-05-18T00:02:15Z","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":"Driven by many real applications, we study the problem of seeded graph matching. Given two graphs $G_1 = (V_1, E_1)$ and $G_2 = (V_2, E_2)$, and a small set $S$ of pre-matched node pairs $[u, v]$ where $u \\in V_1$ and $v \\in V_2$, the problem is to identify a matching between $V_1$ and $V_2$ growing from $S$, such that each pair in the matching corresponds to the same underlying entity. Recent studies on efficient and effective seeded graph matching have drawn a great deal of attention and many popular methods are largely based on exploring the similarity between local structures to identify m","authors_text":"Haida Zhang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Zengfeng Huang, Zhe Lin","cross_cats":["cs.DB","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T00:38:04Z","title":"Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11152","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:58cb9ab3a483f5280a4c8e7d57a60025351deefbb8501eb1af809395a55bada9","target":"record","created_at":"2026-05-18T00:02:15Z","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":"1306866810bf6c1aec0f2e0ccef6e21fac1725edcbd7aee9451b226d58c9161b","cross_cats_sorted":["cs.DB","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T00:38:04Z","title_canon_sha256":"c564412a68c53b725c487bca0ee6a94422db5ad20ae0c30855b844aed35a9d3e"},"schema_version":"1.0","source":{"id":"1810.11152","kind":"arxiv","version":1}},"canonical_sha256":"e528234a5175534bf801e8f841b18b35b0b80a7bc0738d754e8180c0a962d5a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e528234a5175534bf801e8f841b18b35b0b80a7bc0738d754e8180c0a962d5a6","first_computed_at":"2026-05-18T00:02:15.061949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:15.061949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JwKsD+vds7Zkf2EE4h+nZUCHNgomXNUPwJkwfx2F1mfY/xsj7imC9I8v/g2FVHmiV4cHbgY/LtcY46cc+yniDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:15.062632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58cb9ab3a483f5280a4c8e7d57a60025351deefbb8501eb1af809395a55bada9","sha256:15c07073fae94a707b79d88f732a7341dea66cc277be2a426bef2fd36bf86e12"],"state_sha256":"b34e9a558f7205f7d31c5d7d82ca24068a46a3fee344f2500a74fdcd0dd14419"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNh7cIP7otlhfOS3I1dht0p/FvgxLfpkfOOkN760/gxO7Oe5gc4oyqSW2ILMnJ7QnyGtjCGjdta3NNaej5nIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:04:41.065602Z","bundle_sha256":"4a8caf9ec16e7f275f48224c2ad2f1e5aa399208bb108f57506e58f0fe9347db"}}