{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q5XV52TPBHFZLK7VPIV4ZLKPIL","short_pith_number":"pith:Q5XV52TP","schema_version":"1.0","canonical_sha256":"876f5eea6f09cb95abf57a2bccad4f42fa02d639b3c91e34a40a03e17903a77d","source":{"kind":"arxiv","id":"1811.01056","version":2},"attestation_state":"computed","paper":{"title":"SPECTRE: Seedless Network Alignment via Spectral Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Francisco Barreras, Hamed Hassani, Mikhail Hayhoe, Victor M. Preciado","submitted_at":"2018-11-02T19:05:01Z","abstract_excerpt":"Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applications in a wide variety of fields, from the alignment of proteins in computational biology, to the de-anonymization of social networks, as well as recognition tasks in computer vision.\n  In this work we introduce SPECTRE, a scalable algorithm that uses spectral centrality measures and percolation techniques. Unlike most network alignment algorithms, SPECTRE requires no seeds (i.e., pairs of nodes identified beforehan"},"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":"1811.01056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-02T19:05:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d438e4225cf52c0cd09b712897f64b0036df568612ee7903466c1acb9ea3f782","abstract_canon_sha256":"99512065d42cdb63626b76c253628b2ac3c40efb4427013e09c31f014d460c27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:22.452067Z","signature_b64":"LALiLfu/b5Uj6CCpA2cPpqtSBXHaIFWmwwvq+JNvrtlDD5eqH211e5fHBgl/VwGmFGOsT0638tlnwhgjNRq0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"876f5eea6f09cb95abf57a2bccad4f42fa02d639b3c91e34a40a03e17903a77d","last_reissued_at":"2026-05-17T23:45:22.451714Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:22.451714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPECTRE: Seedless Network Alignment via Spectral Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Francisco Barreras, Hamed Hassani, Mikhail Hayhoe, Victor M. Preciado","submitted_at":"2018-11-02T19:05:01Z","abstract_excerpt":"Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applications in a wide variety of fields, from the alignment of proteins in computational biology, to the de-anonymization of social networks, as well as recognition tasks in computer vision.\n  In this work we introduce SPECTRE, a scalable algorithm that uses spectral centrality measures and percolation techniques. Unlike most network alignment algorithms, SPECTRE requires no seeds (i.e., pairs of nodes identified beforehan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01056","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":"1811.01056","created_at":"2026-05-17T23:45:22.451769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01056v2","created_at":"2026-05-17T23:45:22.451769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01056","created_at":"2026-05-17T23:45:22.451769+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5XV52TPBHFZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5XV52TPBHFZLK7V","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5XV52TP","created_at":"2026-05-18T12:32:46.962924+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/Q5XV52TPBHFZLK7VPIV4ZLKPIL","json":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL.json","graph_json":"https://pith.science/api/pith-number/Q5XV52TPBHFZLK7VPIV4ZLKPIL/graph.json","events_json":"https://pith.science/api/pith-number/Q5XV52TPBHFZLK7VPIV4ZLKPIL/events.json","paper":"https://pith.science/paper/Q5XV52TP"},"agent_actions":{"view_html":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL","download_json":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL.json","view_paper":"https://pith.science/paper/Q5XV52TP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01056&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5XV52TPBHFZLK7VPIV4ZLKPIL/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5XV52TPBHFZLK7VPIV4ZLKPIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/action/storage_attestation","attest_author":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/action/author_attestation","sign_citation":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/action/citation_signature","submit_replication":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/action/replication_record"}},"created_at":"2026-05-17T23:45:22.451769+00:00","updated_at":"2026-05-17T23:45:22.451769+00:00"}