{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5DKV6H3WWIO6ED4V2Y5XWXFQYW","short_pith_number":"pith:5DKV6H3W","schema_version":"1.0","canonical_sha256":"e8d55f1f76b21de20f95d63b7b5cb0c5a165630f3ebb8b8f675cb809ec5b363e","source":{"kind":"arxiv","id":"1006.1881","version":1},"attestation_state":"computed","paper":{"title":"Mix and Match","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Felix Fischer, Ian A. Kash, Itai Ashlagi","submitted_at":"2010-06-09T19:26:00Z","abstract_excerpt":"Consider a matching problem on a graph where disjoint sets of vertices are privately owned by self-interested agents. An edge between a pair of vertices indicates compatibility and allows the vertices to match. We seek a mechanism to maximize the number of matches despite self-interest, with agents that each want to maximize the number of their own vertices that match. Each agent can choose to hide some of its vertices, and then privately match the hidden vertices with any of its own vertices that go unmatched by the mechanism. A prominent application of this model is to kidney exchange, where"},"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":"1006.1881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-06-09T19:26:00Z","cross_cats_sorted":[],"title_canon_sha256":"60ed35cfdbf93653696a662ac233a4ef395762f06d7eb78aedffd556646c08ee","abstract_canon_sha256":"e1a9d23caca83615a5c05134de1d7b1044eabdbf578c6f916f05d631d05ca3c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:58.375353Z","signature_b64":"mzLn8TWADPhCH4hOQFcEhCwyTm1DlYNbCBJPRGZf6ejKzkcewc3WmyCPgbFtLd1TxMJvQTYctt+WuUSXoIGYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8d55f1f76b21de20f95d63b7b5cb0c5a165630f3ebb8b8f675cb809ec5b363e","last_reissued_at":"2026-05-18T00:56:58.374649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:58.374649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mix and Match","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Felix Fischer, Ian A. Kash, Itai Ashlagi","submitted_at":"2010-06-09T19:26:00Z","abstract_excerpt":"Consider a matching problem on a graph where disjoint sets of vertices are privately owned by self-interested agents. An edge between a pair of vertices indicates compatibility and allows the vertices to match. We seek a mechanism to maximize the number of matches despite self-interest, with agents that each want to maximize the number of their own vertices that match. Each agent can choose to hide some of its vertices, and then privately match the hidden vertices with any of its own vertices that go unmatched by the mechanism. A prominent application of this model is to kidney exchange, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1881","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":"1006.1881","created_at":"2026-05-18T00:56:58.374731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1881v1","created_at":"2026-05-18T00:56:58.374731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1881","created_at":"2026-05-18T00:56:58.374731+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DKV6H3WWIO6","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DKV6H3WWIO6ED4V","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DKV6H3W","created_at":"2026-05-18T12:26:04.259169+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/5DKV6H3WWIO6ED4V2Y5XWXFQYW","json":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW.json","graph_json":"https://pith.science/api/pith-number/5DKV6H3WWIO6ED4V2Y5XWXFQYW/graph.json","events_json":"https://pith.science/api/pith-number/5DKV6H3WWIO6ED4V2Y5XWXFQYW/events.json","paper":"https://pith.science/paper/5DKV6H3W"},"agent_actions":{"view_html":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW","download_json":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW.json","view_paper":"https://pith.science/paper/5DKV6H3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1881&json=true","fetch_graph":"https://pith.science/api/pith-number/5DKV6H3WWIO6ED4V2Y5XWXFQYW/graph.json","fetch_events":"https://pith.science/api/pith-number/5DKV6H3WWIO6ED4V2Y5XWXFQYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW/action/storage_attestation","attest_author":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW/action/author_attestation","sign_citation":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW/action/citation_signature","submit_replication":"https://pith.science/pith/5DKV6H3WWIO6ED4V2Y5XWXFQYW/action/replication_record"}},"created_at":"2026-05-18T00:56:58.374731+00:00","updated_at":"2026-05-18T00:56:58.374731+00:00"}