{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GIXN5VZB6TFN3BTQTUNQECVCH2","short_pith_number":"pith:GIXN5VZB","schema_version":"1.0","canonical_sha256":"322eded721f4cadd86709d1b020aa23eaaf57f5e32c71f212c5a3699e141aac7","source":{"kind":"arxiv","id":"1602.04181","version":2},"attestation_state":"computed","paper":{"title":"Spectral Alignment of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ali Jadbabaie, Gerald Quon, Manolis Kellis, Mariana Recamonde-Mendoza, Muriel Medard, Soheil Feizi","submitted_at":"2016-02-12T19:38:33Z","abstract_excerpt":"Graph alignment refers to the problem of finding a bijective mapping across vertices of two graphs such that, if two nodes are connected in the first graph, their images are connected in the second graph. This problem arises in many fields such as computational biology, social sciences, and computer vision and is often cast as a quadratic assignment problem (QAP). Most standard graph alignment methods consider an optimization that maximizes the number of matches between the two graphs, ignoring the effect of mismatches. We propose a generalized graph alignment formulation that considers both 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":"1602.04181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T19:38:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"303e248319850ed9efb06754a1d0f40452142ee577be97e8da84cf97e7611fa5","abstract_canon_sha256":"7332216a1c4607c5752d3354cf1c0c7a3dc9c737233a2fafe3234928590690a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:04.082944Z","signature_b64":"59W9qFR6LSUZ8tsIRkPC77cXw2xdV8gCFEgNphC6x0cwdnJ/w9G0WkOFcnRmmS3rXJ2QheoK/ZPYDZ7qeE39BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"322eded721f4cadd86709d1b020aa23eaaf57f5e32c71f212c5a3699e141aac7","last_reissued_at":"2026-05-18T00:36:04.082336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:04.082336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Alignment of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ali Jadbabaie, Gerald Quon, Manolis Kellis, Mariana Recamonde-Mendoza, Muriel Medard, Soheil Feizi","submitted_at":"2016-02-12T19:38:33Z","abstract_excerpt":"Graph alignment refers to the problem of finding a bijective mapping across vertices of two graphs such that, if two nodes are connected in the first graph, their images are connected in the second graph. This problem arises in many fields such as computational biology, social sciences, and computer vision and is often cast as a quadratic assignment problem (QAP). Most standard graph alignment methods consider an optimization that maximizes the number of matches between the two graphs, ignoring the effect of mismatches. We propose a generalized graph alignment formulation that considers both m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04181","kind":"arxiv","version":2},"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":"1602.04181","created_at":"2026-05-18T00:36:04.082437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04181v2","created_at":"2026-05-18T00:36:04.082437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04181","created_at":"2026-05-18T00:36:04.082437+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIXN5VZB6TFN","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIXN5VZB6TFN3BTQ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIXN5VZB","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2502.17142","citing_title":"The feasibility of multi-graph alignment: a Bayesian approach","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08880","citing_title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2402.15095","citing_title":"The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2502.17142","citing_title":"The feasibility of multi-graph alignment: a Bayesian approach","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2","json":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2.json","graph_json":"https://pith.science/api/pith-number/GIXN5VZB6TFN3BTQTUNQECVCH2/graph.json","events_json":"https://pith.science/api/pith-number/GIXN5VZB6TFN3BTQTUNQECVCH2/events.json","paper":"https://pith.science/paper/GIXN5VZB"},"agent_actions":{"view_html":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2","download_json":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2.json","view_paper":"https://pith.science/paper/GIXN5VZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04181&json=true","fetch_graph":"https://pith.science/api/pith-number/GIXN5VZB6TFN3BTQTUNQECVCH2/graph.json","fetch_events":"https://pith.science/api/pith-number/GIXN5VZB6TFN3BTQTUNQECVCH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/action/storage_attestation","attest_author":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/action/author_attestation","sign_citation":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/action/citation_signature","submit_replication":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/action/replication_record"}},"created_at":"2026-05-18T00:36:04.082437+00:00","updated_at":"2026-05-18T00:36:04.082437+00:00"}