{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RKDVAKNTQHOG3TJHAO2OIFO7BM","short_pith_number":"pith:RKDVAKNT","canonical_record":{"source":{"id":"2405.04261","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T12:21:42Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"6717fef8151a88b418fbb4824ceebb0aa1d2511d23ea4a6e5ad7473e8aa71c18","abstract_canon_sha256":"29a381348b57eb6169219e7619739a9f8b149b05016a260bfd8450dc4df28f44"},"schema_version":"1.0"},"canonical_sha256":"8a875029b381dc6dcd2703b4e415df0b26d2d88ddd86fd0e462d685835a18459","source":{"kind":"arxiv","id":"2405.04261","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04261","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04261v2","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04261","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"RKDVAKNTQHOG","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"pith_short_16","alias_value":"RKDVAKNTQHOG3TJH","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"pith_short_8","alias_value":"RKDVAKNT","created_at":"2026-07-05T11:46:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RKDVAKNTQHOG3TJHAO2OIFO7BM","target":"record","payload":{"canonical_record":{"source":{"id":"2405.04261","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T12:21:42Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"6717fef8151a88b418fbb4824ceebb0aa1d2511d23ea4a6e5ad7473e8aa71c18","abstract_canon_sha256":"29a381348b57eb6169219e7619739a9f8b149b05016a260bfd8450dc4df28f44"},"schema_version":"1.0"},"canonical_sha256":"8a875029b381dc6dcd2703b4e415df0b26d2d88ddd86fd0e462d685835a18459","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:19.395099Z","signature_b64":"iRNbC9RJvQb/uf+YLw85FWImE6bOxlg5DnEbG/6PW8uKJ/lDyFbLOOPe+29xUCj2nB4HTtxAsdmmU23HkwfzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a875029b381dc6dcd2703b4e415df0b26d2d88ddd86fd0e462d685835a18459","last_reissued_at":"2026-07-05T11:46:19.394535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:19.394535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.04261","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:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSUmCRsJ/DeM4c9Rn0DIcYPwHpB0MVOvHgQhyLnrf2LQwB6pTLc+By4ZyIU0o8TdUzYLwsY5kkntcPhDLwIGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:10:52.135837Z"},"content_sha256":"4f4145c3bc3065b42ac95e4238e02b505cddb2cea27029737688910978d15a90","schema_version":"1.0","event_id":"sha256:4f4145c3bc3065b42ac95e4238e02b505cddb2cea27029737688910978d15a90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RKDVAKNTQHOG3TJHAO2OIFO7BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Reconstruction from Noisy Random Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew McGregor, Rik Sengupta","submitted_at":"2024-05-07T12:21:42Z","abstract_excerpt":"We consider the problem of reconstructing an undirected graph $G$ on $n$ vertices given multiple random noisy subgraphs or \"traces\". Specifically, a trace is generated by sampling each vertex with probability $p_v$, then taking the resulting induced subgraph on the sampled vertices, and then adding noise in the form of either (a) deleting each edge in the subgraph with probability $1-p_e$, or (b) deleting each edge with probability $f_e$ and transforming a non-edge into an edge with probability $f_e$. We show that, under mild assumptions on $p_v$, $p_e$ and $f_e$, if $G$ is selected uniformly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04261","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.04261/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:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpPLwHRwruehXvNHCXvlasTozLdkF3b43ENZm3pt7DkzvZKi921LxtFH042Sb/FnRlSDATDfs21UEW7qsOFwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:10:52.136619Z"},"content_sha256":"c52d3457f71fa6bd1a3c12f5930b462683134f2bfce7f149cd38b3ac77580ee9","schema_version":"1.0","event_id":"sha256:c52d3457f71fa6bd1a3c12f5930b462683134f2bfce7f149cd38b3ac77580ee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM/bundle.json","state_url":"https://pith.science/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM/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-13T08:10:52Z","links":{"resolver":"https://pith.science/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM","bundle":"https://pith.science/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM/bundle.json","state":"https://pith.science/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKDVAKNTQHOG3TJHAO2OIFO7BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RKDVAKNTQHOG3TJHAO2OIFO7BM","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":"29a381348b57eb6169219e7619739a9f8b149b05016a260bfd8450dc4df28f44","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T12:21:42Z","title_canon_sha256":"6717fef8151a88b418fbb4824ceebb0aa1d2511d23ea4a6e5ad7473e8aa71c18"},"schema_version":"1.0","source":{"id":"2405.04261","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04261","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04261v2","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04261","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"RKDVAKNTQHOG","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"pith_short_16","alias_value":"RKDVAKNTQHOG3TJH","created_at":"2026-07-05T11:46:19Z"},{"alias_kind":"pith_short_8","alias_value":"RKDVAKNT","created_at":"2026-07-05T11:46:19Z"}],"graph_snapshots":[{"event_id":"sha256:c52d3457f71fa6bd1a3c12f5930b462683134f2bfce7f149cd38b3ac77580ee9","target":"graph","created_at":"2026-07-05T11:46:19Z","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.04261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of reconstructing an undirected graph $G$ on $n$ vertices given multiple random noisy subgraphs or \"traces\". Specifically, a trace is generated by sampling each vertex with probability $p_v$, then taking the resulting induced subgraph on the sampled vertices, and then adding noise in the form of either (a) deleting each edge in the subgraph with probability $1-p_e$, or (b) deleting each edge with probability $f_e$ and transforming a non-edge into an edge with probability $f_e$. We show that, under mild assumptions on $p_v$, $p_e$ and $f_e$, if $G$ is selected uniformly ","authors_text":"Andrew McGregor, Rik Sengupta","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T12:21:42Z","title":"Graph Reconstruction from Noisy Random Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04261","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:4f4145c3bc3065b42ac95e4238e02b505cddb2cea27029737688910978d15a90","target":"record","created_at":"2026-07-05T11:46:19Z","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":"29a381348b57eb6169219e7619739a9f8b149b05016a260bfd8450dc4df28f44","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-07T12:21:42Z","title_canon_sha256":"6717fef8151a88b418fbb4824ceebb0aa1d2511d23ea4a6e5ad7473e8aa71c18"},"schema_version":"1.0","source":{"id":"2405.04261","kind":"arxiv","version":2}},"canonical_sha256":"8a875029b381dc6dcd2703b4e415df0b26d2d88ddd86fd0e462d685835a18459","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a875029b381dc6dcd2703b4e415df0b26d2d88ddd86fd0e462d685835a18459","first_computed_at":"2026-07-05T11:46:19.394535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:46:19.394535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iRNbC9RJvQb/uf+YLw85FWImE6bOxlg5DnEbG/6PW8uKJ/lDyFbLOOPe+29xUCj2nB4HTtxAsdmmU23HkwfzBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:46:19.395099Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.04261","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f4145c3bc3065b42ac95e4238e02b505cddb2cea27029737688910978d15a90","sha256:c52d3457f71fa6bd1a3c12f5930b462683134f2bfce7f149cd38b3ac77580ee9"],"state_sha256":"3c2a390be04fa613ebdef0f9f9ae1e9f931ddaa08c6a0a4320188eeadfd15cd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNXMaAo3WGyVpnlS5UPIqouKM2MwEsG0rzeNc8bea4D+7GSzbU68at5LdTqSglvHTWX5tUpeI78lE9Jx6jkgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:10:52.144304Z","bundle_sha256":"209ed12df15b6b3e452fe9e9ab8c358d2fe7ab6fdca74edbc95afd0c50f236ae"}}