{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OQQCER26APAJNZK2THI3ERA3W6","short_pith_number":"pith:OQQCER26","canonical_record":{"source":{"id":"2311.08513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T20:08:58Z","cross_cats_sorted":[],"title_canon_sha256":"c6aaa5bbe8e1674690722a90d0d4d92588845941f0f9d7693adf07769ea1673a","abstract_canon_sha256":"99e5bf6a615422354aad87400b7dba2c8b3fc818c9044c1a4e634b40c9b946b1"},"schema_version":"1.0"},"canonical_sha256":"742022475e03c096e55a99d1b2441bb790dd14585824e5185afb407f6e485f8a","source":{"kind":"arxiv","id":"2311.08513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08513","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08513v1","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08513","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"OQQCER26APAJ","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"pith_short_16","alias_value":"OQQCER26APAJNZK2","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"pith_short_8","alias_value":"OQQCER26","created_at":"2026-07-05T07:12:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OQQCER26APAJNZK2THI3ERA3W6","target":"record","payload":{"canonical_record":{"source":{"id":"2311.08513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T20:08:58Z","cross_cats_sorted":[],"title_canon_sha256":"c6aaa5bbe8e1674690722a90d0d4d92588845941f0f9d7693adf07769ea1673a","abstract_canon_sha256":"99e5bf6a615422354aad87400b7dba2c8b3fc818c9044c1a4e634b40c9b946b1"},"schema_version":"1.0"},"canonical_sha256":"742022475e03c096e55a99d1b2441bb790dd14585824e5185afb407f6e485f8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:58.088832Z","signature_b64":"AU0yfHMEmFz4lUFN57ZtLg4RvheGJ23y/of6AOuNwicS6ZpWaSL2qmiT3xXhjoVuQpLfLh9M1MzMwVThhQAnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"742022475e03c096e55a99d1b2441bb790dd14585824e5185afb407f6e485f8a","last_reissued_at":"2026-07-05T07:12:58.088402Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:58.088402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.08513","source_version":1,"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-05T07:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mad9frm10lfAnA5vV7Evbk/cNODxaNwv2dIhOIX9ZJL9CTTrqimD4povZ4U63YS9oMQgHd4081As+fz8S+huBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:18:21.142840Z"},"content_sha256":"f08aba927fc49858b2894a214aaf448707831621a01889ec6db3001e23155938","schema_version":"1.0","event_id":"sha256:f08aba927fc49858b2894a214aaf448707831621a01889ec6db3001e23155938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OQQCER26APAJNZK2THI3ERA3W6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query Efficient Weighted Stochastic Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahsa Derakhshan, Mohammad Saneian","submitted_at":"2023-11-14T20:08:58Z","abstract_excerpt":"In this paper, we study the weighted stochastic matching problem. Let $G=(V, E)$ be a given edge-weighted graph and let its realization $\\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e\\in E$ independently with a known probability $p_e$. The goal in this problem is to pick a sparse subgraph $Q$ of $G$ without prior knowledge of $G$'s realization, such that the maximum weight matching among the realized edges of $Q$ (i.e. the subgraph $Q\\cap \\mathcal{G}$) in expectation approximates the maximum weight matching of the entire realization $\\mathcal{G}$.\n  Attaining any constant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08513","kind":"arxiv","version":1},"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/2311.08513/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-05T07:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RERKb0VQxYgEv817g84wjj5tmwksdaBMgb0VKUEtIx90QUZBIR3f3KZ/uf6qkg4+QZNREugCosW/cBTnWPcpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:18:21.143241Z"},"content_sha256":"98d2c9e70063c1037465df914fee732af2997616d28be2d1ca0912b40c80be64","schema_version":"1.0","event_id":"sha256:98d2c9e70063c1037465df914fee732af2997616d28be2d1ca0912b40c80be64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQQCER26APAJNZK2THI3ERA3W6/bundle.json","state_url":"https://pith.science/pith/OQQCER26APAJNZK2THI3ERA3W6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQQCER26APAJNZK2THI3ERA3W6/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-03T20:18:21Z","links":{"resolver":"https://pith.science/pith/OQQCER26APAJNZK2THI3ERA3W6","bundle":"https://pith.science/pith/OQQCER26APAJNZK2THI3ERA3W6/bundle.json","state":"https://pith.science/pith/OQQCER26APAJNZK2THI3ERA3W6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQQCER26APAJNZK2THI3ERA3W6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OQQCER26APAJNZK2THI3ERA3W6","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":"99e5bf6a615422354aad87400b7dba2c8b3fc818c9044c1a4e634b40c9b946b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T20:08:58Z","title_canon_sha256":"c6aaa5bbe8e1674690722a90d0d4d92588845941f0f9d7693adf07769ea1673a"},"schema_version":"1.0","source":{"id":"2311.08513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08513","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08513v1","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08513","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"OQQCER26APAJ","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"pith_short_16","alias_value":"OQQCER26APAJNZK2","created_at":"2026-07-05T07:12:58Z"},{"alias_kind":"pith_short_8","alias_value":"OQQCER26","created_at":"2026-07-05T07:12:58Z"}],"graph_snapshots":[{"event_id":"sha256:98d2c9e70063c1037465df914fee732af2997616d28be2d1ca0912b40c80be64","target":"graph","created_at":"2026-07-05T07:12:58Z","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/2311.08513/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the weighted stochastic matching problem. Let $G=(V, E)$ be a given edge-weighted graph and let its realization $\\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e\\in E$ independently with a known probability $p_e$. The goal in this problem is to pick a sparse subgraph $Q$ of $G$ without prior knowledge of $G$'s realization, such that the maximum weight matching among the realized edges of $Q$ (i.e. the subgraph $Q\\cap \\mathcal{G}$) in expectation approximates the maximum weight matching of the entire realization $\\mathcal{G}$.\n  Attaining any constant ","authors_text":"Mahsa Derakhshan, Mohammad Saneian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T20:08:58Z","title":"Query Efficient Weighted Stochastic Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08513","kind":"arxiv","version":1},"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:f08aba927fc49858b2894a214aaf448707831621a01889ec6db3001e23155938","target":"record","created_at":"2026-07-05T07:12:58Z","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":"99e5bf6a615422354aad87400b7dba2c8b3fc818c9044c1a4e634b40c9b946b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T20:08:58Z","title_canon_sha256":"c6aaa5bbe8e1674690722a90d0d4d92588845941f0f9d7693adf07769ea1673a"},"schema_version":"1.0","source":{"id":"2311.08513","kind":"arxiv","version":1}},"canonical_sha256":"742022475e03c096e55a99d1b2441bb790dd14585824e5185afb407f6e485f8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"742022475e03c096e55a99d1b2441bb790dd14585824e5185afb407f6e485f8a","first_computed_at":"2026-07-05T07:12:58.088402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:58.088402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AU0yfHMEmFz4lUFN57ZtLg4RvheGJ23y/of6AOuNwicS6ZpWaSL2qmiT3xXhjoVuQpLfLh9M1MzMwVThhQAnAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:58.088832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.08513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f08aba927fc49858b2894a214aaf448707831621a01889ec6db3001e23155938","sha256:98d2c9e70063c1037465df914fee732af2997616d28be2d1ca0912b40c80be64"],"state_sha256":"dd2bc4309b55fed7da5231bd72b0a73b4676eaec98e7e1bda4dfe13283bafceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6UqXPT/L04GNt+mx1/vd7X3FdrIM73lQUTu1z8x5h7+kqBVWSnGV3MNvu0Qe8n/6z/qFw04XMZhVYvPYLj5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:18:21.146261Z","bundle_sha256":"0cb042a0dfd590ab3a1ebd2a6165a5b35ad00c18afc54ddf41cfe4425450c282"}}