{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6OITT457NY3IAMFZI6GPRPRWN3","short_pith_number":"pith:6OITT457","schema_version":"1.0","canonical_sha256":"f39139f3bf6e368030b9478cf8be366ec78d161aec385985548dab19f7a2ef16","source":{"kind":"arxiv","id":"1606.00117","version":1},"attestation_state":"computed","paper":{"title":"Hardness of the Pricing Problem for Chains in Barter Exchanges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Benjamin Plaut, John P. Dickerson, Tuomas Sandholm","submitted_at":"2016-06-01T04:49:08Z","abstract_excerpt":"Kidney exchange is a barter market where patients trade willing but medically incompatible donors. These trades occur via cycles, where each patient-donor pair both gives and receives a kidney, and via chains, which begin with an altruistic donor who does not require a kidney in return. For logistical reasons, the maximum length of a cycle is typically limited to a small constant, while chains can be much longer. Given a compatibility graph of patient-donor pairs, altruists, and feasible potential transplants between them, finding even a maximum-cardinality set of vertex-disjoint cycles and ch"},"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":"1606.00117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-01T04:49:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c9f75f1527aa1f39ad825c1a9b7c58cf0063701811ac1342188a1dfd9a0bfbb4","abstract_canon_sha256":"f33a785796540b4de27780e296067e72911c0e59c4380e2d0a3e31da561f6c26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.886393Z","signature_b64":"ECmOnMBmSgAM/91p/pRqilC5qaOFOxjqfCBdsgbQY/cTXmlpJumyfY3jJXNcTkjJ6rZUB3/5QRnAexH7ttyZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f39139f3bf6e368030b9478cf8be366ec78d161aec385985548dab19f7a2ef16","last_reissued_at":"2026-05-18T01:13:05.885918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.885918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of the Pricing Problem for Chains in Barter Exchanges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Benjamin Plaut, John P. Dickerson, Tuomas Sandholm","submitted_at":"2016-06-01T04:49:08Z","abstract_excerpt":"Kidney exchange is a barter market where patients trade willing but medically incompatible donors. These trades occur via cycles, where each patient-donor pair both gives and receives a kidney, and via chains, which begin with an altruistic donor who does not require a kidney in return. For logistical reasons, the maximum length of a cycle is typically limited to a small constant, while chains can be much longer. Given a compatibility graph of patient-donor pairs, altruists, and feasible potential transplants between them, finding even a maximum-cardinality set of vertex-disjoint cycles and ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00117","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":"1606.00117","created_at":"2026-05-18T01:13:05.885989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00117v1","created_at":"2026-05-18T01:13:05.885989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00117","created_at":"2026-05-18T01:13:05.885989+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OITT457NY3I","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OITT457NY3IAMFZ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OITT457","created_at":"2026-05-18T12:30:01.593930+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/6OITT457NY3IAMFZI6GPRPRWN3","json":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3.json","graph_json":"https://pith.science/api/pith-number/6OITT457NY3IAMFZI6GPRPRWN3/graph.json","events_json":"https://pith.science/api/pith-number/6OITT457NY3IAMFZI6GPRPRWN3/events.json","paper":"https://pith.science/paper/6OITT457"},"agent_actions":{"view_html":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3","download_json":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3.json","view_paper":"https://pith.science/paper/6OITT457","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00117&json=true","fetch_graph":"https://pith.science/api/pith-number/6OITT457NY3IAMFZI6GPRPRWN3/graph.json","fetch_events":"https://pith.science/api/pith-number/6OITT457NY3IAMFZI6GPRPRWN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3/action/storage_attestation","attest_author":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3/action/author_attestation","sign_citation":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3/action/citation_signature","submit_replication":"https://pith.science/pith/6OITT457NY3IAMFZI6GPRPRWN3/action/replication_record"}},"created_at":"2026-05-18T01:13:05.885989+00:00","updated_at":"2026-05-18T01:13:05.885989+00:00"}