{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D3TRPHVIPEBV3BMXV3HIHMWOH7","short_pith_number":"pith:D3TRPHVI","schema_version":"1.0","canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","source":{"kind":"arxiv","id":"1705.02280","version":1},"attestation_state":"computed","paper":{"title":"The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Khanna, Sepehr Assadi, Yang Li","submitted_at":"2017-05-05T16:00:25Z","abstract_excerpt":"In the stochastic matching problem, we are given a general (not necessarily bipartite) graph $G(V,E)$, where each edge in $E$ is realized with some constant probability $p > 0$ and the goal is to compute a bounded-degree (bounded by a function depending only on $p$) subgraph $H$ of $G$ such that the expected maximum matching size in $H$ is close to the expected maximum matching size in $G$. The algorithms in this setting are considered non-adaptive as they have to choose the subgraph $H$ without knowing any information about the set of realized edges in $G$. Originally motivated by an applicat"},"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":"1705.02280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T16:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"ce7a431e36b34df2e97f56f61fc80a8a16993ec6e08a266494b6525ef8d51338","abstract_canon_sha256":"0a30d9ab2312ff020f01d9ac08c830a81d1325e9cab3ba31745cea6ec2e3697d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:00.280456Z","signature_b64":"hOAHjJy2BKw2JfPrJmbxAiSwUN4sXWW2JR+ZvLR25NYrXXrJc85X+XNWFtXeEN8prKi54+TrIXmFOygxo0k0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","last_reissued_at":"2026-05-18T00:45:00.280059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:00.280059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Khanna, Sepehr Assadi, Yang Li","submitted_at":"2017-05-05T16:00:25Z","abstract_excerpt":"In the stochastic matching problem, we are given a general (not necessarily bipartite) graph $G(V,E)$, where each edge in $E$ is realized with some constant probability $p > 0$ and the goal is to compute a bounded-degree (bounded by a function depending only on $p$) subgraph $H$ of $G$ such that the expected maximum matching size in $H$ is close to the expected maximum matching size in $G$. The algorithms in this setting are considered non-adaptive as they have to choose the subgraph $H$ without knowing any information about the set of realized edges in $G$. Originally motivated by an applicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02280","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":""},"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":"1705.02280","created_at":"2026-05-18T00:45:00.280116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02280v1","created_at":"2026-05-18T00:45:00.280116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02280","created_at":"2026-05-18T00:45:00.280116+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3TRPHVIPEBV","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3TRPHVIPEBV3BMX","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3TRPHVI","created_at":"2026-05-18T12:31:10.602751+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/D3TRPHVIPEBV3BMXV3HIHMWOH7","json":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7.json","graph_json":"https://pith.science/api/pith-number/D3TRPHVIPEBV3BMXV3HIHMWOH7/graph.json","events_json":"https://pith.science/api/pith-number/D3TRPHVIPEBV3BMXV3HIHMWOH7/events.json","paper":"https://pith.science/paper/D3TRPHVI"},"agent_actions":{"view_html":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7","download_json":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7.json","view_paper":"https://pith.science/paper/D3TRPHVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02280&json=true","fetch_graph":"https://pith.science/api/pith-number/D3TRPHVIPEBV3BMXV3HIHMWOH7/graph.json","fetch_events":"https://pith.science/api/pith-number/D3TRPHVIPEBV3BMXV3HIHMWOH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/action/storage_attestation","attest_author":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/action/author_attestation","sign_citation":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/action/citation_signature","submit_replication":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/action/replication_record"}},"created_at":"2026-05-18T00:45:00.280116+00:00","updated_at":"2026-05-18T00:45:00.280116+00:00"}