{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4UUCGSSROVJUX6AB5D4EDMMLGW","short_pith_number":"pith:4UUCGSSR","schema_version":"1.0","canonical_sha256":"e528234a5175534bf801e8f841b18b35b0b80a7bc0738d754e8180c0a962d5a6","source":{"kind":"arxiv","id":"1810.11152","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.11152","created_at":"2026-05-18T00:02:15.062054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11152v1","created_at":"2026-05-18T00:02:15.062054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11152","created_at":"2026-05-18T00:02:15.062054+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UUCGSSROVJU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UUCGSSROVJUX6AB","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UUCGSSR","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW","json":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW.json","graph_json":"https://pith.science/api/pith-number/4UUCGSSROVJUX6AB5D4EDMMLGW/graph.json","events_json":"https://pith.science/api/pith-number/4UUCGSSROVJUX6AB5D4EDMMLGW/events.json","paper":"https://pith.science/paper/4UUCGSSR"},"agent_actions":{"view_html":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW","download_json":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW.json","view_paper":"https://pith.science/paper/4UUCGSSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11152&json=true","fetch_graph":"https://pith.science/api/pith-number/4UUCGSSROVJUX6AB5D4EDMMLGW/graph.json","fetch_events":"https://pith.science/api/pith-number/4UUCGSSROVJUX6AB5D4EDMMLGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/action/storage_attestation","attest_author":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/action/author_attestation","sign_citation":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/action/citation_signature","submit_replication":"https://pith.science/pith/4UUCGSSROVJUX6AB5D4EDMMLGW/action/replication_record"}},"created_at":"2026-05-18T00:02:15.062054+00:00","updated_at":"2026-05-18T00:02:15.062054+00:00"}