{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M6BVGJZQYYGQKNSHKTIZHCMNRI","short_pith_number":"pith:M6BVGJZQ","schema_version":"1.0","canonical_sha256":"6783532730c60d05364754d193898d8a24077cba120fb2a6692cf6bb148942d6","source":{"kind":"arxiv","id":"1304.7844","version":4},"attestation_state":"computed","paper":{"title":"Seeded graph matching for correlated Erd\\H{o}s-R\\'enyi graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.OC","authors_text":"Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski","submitted_at":"2013-04-30T03:21:48Z","abstract_excerpt":"Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical results on the consistency of graph matching for estimating a latent alignment function between the vertex sets of two graphs, as well as subsequent algorithmic implications when the latent alignment is partially observed. In the correlated Erd\\H{o}s-R\\'enyi graph setting, we prove that graph matching provides a strongly consistent estimate of the latent alignment in the presence of even modest correlation. We then investigate a tractable, restricted-focus version of"},"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":"1304.7844","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-30T03:21:48Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"10ce2a25e9f6476bdfdf133da97d85fbfcef0aa6c0c1e46d401fe7939a6b970b","abstract_canon_sha256":"26aa4134371ea60a2309998ed4e8fd200b5ad5249710b61cfeace9fcf21a01df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:04.671402Z","signature_b64":"MJliUkPFxCpCaf28Kq7rzhf85ddCVml5xAFdEoRq8IyxeUFRAFPN2BxHUdW/8/JGL54FhY76bdczVT+i6MR3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6783532730c60d05364754d193898d8a24077cba120fb2a6692cf6bb148942d6","last_reissued_at":"2026-05-18T02:46:04.670813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:04.670813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Seeded graph matching for correlated Erd\\H{o}s-R\\'enyi graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.OC","authors_text":"Carey E. Priebe, Donniell E. Fishkind, Vince Lyzinski","submitted_at":"2013-04-30T03:21:48Z","abstract_excerpt":"Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical results on the consistency of graph matching for estimating a latent alignment function between the vertex sets of two graphs, as well as subsequent algorithmic implications when the latent alignment is partially observed. In the correlated Erd\\H{o}s-R\\'enyi graph setting, we prove that graph matching provides a strongly consistent estimate of the latent alignment in the presence of even modest correlation. We then investigate a tractable, restricted-focus version of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7844","kind":"arxiv","version":4},"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":"1304.7844","created_at":"2026-05-18T02:46:04.670894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7844v4","created_at":"2026-05-18T02:46:04.670894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7844","created_at":"2026-05-18T02:46:04.670894+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6BVGJZQYYGQ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6BVGJZQYYGQKNSH","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6BVGJZQ","created_at":"2026-05-18T12:27:51.066281+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/M6BVGJZQYYGQKNSHKTIZHCMNRI","json":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI.json","graph_json":"https://pith.science/api/pith-number/M6BVGJZQYYGQKNSHKTIZHCMNRI/graph.json","events_json":"https://pith.science/api/pith-number/M6BVGJZQYYGQKNSHKTIZHCMNRI/events.json","paper":"https://pith.science/paper/M6BVGJZQ"},"agent_actions":{"view_html":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI","download_json":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI.json","view_paper":"https://pith.science/paper/M6BVGJZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7844&json=true","fetch_graph":"https://pith.science/api/pith-number/M6BVGJZQYYGQKNSHKTIZHCMNRI/graph.json","fetch_events":"https://pith.science/api/pith-number/M6BVGJZQYYGQKNSHKTIZHCMNRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI/action/storage_attestation","attest_author":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI/action/author_attestation","sign_citation":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI/action/citation_signature","submit_replication":"https://pith.science/pith/M6BVGJZQYYGQKNSHKTIZHCMNRI/action/replication_record"}},"created_at":"2026-05-18T02:46:04.670894+00:00","updated_at":"2026-05-18T02:46:04.670894+00:00"}