{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UIIBQOQ6QSJPXJ3RWNIMOBK5IK","short_pith_number":"pith:UIIBQOQ6","schema_version":"1.0","canonical_sha256":"a210183a1e8492fba771b350c7055d42810da85dbf2acc4982d67a6e17125f22","source":{"kind":"arxiv","id":"1404.5245","version":6},"attestation_state":"computed","paper":{"title":"Size versus truthfulness in the House Allocation problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, David Manlove, Jinshan Zhang, Piotr Krysta","submitted_at":"2014-04-21T17:08:42Z","abstract_excerpt":"We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We focus on truthful mechanisms without monetary transfers for finding large Pareto optimal matchings. It is straightforward to show that no deterministic truthful mechanism can approximate a maximum cardinality Pareto optimal matching with ratio better than 2. We thus consider randomised mechanisms. We give a natural and explicit extension of the cla"},"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":"1404.5245","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-21T17:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"5197a89e4b9bf4e0db86669955926c609abfb0075fab78b5583bd5da77ce681b","abstract_canon_sha256":"be8b06bfec6b8333526e18a39ec47541f7da84accbc6a1a4ab1b04a953fa0033"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.350884Z","signature_b64":"u2+M9wzhe5IkJXNeH95dKlqmB71ZVRDH3iyf0HDGFMU2atyQwZ/cAfHU1IQL6ex6acPC/UV/vXejSmqsldwYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a210183a1e8492fba771b350c7055d42810da85dbf2acc4982d67a6e17125f22","last_reissued_at":"2026-05-17T23:46:42.350376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.350376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Size versus truthfulness in the House Allocation problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, David Manlove, Jinshan Zhang, Piotr Krysta","submitted_at":"2014-04-21T17:08:42Z","abstract_excerpt":"We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We focus on truthful mechanisms without monetary transfers for finding large Pareto optimal matchings. It is straightforward to show that no deterministic truthful mechanism can approximate a maximum cardinality Pareto optimal matching with ratio better than 2. We thus consider randomised mechanisms. We give a natural and explicit extension of the cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5245","kind":"arxiv","version":6},"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":"1404.5245","created_at":"2026-05-17T23:46:42.350458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5245v6","created_at":"2026-05-17T23:46:42.350458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5245","created_at":"2026-05-17T23:46:42.350458+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIIBQOQ6QSJP","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIIBQOQ6QSJPXJ3R","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIIBQOQ6","created_at":"2026-05-18T12:28:52.271510+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/UIIBQOQ6QSJPXJ3RWNIMOBK5IK","json":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK.json","graph_json":"https://pith.science/api/pith-number/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/graph.json","events_json":"https://pith.science/api/pith-number/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/events.json","paper":"https://pith.science/paper/UIIBQOQ6"},"agent_actions":{"view_html":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK","download_json":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK.json","view_paper":"https://pith.science/paper/UIIBQOQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5245&json=true","fetch_graph":"https://pith.science/api/pith-number/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/graph.json","fetch_events":"https://pith.science/api/pith-number/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/action/storage_attestation","attest_author":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/action/author_attestation","sign_citation":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/action/citation_signature","submit_replication":"https://pith.science/pith/UIIBQOQ6QSJPXJ3RWNIMOBK5IK/action/replication_record"}},"created_at":"2026-05-17T23:46:42.350458+00:00","updated_at":"2026-05-17T23:46:42.350458+00:00"}