{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XCMIN5YUSFXD7MU6KFGU3Z7MAI","short_pith_number":"pith:XCMIN5YU","schema_version":"1.0","canonical_sha256":"b89886f714916e3fb29e514d4de7ec0232b6a4aa9bff55b00fa60fa90d8ba978","source":{"kind":"arxiv","id":"1505.01439","version":1},"attestation_state":"computed","paper":{"title":"Improved Approximation Algorithms for Stochastic Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Joydeep Mukherjee, Marek Adamczyk","submitted_at":"2015-05-06T17:29:44Z","abstract_excerpt":"In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive profit, and each node is assigned a positive integer called timeout. We know whether an edge exists or not only after probing it. On this random graph we are executing a process, which one-by-one probes the edges and gradually constructs a matching. The process is constrained in two ways: once an edge is taken it cannot be removed from the matching, and the t"},"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":"1505.01439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-06T17:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"cc0b69e11c6224efbd90957c8293729d8322e3f89c59807f685575dd4741aea8","abstract_canon_sha256":"d116f3e608b77ceec5de9afe516804031d0d667963407e0953a54ad657ae8337"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:49.366418Z","signature_b64":"W5WsfxFP8x8xccqc5w57DlK7gWiQ1WWhrUldSzMmfXi7HLDBXnFbyTJ0SSYgkNSj2t0ySMlKiQ9+CpSgF+EwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89886f714916e3fb29e514d4de7ec0232b6a4aa9bff55b00fa60fa90d8ba978","last_reissued_at":"2026-05-18T02:16:49.365759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:49.365759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Stochastic Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Joydeep Mukherjee, Marek Adamczyk","submitted_at":"2015-05-06T17:29:44Z","abstract_excerpt":"In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive profit, and each node is assigned a positive integer called timeout. We know whether an edge exists or not only after probing it. On this random graph we are executing a process, which one-by-one probes the edges and gradually constructs a matching. The process is constrained in two ways: once an edge is taken it cannot be removed from the matching, and the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01439","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":"1505.01439","created_at":"2026-05-18T02:16:49.365869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01439v1","created_at":"2026-05-18T02:16:49.365869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01439","created_at":"2026-05-18T02:16:49.365869+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCMIN5YUSFXD","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCMIN5YUSFXD7MU6","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCMIN5YU","created_at":"2026-05-18T12:29:50.041715+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/XCMIN5YUSFXD7MU6KFGU3Z7MAI","json":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI.json","graph_json":"https://pith.science/api/pith-number/XCMIN5YUSFXD7MU6KFGU3Z7MAI/graph.json","events_json":"https://pith.science/api/pith-number/XCMIN5YUSFXD7MU6KFGU3Z7MAI/events.json","paper":"https://pith.science/paper/XCMIN5YU"},"agent_actions":{"view_html":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI","download_json":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI.json","view_paper":"https://pith.science/paper/XCMIN5YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01439&json=true","fetch_graph":"https://pith.science/api/pith-number/XCMIN5YUSFXD7MU6KFGU3Z7MAI/graph.json","fetch_events":"https://pith.science/api/pith-number/XCMIN5YUSFXD7MU6KFGU3Z7MAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI/action/storage_attestation","attest_author":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI/action/author_attestation","sign_citation":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI/action/citation_signature","submit_replication":"https://pith.science/pith/XCMIN5YUSFXD7MU6KFGU3Z7MAI/action/replication_record"}},"created_at":"2026-05-18T02:16:49.365869+00:00","updated_at":"2026-05-18T02:16:49.365869+00:00"}