{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MIP6IWTKECCYCSOQ6TOIIF4OGN","short_pith_number":"pith:MIP6IWTK","schema_version":"1.0","canonical_sha256":"621fe45a6a20858149d0f4dc84178e33795c294529142c20dc872ea5c3224954","source":{"kind":"arxiv","id":"1803.02409","version":1},"attestation_state":"computed","paper":{"title":"On the parameterized complexity of manipulating Top Trading Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Christopher Purcell, William Phan","submitted_at":"2018-03-06T20:00:14Z","abstract_excerpt":"We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central properties Pareto-efficiency, individual rationality, and strategy-proofness \\cite{Sonmez1999}. Recently, it was shown that Top Trading Cycles is $\\NP$-hard to manipulate \\cite{FujitaEA2015}, a relaxation of strategy-proofness. However, parameterized complexity is a more appropriate framework for this and other economic settings. Certain aspects of the problem - number of objects each agent brings to the table, goods up fo"},"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":"1803.02409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-06T20:00:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9b4d47cbbfc0876d631a7e05b226e5f9456b9ac8e256154cd85526b63efa67e3","abstract_canon_sha256":"997fe945b1839f5bbbe7f41dcee003c095946f26f4dc6c81752111f073d25d8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:50.380577Z","signature_b64":"nDUA7z8mD67Yb9aLgHGWo0ENJKo9pHwmKTzPrUCyfMyuG5+GpwERBVUEbJHhFDBNsSyu9LxXg9dZ1Bou7B0QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"621fe45a6a20858149d0f4dc84178e33795c294529142c20dc872ea5c3224954","last_reissued_at":"2026-05-18T00:21:50.379972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:50.379972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the parameterized complexity of manipulating Top Trading Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Christopher Purcell, William Phan","submitted_at":"2018-03-06T20:00:14Z","abstract_excerpt":"We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central properties Pareto-efficiency, individual rationality, and strategy-proofness \\cite{Sonmez1999}. Recently, it was shown that Top Trading Cycles is $\\NP$-hard to manipulate \\cite{FujitaEA2015}, a relaxation of strategy-proofness. However, parameterized complexity is a more appropriate framework for this and other economic settings. Certain aspects of the problem - number of objects each agent brings to the table, goods up fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02409","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":"1803.02409","created_at":"2026-05-18T00:21:50.380064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02409v1","created_at":"2026-05-18T00:21:50.380064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02409","created_at":"2026-05-18T00:21:50.380064+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIP6IWTKECCY","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIP6IWTKECCYCSOQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIP6IWTK","created_at":"2026-05-18T12:32:37.024351+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/MIP6IWTKECCYCSOQ6TOIIF4OGN","json":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN.json","graph_json":"https://pith.science/api/pith-number/MIP6IWTKECCYCSOQ6TOIIF4OGN/graph.json","events_json":"https://pith.science/api/pith-number/MIP6IWTKECCYCSOQ6TOIIF4OGN/events.json","paper":"https://pith.science/paper/MIP6IWTK"},"agent_actions":{"view_html":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN","download_json":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN.json","view_paper":"https://pith.science/paper/MIP6IWTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02409&json=true","fetch_graph":"https://pith.science/api/pith-number/MIP6IWTKECCYCSOQ6TOIIF4OGN/graph.json","fetch_events":"https://pith.science/api/pith-number/MIP6IWTKECCYCSOQ6TOIIF4OGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN/action/storage_attestation","attest_author":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN/action/author_attestation","sign_citation":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN/action/citation_signature","submit_replication":"https://pith.science/pith/MIP6IWTKECCYCSOQ6TOIIF4OGN/action/replication_record"}},"created_at":"2026-05-18T00:21:50.380064+00:00","updated_at":"2026-05-18T00:21:50.380064+00:00"}