{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WE5FILWK3ZZZPNYWABCNDIWJD3","short_pith_number":"pith:WE5FILWK","schema_version":"1.0","canonical_sha256":"b13a542ecade7397b7160044d1a2c91ee174a999514405c2d60a6fe1b335a0f5","source":{"kind":"arxiv","id":"2407.02624","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.02624","created_at":"2026-07-05T11:35:10.244657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.02624v3","created_at":"2026-07-05T11:35:10.244657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02624","created_at":"2026-07-05T11:35:10.244657+00:00"},{"alias_kind":"pith_short_12","alias_value":"WE5FILWK3ZZZ","created_at":"2026-07-05T11:35:10.244657+00:00"},{"alias_kind":"pith_short_16","alias_value":"WE5FILWK3ZZZPNYW","created_at":"2026-07-05T11:35:10.244657+00:00"},{"alias_kind":"pith_short_8","alias_value":"WE5FILWK","created_at":"2026-07-05T11:35:10.244657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04435","citing_title":"Edge interventions can mitigate demographic and prestige disparities in the Computer Science coauthorship network","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3","json":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3.json","graph_json":"https://pith.science/api/pith-number/WE5FILWK3ZZZPNYWABCNDIWJD3/graph.json","events_json":"https://pith.science/api/pith-number/WE5FILWK3ZZZPNYWABCNDIWJD3/events.json","paper":"https://pith.science/paper/WE5FILWK"},"agent_actions":{"view_html":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3","download_json":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3.json","view_paper":"https://pith.science/paper/WE5FILWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.02624&json=true","fetch_graph":"https://pith.science/api/pith-number/WE5FILWK3ZZZPNYWABCNDIWJD3/graph.json","fetch_events":"https://pith.science/api/pith-number/WE5FILWK3ZZZPNYWABCNDIWJD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/action/storage_attestation","attest_author":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/action/author_attestation","sign_citation":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/action/citation_signature","submit_replication":"https://pith.science/pith/WE5FILWK3ZZZPNYWABCNDIWJD3/action/replication_record"}},"created_at":"2026-07-05T11:35:10.244657+00:00","updated_at":"2026-07-05T11:35:10.244657+00:00"}