{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IHDJCZMLHSIVGMEG5JBPTEDF4U","short_pith_number":"pith:IHDJCZML","canonical_record":{"source":{"id":"1310.1297","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-04T14:40:30Z","cross_cats_sorted":["math.OC","stat.CO"],"title_canon_sha256":"7234d31671a588c2fa7b542dde01d4fbe4423c9b3533ab28394d3d648c6e1743","abstract_canon_sha256":"d5a260f22032b451eb12f465383a57623140924acf8358023900903af0f4cc24"},"schema_version":"1.0"},"canonical_sha256":"41c691658b3c91533086ea42f99065e51b749686405e72654928eea1aa4e57b2","source":{"kind":"arxiv","id":"1310.1297","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1297","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1297v5","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1297","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"IHDJCZMLHSIV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IHDJCZMLHSIVGMEG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IHDJCZML","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IHDJCZMLHSIVGMEG5JBPTEDF4U","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1297","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-04T14:40:30Z","cross_cats_sorted":["math.OC","stat.CO"],"title_canon_sha256":"7234d31671a588c2fa7b542dde01d4fbe4423c9b3533ab28394d3d648c6e1743","abstract_canon_sha256":"d5a260f22032b451eb12f465383a57623140924acf8358023900903af0f4cc24"},"schema_version":"1.0"},"canonical_sha256":"41c691658b3c91533086ea42f99065e51b749686405e72654928eea1aa4e57b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:28.854037Z","signature_b64":"7PiAGNC2SsbTieKDRfQvjT1+g3KmD/28SGoklIiGGjmuN/inU9U/mYC4en77oEYMJLW68WgszoN1sBizPW2eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41c691658b3c91533086ea42f99065e51b749686405e72654928eea1aa4e57b2","last_reissued_at":"2026-05-18T02:24:28.853354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:28.853354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1297","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-18T02:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDr0CItVR32tXKwVL61mjwcNiRGoJFto+n8bv+wcS8SnDR4OfJPsUjP6YAaBAMzVrXnFT8ZuQ7esGLA5Y1s1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:18.917169Z"},"content_sha256":"33a92e5475e8361909ccc59542507cc9de26425ef463a509493d04f15021e83a","schema_version":"1.0","event_id":"sha256:33a92e5475e8361909ccc59542507cc9de26425ef463a509493d04f15021e83a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IHDJCZMLHSIVGMEG5JBPTEDF4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Clustering for Divide-and-Conquer Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Joshua T. Vogelstein, Li Chen, Vince Lyzinski, Youngser Park","submitted_at":"2013-10-04T14:40:30Z","abstract_excerpt":"We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures. We justify our approach by proving that modestly correlated, large stochastic block model random graphs are correctly matched utilizing very few seeds through our divide-and-conquer procedure. We also demonstrate the effectiveness of our approach in matching very large graphs in simulated and real data examples, showing up to a factor of 8 improvement in runt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1297","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-18T02:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CD77xvnDbNNXCPxCL4iCwK00MhKgXyz7d97JRP8sSHFn9HL5jikVYLrWEWJleuXNjDyZyMWCeOTNaPK/IV5hAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:18.917543Z"},"content_sha256":"b384ce0bc1c5e64142c5b5d6f7999be6ed1ef1b2782588ac64177f2654d2e86c","schema_version":"1.0","event_id":"sha256:b384ce0bc1c5e64142c5b5d6f7999be6ed1ef1b2782588ac64177f2654d2e86c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U/bundle.json","state_url":"https://pith.science/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U/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-30T07:17:18Z","links":{"resolver":"https://pith.science/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U","bundle":"https://pith.science/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U/bundle.json","state":"https://pith.science/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHDJCZMLHSIVGMEG5JBPTEDF4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IHDJCZMLHSIVGMEG5JBPTEDF4U","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":"d5a260f22032b451eb12f465383a57623140924acf8358023900903af0f4cc24","cross_cats_sorted":["math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-04T14:40:30Z","title_canon_sha256":"7234d31671a588c2fa7b542dde01d4fbe4423c9b3533ab28394d3d648c6e1743"},"schema_version":"1.0","source":{"id":"1310.1297","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1297","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1297v5","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1297","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"IHDJCZMLHSIV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IHDJCZMLHSIVGMEG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IHDJCZML","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:b384ce0bc1c5e64142c5b5d6f7999be6ed1ef1b2782588ac64177f2654d2e86c","target":"graph","created_at":"2026-05-18T02:24:28Z","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":"We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures. We justify our approach by proving that modestly correlated, large stochastic block model random graphs are correctly matched utilizing very few seeds through our divide-and-conquer procedure. We also demonstrate the effectiveness of our approach in matching very large graphs in simulated and real data examples, showing up to a factor of 8 improvement in runt","authors_text":"Carey E. Priebe, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Joshua T. Vogelstein, Li Chen, Vince Lyzinski, Youngser Park","cross_cats":["math.OC","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-04T14:40:30Z","title":"Spectral Clustering for Divide-and-Conquer Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1297","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:33a92e5475e8361909ccc59542507cc9de26425ef463a509493d04f15021e83a","target":"record","created_at":"2026-05-18T02:24:28Z","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":"d5a260f22032b451eb12f465383a57623140924acf8358023900903af0f4cc24","cross_cats_sorted":["math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-04T14:40:30Z","title_canon_sha256":"7234d31671a588c2fa7b542dde01d4fbe4423c9b3533ab28394d3d648c6e1743"},"schema_version":"1.0","source":{"id":"1310.1297","kind":"arxiv","version":5}},"canonical_sha256":"41c691658b3c91533086ea42f99065e51b749686405e72654928eea1aa4e57b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41c691658b3c91533086ea42f99065e51b749686405e72654928eea1aa4e57b2","first_computed_at":"2026-05-18T02:24:28.853354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:28.853354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7PiAGNC2SsbTieKDRfQvjT1+g3KmD/28SGoklIiGGjmuN/inU9U/mYC4en77oEYMJLW68WgszoN1sBizPW2eAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:28.854037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1297","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33a92e5475e8361909ccc59542507cc9de26425ef463a509493d04f15021e83a","sha256:b384ce0bc1c5e64142c5b5d6f7999be6ed1ef1b2782588ac64177f2654d2e86c"],"state_sha256":"c02f8330b8e8f3321f3fb5bc36f6c1cc064c6ec098029621642b34f7b9bbaed7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiVICyitDIeQMCO6RMElvY6EbdFC1kjKmn2U+RvUAPN5UBnOi1ML5wYaay4dN7SXGwQrLAi7QBaFw6LtE2aIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:17:18.919554Z","bundle_sha256":"79e33ec503e57263ace520ccb015276910800eca81aab27be96686dbf5c77cb6"}}