{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WE5FILWK3ZZZPNYWABCNDIWJD3","short_pith_number":"pith:WE5FILWK","canonical_record":{"source":{"id":"2407.02624","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T19:28:31Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"ef595b92413fb43ed247a6c070882cd2ee65264574e7c4d07846bd3cab773a54","abstract_canon_sha256":"5db63c84758206d919990233e68cd127b11867a58a8390868538f7182d2555d9"},"schema_version":"1.0"},"canonical_sha256":"b13a542ecade7397b7160044d1a2c91ee174a999514405c2d60a6fe1b335a0f5","source":{"kind":"arxiv","id":"2407.02624","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02624","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02624v3","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02624","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"WE5FILWK3ZZZ","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"pith_short_16","alias_value":"WE5FILWK3ZZZPNYW","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"pith_short_8","alias_value":"WE5FILWK","created_at":"2026-07-05T11:35:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WE5FILWK3ZZZPNYWABCNDIWJD3","target":"record","payload":{"canonical_record":{"source":{"id":"2407.02624","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T19:28:31Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"ef595b92413fb43ed247a6c070882cd2ee65264574e7c4d07846bd3cab773a54","abstract_canon_sha256":"5db63c84758206d919990233e68cd127b11867a58a8390868538f7182d2555d9"},"schema_version":"1.0"},"canonical_sha256":"b13a542ecade7397b7160044d1a2c91ee174a999514405c2d60a6fe1b335a0f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:10.245078Z","signature_b64":"ABdxquAWO+Xg22buoKaq3D1q2htHaDsWbsdJ2uzy05SfVvJW2hg4+TW+UXKkbVHpIeIsYpHJBIhwGcspN0ssDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b13a542ecade7397b7160044d1a2c91ee174a999514405c2d60a6fe1b335a0f5","last_reissued_at":"2026-07-05T11:35:10.244606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:10.244606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.02624","source_version":3,"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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/bHx9hdBrxD9dgvQa6aP5fuZ5NnKV36PX5Vp7SJ4BaBe+bDwD/GBz8w9/CVMcDAS/63/S5eG/fRaH6ry8qsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:24:29.917725Z"},"content_sha256":"d8a6ce6f43e774858f98ecc8371312c222b68287db23c85ba9aabd7c981d0c95","schema_version":"1.0","event_id":"sha256:d8a6ce6f43e774858f98ecc8371312c222b68287db23c85ba9aabd7c981d0c95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WE5FILWK3ZZZPNYWABCNDIWJD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Probabilistic Propagation in Graphs by Adding Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Aditya Bhaskara, Alex Crane, Blair D. Sullivan, Md Mumtahin Habib Ullah Mazumder, Prasanth Yalamanchili, Shweta Jain","submitted_at":"2024-07-02T19:28:31Z","abstract_excerpt":"Probabilistic graphs are an abstraction that allow us to study randomized propagation in graphs. In a probabilistic graph, each edge is \"active\" with a certain probability, independent of the other edges. For two vertices $u,v$, a classic quantity of interest, that we refer to as the proximity $\\mathcal{P}_{G}(u, v)$, is the probability that there exists a path between $u$ and $v$ all of whose edges are active. For a given subset of vertices $V_s$, the reach of $V_s$ is defined as the minimum over pairs $u \\in V_s$ and $v \\in V$ of the proximity $\\mathcal{P}_{G}(u,v)$. This quantity has been s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02624","kind":"arxiv","version":3},"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/2407.02624/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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96pbZK91mRDkphxgFhDqGA66ApmdnyHYdSmhm52BDUhMt5nuVGVhvjDZjUtEs61K2FEOAxl5Ytf0/bE2/bK2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:24:29.918261Z"},"content_sha256":"b87ea7097c3ea54b8cc727023d2420cc939f197db98fad2b8f847b2dbb852c75","schema_version":"1.0","event_id":"sha256:b87ea7097c3ea54b8cc727023d2420cc939f197db98fad2b8f847b2dbb852c75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/bundle.json","state_url":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/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-08T06:24:29Z","links":{"resolver":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3","bundle":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/bundle.json","state":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WE5FILWK3ZZZPNYWABCNDIWJD3","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":"5db63c84758206d919990233e68cd127b11867a58a8390868538f7182d2555d9","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T19:28:31Z","title_canon_sha256":"ef595b92413fb43ed247a6c070882cd2ee65264574e7c4d07846bd3cab773a54"},"schema_version":"1.0","source":{"id":"2407.02624","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02624","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02624v3","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02624","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"WE5FILWK3ZZZ","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"pith_short_16","alias_value":"WE5FILWK3ZZZPNYW","created_at":"2026-07-05T11:35:10Z"},{"alias_kind":"pith_short_8","alias_value":"WE5FILWK","created_at":"2026-07-05T11:35:10Z"}],"graph_snapshots":[{"event_id":"sha256:b87ea7097c3ea54b8cc727023d2420cc939f197db98fad2b8f847b2dbb852c75","target":"graph","created_at":"2026-07-05T11:35:10Z","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/2407.02624/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic graphs are an abstraction that allow us to study randomized propagation in graphs. In a probabilistic graph, each edge is \"active\" with a certain probability, independent of the other edges. For two vertices $u,v$, a classic quantity of interest, that we refer to as the proximity $\\mathcal{P}_{G}(u, v)$, is the probability that there exists a path between $u$ and $v$ all of whose edges are active. For a given subset of vertices $V_s$, the reach of $V_s$ is defined as the minimum over pairs $u \\in V_s$ and $v \\in V$ of the proximity $\\mathcal{P}_{G}(u,v)$. This quantity has been s","authors_text":"Aditya Bhaskara, Alex Crane, Blair D. Sullivan, Md Mumtahin Habib Ullah Mazumder, Prasanth Yalamanchili, Shweta Jain","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T19:28:31Z","title":"Optimizing Probabilistic Propagation in Graphs by Adding Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02624","kind":"arxiv","version":3},"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:d8a6ce6f43e774858f98ecc8371312c222b68287db23c85ba9aabd7c981d0c95","target":"record","created_at":"2026-07-05T11:35:10Z","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":"5db63c84758206d919990233e68cd127b11867a58a8390868538f7182d2555d9","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-02T19:28:31Z","title_canon_sha256":"ef595b92413fb43ed247a6c070882cd2ee65264574e7c4d07846bd3cab773a54"},"schema_version":"1.0","source":{"id":"2407.02624","kind":"arxiv","version":3}},"canonical_sha256":"b13a542ecade7397b7160044d1a2c91ee174a999514405c2d60a6fe1b335a0f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b13a542ecade7397b7160044d1a2c91ee174a999514405c2d60a6fe1b335a0f5","first_computed_at":"2026-07-05T11:35:10.244606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:10.244606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ABdxquAWO+Xg22buoKaq3D1q2htHaDsWbsdJ2uzy05SfVvJW2hg4+TW+UXKkbVHpIeIsYpHJBIhwGcspN0ssDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:10.245078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.02624","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8a6ce6f43e774858f98ecc8371312c222b68287db23c85ba9aabd7c981d0c95","sha256:b87ea7097c3ea54b8cc727023d2420cc939f197db98fad2b8f847b2dbb852c75"],"state_sha256":"61672a50e737e805ba9f4f1ff3ce0eb7d00037007326fcca0fc6289a78480ce7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/oKfiLSI5LOS0tfEozg39uBRMrLYRWXNtUxT0eoFxv1UHs0HTp80hLWiPs65zIeNMLAOG15m8KUBc0ebW3eDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T06:24:29.923840Z","bundle_sha256":"dec0cde5bcf418fd531eff36da9d9bdafbb2a410ae154d275061aa5d074ff4b4"}}