{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2MB3JGJ7KB7XJICO24GS2Y5WXU","short_pith_number":"pith:2MB3JGJ7","canonical_record":{"source":{"id":"1807.09299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-24T18:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"20e19396899adc79faac21bea4417519a6b1755c6140eebf272029c4a7a39aa1","abstract_canon_sha256":"9368d3084e335044b6820bb25727acdafb1c78b6dfb066ed2a95060d8d02e786"},"schema_version":"1.0"},"canonical_sha256":"d303b4993f507f74a04ed70d2d63b6bd3888f3e11d92915bf017178a921400cf","source":{"kind":"arxiv","id":"1807.09299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09299","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09299v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09299","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"2MB3JGJ7KB7X","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2MB3JGJ7KB7XJICO","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2MB3JGJ7","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2MB3JGJ7KB7XJICO24GS2Y5WXU","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-24T18:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"20e19396899adc79faac21bea4417519a6b1755c6140eebf272029c4a7a39aa1","abstract_canon_sha256":"9368d3084e335044b6820bb25727acdafb1c78b6dfb066ed2a95060d8d02e786"},"schema_version":"1.0"},"canonical_sha256":"d303b4993f507f74a04ed70d2d63b6bd3888f3e11d92915bf017178a921400cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:51.724538Z","signature_b64":"GTXX6rEe8Q1i062r9d+B/EBsYabwzc7e5adIAFx69uLJ3alGGNwH7BcEuwCrLTqQe11aaYcFEuk1tk1P7TqfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d303b4993f507f74a04ed70d2d63b6bd3888f3e11d92915bf017178a921400cf","last_reissued_at":"2026-05-18T00:09:51.724035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:51.724035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09299","source_version":1,"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:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3HkE2tC+JOyPNsStx+4CSmMTGaksq5MEaXjN9xgpbLPpN8agxucPOhMjwF7ikgvGeyQe9KEBO3d97I4D40rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:59:04.112524Z"},"content_sha256":"503fa9ee8551cace52fa4301ecccb23fe3a7ddc1cf8ed6cb308f7a626f1b1577","schema_version":"1.0","event_id":"sha256:503fa9ee8551cace52fa4301ecccb23fe3a7ddc1cf8ed6cb308f7a626f1b1577"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2MB3JGJ7KB7XJICO24GS2Y5WXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tractable Graph Matching via Soft Seeding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Daniel L. Sussman, Fei Fang, Vince Lyzinski","submitted_at":"2018-07-24T18:31:13Z","abstract_excerpt":"The graph matching problem aims to discover a latent correspondence between the vertex sets of two observed graphs. This problem has proven to be quite challenging, with few satisfying methods that are computationally tractable and widely applicable. The FAQ algorithm has proven to have good performance on benchmark problems and works with a indefinite relaxation of the problem. Due to the indefinite relaxation, FAQ is not guaranteed to find the global maximum. However, if prior information is known about the true correspondence, this can be leveraged to initialize the algorithm near the truth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09299","kind":"arxiv","version":1},"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:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64ewBelRgsrYAViFZS7frDVm7NbvJteeothx+oSUG8qYAPmgNI6DlAbenpPgSHx1vxbSuCTUPEin7H1h1KgXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:59:04.112916Z"},"content_sha256":"c7396c7773461b993322a4a0b0aa34319885dc334aac46974d095b20eb5c329c","schema_version":"1.0","event_id":"sha256:c7396c7773461b993322a4a0b0aa34319885dc334aac46974d095b20eb5c329c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU/bundle.json","state_url":"https://pith.science/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU/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-31T03:59:04Z","links":{"resolver":"https://pith.science/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU","bundle":"https://pith.science/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU/bundle.json","state":"https://pith.science/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MB3JGJ7KB7XJICO24GS2Y5WXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2MB3JGJ7KB7XJICO24GS2Y5WXU","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":"9368d3084e335044b6820bb25727acdafb1c78b6dfb066ed2a95060d8d02e786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-24T18:31:13Z","title_canon_sha256":"20e19396899adc79faac21bea4417519a6b1755c6140eebf272029c4a7a39aa1"},"schema_version":"1.0","source":{"id":"1807.09299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09299","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09299v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09299","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"2MB3JGJ7KB7X","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2MB3JGJ7KB7XJICO","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2MB3JGJ7","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:c7396c7773461b993322a4a0b0aa34319885dc334aac46974d095b20eb5c329c","target":"graph","created_at":"2026-05-18T00:09:51Z","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":"The graph matching problem aims to discover a latent correspondence between the vertex sets of two observed graphs. This problem has proven to be quite challenging, with few satisfying methods that are computationally tractable and widely applicable. The FAQ algorithm has proven to have good performance on benchmark problems and works with a indefinite relaxation of the problem. Due to the indefinite relaxation, FAQ is not guaranteed to find the global maximum. However, if prior information is known about the true correspondence, this can be leveraged to initialize the algorithm near the truth","authors_text":"Daniel L. Sussman, Fei Fang, Vince Lyzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-24T18:31:13Z","title":"Tractable Graph Matching via Soft Seeding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09299","kind":"arxiv","version":1},"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:503fa9ee8551cace52fa4301ecccb23fe3a7ddc1cf8ed6cb308f7a626f1b1577","target":"record","created_at":"2026-05-18T00:09:51Z","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":"9368d3084e335044b6820bb25727acdafb1c78b6dfb066ed2a95060d8d02e786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-24T18:31:13Z","title_canon_sha256":"20e19396899adc79faac21bea4417519a6b1755c6140eebf272029c4a7a39aa1"},"schema_version":"1.0","source":{"id":"1807.09299","kind":"arxiv","version":1}},"canonical_sha256":"d303b4993f507f74a04ed70d2d63b6bd3888f3e11d92915bf017178a921400cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d303b4993f507f74a04ed70d2d63b6bd3888f3e11d92915bf017178a921400cf","first_computed_at":"2026-05-18T00:09:51.724035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:51.724035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GTXX6rEe8Q1i062r9d+B/EBsYabwzc7e5adIAFx69uLJ3alGGNwH7BcEuwCrLTqQe11aaYcFEuk1tk1P7TqfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:51.724538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:503fa9ee8551cace52fa4301ecccb23fe3a7ddc1cf8ed6cb308f7a626f1b1577","sha256:c7396c7773461b993322a4a0b0aa34319885dc334aac46974d095b20eb5c329c"],"state_sha256":"fec10a4a9e201353fdeaa481bcf62b8ae7edb7dd0c382e517cae7a4b4a103d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEybO5DJkruhgvyaJdKqbiERX80C7L8Nn83stWWf+9OoX2dhTbyCEvfSa/qdGbQnRK5yjZuzPjyoXFMFxNgzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:59:04.116515Z","bundle_sha256":"5ca276b85fe23e83b743a414dc0626ef79b6a492d37ca3749b9134dd2830bcc5"}}