{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SREMHJK7GJYUTIOQ7SUYKXEUOU","short_pith_number":"pith:SREMHJK7","schema_version":"1.0","canonical_sha256":"9448c3a55f327149a1d0fca9855c94752b2da4a7d261a87a5d2da9292f35b46d","source":{"kind":"arxiv","id":"2007.03191","version":1},"attestation_state":"computed","paper":{"title":"Kidney Exchange with Inhomogeneous Edge Existence Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Duncan C McElfresh, Hoda Bidkhori, John P Dickerson, Ke Ren","submitted_at":"2020-07-07T04:08:39Z","abstract_excerpt":"Motivated by kidney exchange, we study a stochastic cycle and chain packing problem, where we aim to identify structures in a directed graph to maximize the expectation of matched edge weights. All edges are subject to failure, and the failures can have nonidentical probabilities. To the best of our knowledge, the state-of-the-art approaches are only tractable when failure probabilities are identical. We formulate a relevant non-convex optimization problem and propose a tractable mixed-integer linear programming reformulation to solve it. In addition, we propose a model that integrates both ri"},"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":"2007.03191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-07T04:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"ff02dd3f188f16738c8fae646f541a6152544835cdd0920b713ab81e59f3a52e","abstract_canon_sha256":"45ae54107a989a146dbeb4e889a3e5bfa7b4556f65006150af83dd065bade37c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:00.480225Z","signature_b64":"te1p3KDFrcy+kTCgHHMIplRjz19+iBLVh73pO4OuFbxlOenq13WO1noAciifb9GK5rOYUpZvSTk4Nc3qO3BZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9448c3a55f327149a1d0fca9855c94752b2da4a7d261a87a5d2da9292f35b46d","last_reissued_at":"2026-07-05T01:17:00.479788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:00.479788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kidney Exchange with Inhomogeneous Edge Existence Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Duncan C McElfresh, Hoda Bidkhori, John P Dickerson, Ke Ren","submitted_at":"2020-07-07T04:08:39Z","abstract_excerpt":"Motivated by kidney exchange, we study a stochastic cycle and chain packing problem, where we aim to identify structures in a directed graph to maximize the expectation of matched edge weights. All edges are subject to failure, and the failures can have nonidentical probabilities. To the best of our knowledge, the state-of-the-art approaches are only tractable when failure probabilities are identical. We formulate a relevant non-convex optimization problem and propose a tractable mixed-integer linear programming reformulation to solve it. In addition, we propose a model that integrates both ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03191","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/2007.03191/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.03191","created_at":"2026-07-05T01:17:00.479841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03191v1","created_at":"2026-07-05T01:17:00.479841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03191","created_at":"2026-07-05T01:17:00.479841+00:00"},{"alias_kind":"pith_short_12","alias_value":"SREMHJK7GJYU","created_at":"2026-07-05T01:17:00.479841+00:00"},{"alias_kind":"pith_short_16","alias_value":"SREMHJK7GJYUTIOQ","created_at":"2026-07-05T01:17:00.479841+00:00"},{"alias_kind":"pith_short_8","alias_value":"SREMHJK7","created_at":"2026-07-05T01:17:00.479841+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/SREMHJK7GJYUTIOQ7SUYKXEUOU","json":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU.json","graph_json":"https://pith.science/api/pith-number/SREMHJK7GJYUTIOQ7SUYKXEUOU/graph.json","events_json":"https://pith.science/api/pith-number/SREMHJK7GJYUTIOQ7SUYKXEUOU/events.json","paper":"https://pith.science/paper/SREMHJK7"},"agent_actions":{"view_html":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU","download_json":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU.json","view_paper":"https://pith.science/paper/SREMHJK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03191&json=true","fetch_graph":"https://pith.science/api/pith-number/SREMHJK7GJYUTIOQ7SUYKXEUOU/graph.json","fetch_events":"https://pith.science/api/pith-number/SREMHJK7GJYUTIOQ7SUYKXEUOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU/action/storage_attestation","attest_author":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU/action/author_attestation","sign_citation":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU/action/citation_signature","submit_replication":"https://pith.science/pith/SREMHJK7GJYUTIOQ7SUYKXEUOU/action/replication_record"}},"created_at":"2026-07-05T01:17:00.479841+00:00","updated_at":"2026-07-05T01:17:00.479841+00:00"}