{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7OKDM5SKCQ2SKWZC2RF7OZ75SF","short_pith_number":"pith:7OKDM5SK","canonical_record":{"source":{"id":"1304.1572","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T22:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"bc125657904950106558011bc6bc46d1abe42d171922c6b6ee2577ad52c4f78f","abstract_canon_sha256":"fe5f949ebf8e9147744e2f2306b202b5ad6052bf744dffaff7351a95d07de6f6"},"schema_version":"1.0"},"canonical_sha256":"fb9436764a1435255b22d44bf767fd9152b46c5f96e16d59cc858ce147226588","source":{"kind":"arxiv","id":"1304.1572","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1572","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1572v5","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1572","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"7OKDM5SKCQ2S","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7OKDM5SKCQ2SKWZC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7OKDM5SK","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7OKDM5SKCQ2SKWZC2RF7OZ75SF","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1572","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T22:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"bc125657904950106558011bc6bc46d1abe42d171922c6b6ee2577ad52c4f78f","abstract_canon_sha256":"fe5f949ebf8e9147744e2f2306b202b5ad6052bf744dffaff7351a95d07de6f6"},"schema_version":"1.0"},"canonical_sha256":"fb9436764a1435255b22d44bf767fd9152b46c5f96e16d59cc858ce147226588","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:47.291572Z","signature_b64":"DYed10VguD1HSkxBsDCk7pU/ocq1ysVMXsozkPwSB4bKUwfkAgrVi9mUynGT7rASOmgN4ck+KjpdOQS5cY2zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb9436764a1435255b22d44bf767fd9152b46c5f96e16d59cc858ce147226588","last_reissued_at":"2026-05-18T00:18:47.290906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:47.290906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1572","source_version":5,"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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qgb6xXYuKubMIgZMo58CbM1e18A0k/2EEv708zmz+Lr53FhwArv6BeZKcimacnvT53HInuAuIyCHtwEr1iTTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:26:02.538739Z"},"content_sha256":"8a3c3cfa92244701bb2e5d1e9d96b12c3e682ba4cd7422378778065283765b07","schema_version":"1.0","event_id":"sha256:8a3c3cfa92244701bb2e5d1e9d96b12c3e682ba4cd7422378778065283765b07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7OKDM5SKCQ2SKWZC2RF7OZ75SF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable and Informative Spectral Signatures for Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Leonidas Guibas, Nan Hu, Raif M. Rustamov","submitted_at":"2013-04-04T22:19:49Z","abstract_excerpt":"In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion into the popular integer quadratic program formulation. Our approach relies on a rigorous analysis of stability of spectral signatures based on the graph Laplacian. In the case of the first order term, we derive an objective function that measures both the stability and informativeness of a given spectral signature. By optimizing this objective, we design new spectral node signatures tuned to a specific graph to be mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1572","kind":"arxiv","version":5},"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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwQoVwgFa9UeXOdAx/MPWVv8Jstn5j5F8IAvFx5CKn5M2e7rdmNPtG87fciEfLTkjD5JXunC4OxiLYouLSviCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:26:02.539386Z"},"content_sha256":"5e9915552ef9054aa72781d331242fd7fae0d2f55a29ecb7f1402eb911a39e6a","schema_version":"1.0","event_id":"sha256:5e9915552ef9054aa72781d331242fd7fae0d2f55a29ecb7f1402eb911a39e6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF/bundle.json","state_url":"https://pith.science/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF/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-02T18:26:02Z","links":{"resolver":"https://pith.science/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF","bundle":"https://pith.science/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF/bundle.json","state":"https://pith.science/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OKDM5SKCQ2SKWZC2RF7OZ75SF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7OKDM5SKCQ2SKWZC2RF7OZ75SF","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":"fe5f949ebf8e9147744e2f2306b202b5ad6052bf744dffaff7351a95d07de6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T22:19:49Z","title_canon_sha256":"bc125657904950106558011bc6bc46d1abe42d171922c6b6ee2577ad52c4f78f"},"schema_version":"1.0","source":{"id":"1304.1572","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1572","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1572v5","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1572","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"7OKDM5SKCQ2S","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7OKDM5SKCQ2SKWZC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7OKDM5SK","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:5e9915552ef9054aa72781d331242fd7fae0d2f55a29ecb7f1402eb911a39e6a","target":"graph","created_at":"2026-05-18T00:18:47Z","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":"In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion into the popular integer quadratic program formulation. Our approach relies on a rigorous analysis of stability of spectral signatures based on the graph Laplacian. In the case of the first order term, we derive an objective function that measures both the stability and informativeness of a given spectral signature. By optimizing this objective, we design new spectral node signatures tuned to a specific graph to be mat","authors_text":"Leonidas Guibas, Nan Hu, Raif M. Rustamov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T22:19:49Z","title":"Stable and Informative Spectral Signatures for Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1572","kind":"arxiv","version":5},"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:8a3c3cfa92244701bb2e5d1e9d96b12c3e682ba4cd7422378778065283765b07","target":"record","created_at":"2026-05-18T00:18:47Z","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":"fe5f949ebf8e9147744e2f2306b202b5ad6052bf744dffaff7351a95d07de6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T22:19:49Z","title_canon_sha256":"bc125657904950106558011bc6bc46d1abe42d171922c6b6ee2577ad52c4f78f"},"schema_version":"1.0","source":{"id":"1304.1572","kind":"arxiv","version":5}},"canonical_sha256":"fb9436764a1435255b22d44bf767fd9152b46c5f96e16d59cc858ce147226588","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb9436764a1435255b22d44bf767fd9152b46c5f96e16d59cc858ce147226588","first_computed_at":"2026-05-18T00:18:47.290906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:47.290906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DYed10VguD1HSkxBsDCk7pU/ocq1ysVMXsozkPwSB4bKUwfkAgrVi9mUynGT7rASOmgN4ck+KjpdOQS5cY2zAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:47.291572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1572","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a3c3cfa92244701bb2e5d1e9d96b12c3e682ba4cd7422378778065283765b07","sha256:5e9915552ef9054aa72781d331242fd7fae0d2f55a29ecb7f1402eb911a39e6a"],"state_sha256":"46145def7237cee03863066269dca7ee95af2f7ee677e579d31f0e6789a16bbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cChMxT5lTzRYHqrVHykZTMvL4JCdh9cx2YbMObMh5ztP0UMRGSddA27nga3D1FrzKAoEax5INjq+idoYUnMAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:26:02.542298Z","bundle_sha256":"c176cefd820195e7882a14435ef0909c188771f274ba734b54c00c4984bca154"}}