{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GIXN5VZB6TFN3BTQTUNQECVCH2","short_pith_number":"pith:GIXN5VZB","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"},"canonical_sha256":"322eded721f4cadd86709d1b020aa23eaaf57f5e32c71f212c5a3699e141aac7","source":{"kind":"arxiv","id":"1602.04181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04181","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04181v2","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04181","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"GIXN5VZB6TFN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GIXN5VZB6TFN3BTQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GIXN5VZB","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GIXN5VZB6TFN3BTQTUNQECVCH2","target":"record","payload":{"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"},"canonical_sha256":"322eded721f4cadd86709d1b020aa23eaaf57f5e32c71f212c5a3699e141aac7","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"},"source_kind":"arxiv","source_id":"1602.04181","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-18T00:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17vqcKCwOkQo4MVkQTp/RuGox2pet7j1pIzJ+0IuJDMvhT6ULFjgqSwn7SOsJuOWy827Ecfp9aF6lbjRlkoeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:38:29.169887Z"},"content_sha256":"6945550970538cab6f6e0550de3e5a57a61e611ff3b7a2e4d06af85160d8a2b2","schema_version":"1.0","event_id":"sha256:6945550970538cab6f6e0550de3e5a57a61e611ff3b7a2e4d06af85160d8a2b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GIXN5VZB6TFN3BTQTUNQECVCH2","target":"graph","payload":{"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"},"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-18T00:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9rcnJw2RAGd62/JaI9j/T41/7HmI4hE6HIaAdc4cwdobiUttzJCIbS0KZ/910K0KhHtk863QYx9QlDA3glSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:38:29.170297Z"},"content_sha256":"327fe8902f90b43fda177db282ccff2c19d7a3a8d8b25f35a1abe9ea1c817b3e","schema_version":"1.0","event_id":"sha256:327fe8902f90b43fda177db282ccff2c19d7a3a8d8b25f35a1abe9ea1c817b3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/bundle.json","state_url":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/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-05-25T07:38:29Z","links":{"resolver":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2","bundle":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/bundle.json","state":"https://pith.science/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIXN5VZB6TFN3BTQTUNQECVCH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GIXN5VZB6TFN3BTQTUNQECVCH2","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":"7332216a1c4607c5752d3354cf1c0c7a3dc9c737233a2fafe3234928590690a9","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T19:38:33Z","title_canon_sha256":"303e248319850ed9efb06754a1d0f40452142ee577be97e8da84cf97e7611fa5"},"schema_version":"1.0","source":{"id":"1602.04181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04181","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04181v2","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04181","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"GIXN5VZB6TFN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GIXN5VZB6TFN3BTQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GIXN5VZB","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:327fe8902f90b43fda177db282ccff2c19d7a3a8d8b25f35a1abe9ea1c817b3e","target":"graph","created_at":"2026-05-18T00:36:04Z","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":"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","authors_text":"Ali Jadbabaie, Gerald Quon, Manolis Kellis, Mariana Recamonde-Mendoza, Muriel Medard, Soheil Feizi","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T19:38:33Z","title":"Spectral Alignment of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04181","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:6945550970538cab6f6e0550de3e5a57a61e611ff3b7a2e4d06af85160d8a2b2","target":"record","created_at":"2026-05-18T00:36:04Z","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":"7332216a1c4607c5752d3354cf1c0c7a3dc9c737233a2fafe3234928590690a9","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T19:38:33Z","title_canon_sha256":"303e248319850ed9efb06754a1d0f40452142ee577be97e8da84cf97e7611fa5"},"schema_version":"1.0","source":{"id":"1602.04181","kind":"arxiv","version":2}},"canonical_sha256":"322eded721f4cadd86709d1b020aa23eaaf57f5e32c71f212c5a3699e141aac7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"322eded721f4cadd86709d1b020aa23eaaf57f5e32c71f212c5a3699e141aac7","first_computed_at":"2026-05-18T00:36:04.082336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:04.082336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"59W9qFR6LSUZ8tsIRkPC77cXw2xdV8gCFEgNphC6x0cwdnJ/w9G0WkOFcnRmmS3rXJ2QheoK/ZPYDZ7qeE39BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:04.082944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6945550970538cab6f6e0550de3e5a57a61e611ff3b7a2e4d06af85160d8a2b2","sha256:327fe8902f90b43fda177db282ccff2c19d7a3a8d8b25f35a1abe9ea1c817b3e"],"state_sha256":"9efa81c07d02267528639519bd5667d9904f9268cf0b1061c96dd459a81dff42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6PLvnCvrPRcgPRqOG50m791hvjQ3AGjR38NL4r0HEaIz4rRhMfn+vVq2wXOgQAJtbkVMNSzclHvg+OQz/d3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:38:29.173663Z","bundle_sha256":"c2bea6bb76cab73384c3ea7b191b82abb7fd013bb227c5ac49c77e96cab0b8a1"}}