{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FQQFKAQWDSPZL55M2LCBPIJUOE","short_pith_number":"pith:FQQFKAQW","schema_version":"1.0","canonical_sha256":"2c205502161c9f95f7acd2c417a13471394a25f6aa9aca9edc4f4184419bb3cb","source":{"kind":"arxiv","id":"1710.10592","version":3},"attestation_state":"computed","paper":{"title":"Almost Optimal Stochastic Weighted Matching With Few Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nima Reyhani, Soheil Behnezhad","submitted_at":"2017-10-29T10:21:39Z","abstract_excerpt":"We consider the {\\em stochastic matching} problem. An edge-weighted general (i.e., not necessarily bipartite) graph $G(V, E)$ is given in the input, where each edge in $E$ is {\\em realized} independently with probability $p$; the realization is initially unknown, however, we are able to {\\em query} the edges to determine whether they are realized. The goal is to query only a small number of edges to find a {\\em realized matching} that is sufficiently close to the maximum matching among all realized edges. This problem has received a considerable attention during the past decade due to its nume"},"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":"1710.10592","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-29T10:21:39Z","cross_cats_sorted":[],"title_canon_sha256":"0d2852831fc62666b300bf27ca6b0ba6f5777bcae8411fe6f6fd6de342857be9","abstract_canon_sha256":"02babbe5a20b6338f767c987ba3caceba6810db54858d51cfbf3d7e0a2b0b29d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:10.045023Z","signature_b64":"JNYQ96OjgiKtpLypj1zk6kq8/B5qSj4UzW8DpEOnkGHGT2puUL/rfs4OMjrDuVcy9ZsBRuGi4YOeu0E5czL0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c205502161c9f95f7acd2c417a13471394a25f6aa9aca9edc4f4184419bb3cb","last_reissued_at":"2026-05-18T00:15:10.044509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:10.044509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Optimal Stochastic Weighted Matching With Few Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nima Reyhani, Soheil Behnezhad","submitted_at":"2017-10-29T10:21:39Z","abstract_excerpt":"We consider the {\\em stochastic matching} problem. An edge-weighted general (i.e., not necessarily bipartite) graph $G(V, E)$ is given in the input, where each edge in $E$ is {\\em realized} independently with probability $p$; the realization is initially unknown, however, we are able to {\\em query} the edges to determine whether they are realized. The goal is to query only a small number of edges to find a {\\em realized matching} that is sufficiently close to the maximum matching among all realized edges. This problem has received a considerable attention during the past decade due to its nume"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10592","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":""},"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":"1710.10592","created_at":"2026-05-18T00:15:10.044587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10592v3","created_at":"2026-05-18T00:15:10.044587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10592","created_at":"2026-05-18T00:15:10.044587+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQQFKAQWDSPZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQQFKAQWDSPZL55M","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQQFKAQW","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE","json":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE.json","graph_json":"https://pith.science/api/pith-number/FQQFKAQWDSPZL55M2LCBPIJUOE/graph.json","events_json":"https://pith.science/api/pith-number/FQQFKAQWDSPZL55M2LCBPIJUOE/events.json","paper":"https://pith.science/paper/FQQFKAQW"},"agent_actions":{"view_html":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE","download_json":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE.json","view_paper":"https://pith.science/paper/FQQFKAQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10592&json=true","fetch_graph":"https://pith.science/api/pith-number/FQQFKAQWDSPZL55M2LCBPIJUOE/graph.json","fetch_events":"https://pith.science/api/pith-number/FQQFKAQWDSPZL55M2LCBPIJUOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE/action/storage_attestation","attest_author":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE/action/author_attestation","sign_citation":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE/action/citation_signature","submit_replication":"https://pith.science/pith/FQQFKAQWDSPZL55M2LCBPIJUOE/action/replication_record"}},"created_at":"2026-05-18T00:15:10.044587+00:00","updated_at":"2026-05-18T00:15:10.044587+00:00"}