{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:7HL3MCC4HKCXJ32WFJNXZZ67DG","short_pith_number":"pith:7HL3MCC4","canonical_record":{"source":{"id":"0907.3338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-20T04:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"5f536eab07baaf5e06586ab2a636f9096d9067c57c0d155887bd0eb0bea254fe","abstract_canon_sha256":"9bfae8349b8e5b66e1d716bddfb85e6c2992a0332607e6cf9f5f465b351f61a3"},"schema_version":"1.0"},"canonical_sha256":"f9d7b6085c3a8574ef562a5b7ce7df198b901ca94eb16001dbd4dd9aeb3aa42e","source":{"kind":"arxiv","id":"0907.3338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.3338","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"0907.3338v2","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3338","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"7HL3MCC4HKCX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7HL3MCC4HKCXJ32W","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7HL3MCC4","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:7HL3MCC4HKCXJ32WFJNXZZ67DG","target":"record","payload":{"canonical_record":{"source":{"id":"0907.3338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-20T04:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"5f536eab07baaf5e06586ab2a636f9096d9067c57c0d155887bd0eb0bea254fe","abstract_canon_sha256":"9bfae8349b8e5b66e1d716bddfb85e6c2992a0332607e6cf9f5f465b351f61a3"},"schema_version":"1.0"},"canonical_sha256":"f9d7b6085c3a8574ef562a5b7ce7df198b901ca94eb16001dbd4dd9aeb3aa42e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:45.957572Z","signature_b64":"3woCwc5g5ao9Z1iifyWYQLx2TT+AeoHD5rMpetJ/hclb7wnTBlAIkEZz39HgwwqGOGEzQaHhUQ6wqaEDbEzcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9d7b6085c3a8574ef562a5b7ce7df198b901ca94eb16001dbd4dd9aeb3aa42e","last_reissued_at":"2026-05-18T04:09:45.957173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:45.957173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.3338","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-18T04:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jr3FgGrWK190bkVRaDguV/qaxiwIGpyWEXDaiX9eppNh6Nw2Ebn8CIUfvZfSzJLjcnAMbskv3cI4Gl6auOkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:35:48.241678Z"},"content_sha256":"77d85d9bca9fc96dccda3e90364f44a496105efab41bf3bc7c2a1a037bd54d1d","schema_version":"1.0","event_id":"sha256:77d85d9bca9fc96dccda3e90364f44a496105efab41bf3bc7c2a1a037bd54d1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:7HL3MCC4HKCXJ32WFJNXZZ67DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Message Passing Algorithms for Sparse Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amin Saberi, David F. Gleich, Mohsen Bayati, Ying Wang","submitted_at":"2009-07-20T04:40:39Z","abstract_excerpt":"Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it where only a small number of matches between the vertices of the two graphs are possible. We propose a new message passing algorithm that allows us to compute, very efficiently, approximate solutions to the sparse network alignment problems with graph sizes as large as hundreds of thousands of vertices. We also provide extensive simulations comparing our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3338","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-18T04:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkfgoTf6M6NyrRl3VgXG76sHnJI8HXwvk/ByNp0VqtzQL7M7KN2ItorVT5GMrJiYlPHXsAqSYrdz0IzSAk65BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:35:48.242065Z"},"content_sha256":"e0d29c5681243a49a84c40e3dcf6d4a60cf8fc9bff7880b50621d203491e7a3a","schema_version":"1.0","event_id":"sha256:e0d29c5681243a49a84c40e3dcf6d4a60cf8fc9bff7880b50621d203491e7a3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG/bundle.json","state_url":"https://pith.science/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG/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-01T09:35:48Z","links":{"resolver":"https://pith.science/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG","bundle":"https://pith.science/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG/bundle.json","state":"https://pith.science/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HL3MCC4HKCXJ32WFJNXZZ67DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7HL3MCC4HKCXJ32WFJNXZZ67DG","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":"9bfae8349b8e5b66e1d716bddfb85e6c2992a0332607e6cf9f5f465b351f61a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-20T04:40:39Z","title_canon_sha256":"5f536eab07baaf5e06586ab2a636f9096d9067c57c0d155887bd0eb0bea254fe"},"schema_version":"1.0","source":{"id":"0907.3338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.3338","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"0907.3338v2","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3338","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"7HL3MCC4HKCX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7HL3MCC4HKCXJ32W","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7HL3MCC4","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:e0d29c5681243a49a84c40e3dcf6d4a60cf8fc9bff7880b50621d203491e7a3a","target":"graph","created_at":"2026-05-18T04:09:45Z","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 generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it where only a small number of matches between the vertices of the two graphs are possible. We propose a new message passing algorithm that allows us to compute, very efficiently, approximate solutions to the sparse network alignment problems with graph sizes as large as hundreds of thousands of vertices. We also provide extensive simulations comparing our algor","authors_text":"Amin Saberi, David F. Gleich, Mohsen Bayati, Ying Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-20T04:40:39Z","title":"Message Passing Algorithms for Sparse Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3338","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:77d85d9bca9fc96dccda3e90364f44a496105efab41bf3bc7c2a1a037bd54d1d","target":"record","created_at":"2026-05-18T04:09:45Z","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":"9bfae8349b8e5b66e1d716bddfb85e6c2992a0332607e6cf9f5f465b351f61a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-20T04:40:39Z","title_canon_sha256":"5f536eab07baaf5e06586ab2a636f9096d9067c57c0d155887bd0eb0bea254fe"},"schema_version":"1.0","source":{"id":"0907.3338","kind":"arxiv","version":2}},"canonical_sha256":"f9d7b6085c3a8574ef562a5b7ce7df198b901ca94eb16001dbd4dd9aeb3aa42e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9d7b6085c3a8574ef562a5b7ce7df198b901ca94eb16001dbd4dd9aeb3aa42e","first_computed_at":"2026-05-18T04:09:45.957173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:45.957173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3woCwc5g5ao9Z1iifyWYQLx2TT+AeoHD5rMpetJ/hclb7wnTBlAIkEZz39HgwwqGOGEzQaHhUQ6wqaEDbEzcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:45.957572Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.3338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77d85d9bca9fc96dccda3e90364f44a496105efab41bf3bc7c2a1a037bd54d1d","sha256:e0d29c5681243a49a84c40e3dcf6d4a60cf8fc9bff7880b50621d203491e7a3a"],"state_sha256":"1fe5685ee1f38bcab91160b5c6f750468794b41d3b66a19f74feddb99a1adb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5gDFzQqevdcWcK1Lybp2zHEpfSXMW0rSh+Zg1ZJ3PvCuWx0fwC/wA//kmCG37jBWGYBM4N2T0by/+J/KLpdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:35:48.244089Z","bundle_sha256":"11e31ff273edba8cb2aa10b2d79df5c74294cf2e8a2aedd4855871a7b5e3c0eb"}}