{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Y3ZPTTXSNGYFPW5HQPL3EDMFRK","short_pith_number":"pith:Y3ZPTTXS","schema_version":"1.0","canonical_sha256":"c6f2f9cef269b057dba783d7b20d858ab93c650b9bba3a6c4c278096dbf7121b","source":{"kind":"arxiv","id":"1007.3036","version":2},"attestation_state":"computed","paper":{"title":"Greedy algorithm for stochastic matching is a 2-approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Adamczyk","submitted_at":"2010-07-18T20:23:19Z","abstract_excerpt":"Motivated by applications in online dating and kidney exchange, the stochastic matching problem was introduced by Chen, Immorlica, Karlin, Mahdian and Rudra (2009). They have proven a 4-approximation of a simple greedy strategy, but conjectured that it is in fact a 2-approximation. In this paper we confirm this hypothesis."},"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":"1007.3036","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-18T20:23:19Z","cross_cats_sorted":[],"title_canon_sha256":"488d140fce370bad19046cebb78dac46911015a24b35e83ea1fbccc8578dd77c","abstract_canon_sha256":"140e3cd81d4b1a4f2d17b3414718777b576eb5daeac73c36c688496a5bee801f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:04.595729Z","signature_b64":"ZJt59H/NS3F0mZq4YectS92JrwQWz2nd+R4P+HhhhoYUWehtzR51oZtXq8MRfgVZgaV1i5HnCDwIINPj0DSJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6f2f9cef269b057dba783d7b20d858ab93c650b9bba3a6c4c278096dbf7121b","last_reissued_at":"2026-05-18T03:08:04.595106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:04.595106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy algorithm for stochastic matching is a 2-approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Adamczyk","submitted_at":"2010-07-18T20:23:19Z","abstract_excerpt":"Motivated by applications in online dating and kidney exchange, the stochastic matching problem was introduced by Chen, Immorlica, Karlin, Mahdian and Rudra (2009). They have proven a 4-approximation of a simple greedy strategy, but conjectured that it is in fact a 2-approximation. In this paper we confirm this hypothesis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3036","kind":"arxiv","version":2},"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":"1007.3036","created_at":"2026-05-18T03:08:04.595207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.3036v2","created_at":"2026-05-18T03:08:04.595207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3036","created_at":"2026-05-18T03:08:04.595207+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3ZPTTXSNGYF","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3ZPTTXSNGYFPW5H","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3ZPTTXS","created_at":"2026-05-18T12:26:17.028572+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/Y3ZPTTXSNGYFPW5HQPL3EDMFRK","json":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK.json","graph_json":"https://pith.science/api/pith-number/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/graph.json","events_json":"https://pith.science/api/pith-number/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/events.json","paper":"https://pith.science/paper/Y3ZPTTXS"},"agent_actions":{"view_html":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK","download_json":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK.json","view_paper":"https://pith.science/paper/Y3ZPTTXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.3036&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/action/storage_attestation","attest_author":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/action/author_attestation","sign_citation":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/action/citation_signature","submit_replication":"https://pith.science/pith/Y3ZPTTXSNGYFPW5HQPL3EDMFRK/action/replication_record"}},"created_at":"2026-05-18T03:08:04.595207+00:00","updated_at":"2026-05-18T03:08:04.595207+00:00"}