{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q5XV52TPBHFZLK7VPIV4ZLKPIL","short_pith_number":"pith:Q5XV52TP","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"},"canonical_sha256":"876f5eea6f09cb95abf57a2bccad4f42fa02d639b3c91e34a40a03e17903a77d","source":{"kind":"arxiv","id":"1811.01056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01056","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01056v2","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01056","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q5XV52TPBHFZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q5XV52TPBHFZLK7V","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q5XV52TP","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q5XV52TPBHFZLK7VPIV4ZLKPIL","target":"record","payload":{"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"},"canonical_sha256":"876f5eea6f09cb95abf57a2bccad4f42fa02d639b3c91e34a40a03e17903a77d","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"},"source_kind":"arxiv","source_id":"1811.01056","source_version":2,"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-17T23:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czQrGyjOMR8wOVz0l8TjrJIbcvKl8xBzbAEkAgvJE9SqHCAPC4BUr6JqBA0gIqM/P9JKSnhQ8i3S92oEM+H/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:50:41.597712Z"},"content_sha256":"6202b4ab9ae30388d99ea49a364e68afe2e4e5baaab964727441d4ce3383edcd","schema_version":"1.0","event_id":"sha256:6202b4ab9ae30388d99ea49a364e68afe2e4e5baaab964727441d4ce3383edcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q5XV52TPBHFZLK7VPIV4ZLKPIL","target":"graph","payload":{"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"},"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-17T23:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgUHncwtAi74GT/Orzk0RmE2FdvgDXZYzZtuajVkCCO1yI9Ya31lc7X8ue2cTTIlYZafGmoQGU2Ll2zZ7dTlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:50:41.598154Z"},"content_sha256":"5f245a6a77b8954df8e9188dd55e3705d9deb139e46ca34bfc337f085d011fcd","schema_version":"1.0","event_id":"sha256:5f245a6a77b8954df8e9188dd55e3705d9deb139e46ca34bfc337f085d011fcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/bundle.json","state_url":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/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-06-22T10:50:41Z","links":{"resolver":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL","bundle":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/bundle.json","state":"https://pith.science/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5XV52TPBHFZLK7VPIV4ZLKPIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q5XV52TPBHFZLK7VPIV4ZLKPIL","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":"99512065d42cdb63626b76c253628b2ac3c40efb4427013e09c31f014d460c27","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-02T19:05:01Z","title_canon_sha256":"d438e4225cf52c0cd09b712897f64b0036df568612ee7903466c1acb9ea3f782"},"schema_version":"1.0","source":{"id":"1811.01056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01056","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01056v2","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01056","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q5XV52TPBHFZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q5XV52TPBHFZLK7V","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q5XV52TP","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:5f245a6a77b8954df8e9188dd55e3705d9deb139e46ca34bfc337f085d011fcd","target":"graph","created_at":"2026-05-17T23:45:22Z","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":"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","authors_text":"Francisco Barreras, Hamed Hassani, Mikhail Hayhoe, Victor M. Preciado","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-02T19:05:01Z","title":"SPECTRE: Seedless Network Alignment via Spectral Centralities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01056","kind":"arxiv","version":2},"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:6202b4ab9ae30388d99ea49a364e68afe2e4e5baaab964727441d4ce3383edcd","target":"record","created_at":"2026-05-17T23:45:22Z","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":"99512065d42cdb63626b76c253628b2ac3c40efb4427013e09c31f014d460c27","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-02T19:05:01Z","title_canon_sha256":"d438e4225cf52c0cd09b712897f64b0036df568612ee7903466c1acb9ea3f782"},"schema_version":"1.0","source":{"id":"1811.01056","kind":"arxiv","version":2}},"canonical_sha256":"876f5eea6f09cb95abf57a2bccad4f42fa02d639b3c91e34a40a03e17903a77d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"876f5eea6f09cb95abf57a2bccad4f42fa02d639b3c91e34a40a03e17903a77d","first_computed_at":"2026-05-17T23:45:22.451714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:22.451714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LALiLfu/b5Uj6CCpA2cPpqtSBXHaIFWmwwvq+JNvrtlDD5eqH211e5fHBgl/VwGmFGOsT0638tlnwhgjNRq0Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:22.452067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6202b4ab9ae30388d99ea49a364e68afe2e4e5baaab964727441d4ce3383edcd","sha256:5f245a6a77b8954df8e9188dd55e3705d9deb139e46ca34bfc337f085d011fcd"],"state_sha256":"4926af3a7429eb6c9a95efc2b5fe025ec180464a9e7ffcd1a629f03cfd83ae59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vq/+D2+BTsvWWzSi5qhKiGvr/sf08tiZvKBhVCvZTF0XSU7jJRgRFXJ0F0kVPds4io689AP86WIrY95LU6aRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:50:41.600169Z","bundle_sha256":"260791facc96dc9fece6d4924ec0ce6688bb283ef3b58ae88e94577636e011b2"}}