{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Y4TBY7Y3SRSHCS2LUSMBFNR7CI","short_pith_number":"pith:Y4TBY7Y3","canonical_record":{"source":{"id":"2405.12293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-20T18:01:11Z","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"title_canon_sha256":"7f94bd576fe9c25e95b5b06b99a6ea30713c70e4c3fdccc17956d060ab985dcf","abstract_canon_sha256":"07bcb159c78c644fa672734494a74d4647fcd955b129ea8a22bc776c8d45fdaf"},"schema_version":"1.0"},"canonical_sha256":"c7261c7f1b9464714b4ba49812b63f122c003b135d409ba1446e406903df8c4b","source":{"kind":"arxiv","id":"2405.12293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.12293","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"2405.12293v2","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12293","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"Y4TBY7Y3SRSH","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Y4TBY7Y3SRSHCS2L","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Y4TBY7Y3","created_at":"2026-07-05T11:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Y4TBY7Y3SRSHCS2LUSMBFNR7CI","target":"record","payload":{"canonical_record":{"source":{"id":"2405.12293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-20T18:01:11Z","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"title_canon_sha256":"7f94bd576fe9c25e95b5b06b99a6ea30713c70e4c3fdccc17956d060ab985dcf","abstract_canon_sha256":"07bcb159c78c644fa672734494a74d4647fcd955b129ea8a22bc776c8d45fdaf"},"schema_version":"1.0"},"canonical_sha256":"c7261c7f1b9464714b4ba49812b63f122c003b135d409ba1446e406903df8c4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:59.250113Z","signature_b64":"O2vvnAemQV0GO134nYZlxcIxZ9WUrKs0MR5eF8oH5hKfu9Z3WBNIQQX7M53iLJqEuyc/Czl89Pnr51z+zCrTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7261c7f1b9464714b4ba49812b63f122c003b135d409ba1446e406903df8c4b","last_reissued_at":"2026-07-05T11:28:59.249534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:59.249534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.12293","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-07-05T11:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rzomi9zeszPOgVC0EElDmMeRfcKCTm10uj6ef1n0FNCdf9rLkQyg2ZA0mkcpxl36eJwKdmKlkYm7z1OyjI56AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:58:25.577426Z"},"content_sha256":"e24140c9fb7799f0c4689aac553983ff08e3b2be3d0a7384fdcb90f77683d305","schema_version":"1.0","event_id":"sha256:e24140c9fb7799f0c4689aac553983ff08e3b2be3d0a7384fdcb90f77683d305"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Y4TBY7Y3SRSHCS2LUSMBFNR7CI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Bruce Hajek, Taha Ameen","submitted_at":"2024-05-20T18:01:11Z","abstract_excerpt":"This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs pairwise and then combine the partial matchings by transitivity. Our analysis yields a sufficient condition on the problem parameters to exactly match all nodes across all the graphs. In the setting of homogeneous (Erd\\H{o}s-R\\'enyi) graphs, we show that this condition is also necessary, i.e. the algorithm works down to the information theoretic threshold. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12293","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.12293/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:28:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PCXU4c/N/lF67mr+FaJNrU3mFMPmFOpnBC2gc++T3AIJtQL67C/2V31I5SZOsK9yX7weUTLeigtC0KLIg/WSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:58:25.577968Z"},"content_sha256":"ae9e4e6c7016baa84570413ba0774a386eb1145b399b0b921d7e4960d4924128","schema_version":"1.0","event_id":"sha256:ae9e4e6c7016baa84570413ba0774a386eb1145b399b0b921d7e4960d4924128"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI/bundle.json","state_url":"https://pith.science/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI/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-08-12T18:58:25Z","links":{"resolver":"https://pith.science/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI","bundle":"https://pith.science/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI/bundle.json","state":"https://pith.science/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4TBY7Y3SRSHCS2LUSMBFNR7CI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Y4TBY7Y3SRSHCS2LUSMBFNR7CI","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":"07bcb159c78c644fa672734494a74d4647fcd955b129ea8a22bc776c8d45fdaf","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-20T18:01:11Z","title_canon_sha256":"7f94bd576fe9c25e95b5b06b99a6ea30713c70e4c3fdccc17956d060ab985dcf"},"schema_version":"1.0","source":{"id":"2405.12293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.12293","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"arxiv_version","alias_value":"2405.12293v2","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12293","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"pith_short_12","alias_value":"Y4TBY7Y3SRSH","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Y4TBY7Y3SRSHCS2L","created_at":"2026-07-05T11:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Y4TBY7Y3","created_at":"2026-07-05T11:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ae9e4e6c7016baa84570413ba0774a386eb1145b399b0b921d7e4960d4924128","target":"graph","created_at":"2026-07-05T11:28:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.12293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs pairwise and then combine the partial matchings by transitivity. Our analysis yields a sufficient condition on the problem parameters to exactly match all nodes across all the graphs. In the setting of homogeneous (Erd\\H{o}s-R\\'enyi) graphs, we show that this condition is also necessary, i.e. the algorithm works down to the information theoretic threshold. ","authors_text":"Bruce Hajek, Taha Ameen","cross_cats":["cs.DM","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-20T18:01:11Z","title":"Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12293","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:e24140c9fb7799f0c4689aac553983ff08e3b2be3d0a7384fdcb90f77683d305","target":"record","created_at":"2026-07-05T11:28:59Z","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":"07bcb159c78c644fa672734494a74d4647fcd955b129ea8a22bc776c8d45fdaf","cross_cats_sorted":["cs.DM","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-20T18:01:11Z","title_canon_sha256":"7f94bd576fe9c25e95b5b06b99a6ea30713c70e4c3fdccc17956d060ab985dcf"},"schema_version":"1.0","source":{"id":"2405.12293","kind":"arxiv","version":2}},"canonical_sha256":"c7261c7f1b9464714b4ba49812b63f122c003b135d409ba1446e406903df8c4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7261c7f1b9464714b4ba49812b63f122c003b135d409ba1446e406903df8c4b","first_computed_at":"2026-07-05T11:28:59.249534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:28:59.249534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O2vvnAemQV0GO134nYZlxcIxZ9WUrKs0MR5eF8oH5hKfu9Z3WBNIQQX7M53iLJqEuyc/Czl89Pnr51z+zCrTCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:28:59.250113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.12293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e24140c9fb7799f0c4689aac553983ff08e3b2be3d0a7384fdcb90f77683d305","sha256:ae9e4e6c7016baa84570413ba0774a386eb1145b399b0b921d7e4960d4924128"],"state_sha256":"68ff0c6bd8ee5cfb45a31f4afe5dd74ba8605de1f490cc3d946b74cdd635aa08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvVL2hQAtw5L5EgECRT5cRhHCbly7nraBzzTt9WAbOIGrR4VXg8mQxsK4rY1pk9viJtuEiDHoFcyGD3MnbUcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T18:58:25.586943Z","bundle_sha256":"aed0556034ccdc444eeb418ee634699b15e4c7a2fe6f401ab31962ead54e16d7"}}