{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JMRPEQ5INH3KJFGIK2S5XWFKMO","short_pith_number":"pith:JMRPEQ5I","canonical_record":{"source":{"id":"1604.05243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-18T17:09:19Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ab54429a987f5c2d546e9dd87362771ac91a49d1e3e5495eccba1ac7147ed7b6","abstract_canon_sha256":"96f79b95adde148a60e89c612d264e306d3fc0d7e2a0f47f3f1e67d91ba6b4f2"},"schema_version":"1.0"},"canonical_sha256":"4b22f243a869f6a494c856a5dbd8aa639d65806754f6bb31e0d4cc17f085bdba","source":{"kind":"arxiv","id":"1604.05243","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05243","created_at":"2026-05-18T00:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05243v2","created_at":"2026-05-18T00:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05243","created_at":"2026-05-18T00:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"JMRPEQ5INH3K","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JMRPEQ5INH3KJFGI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JMRPEQ5I","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JMRPEQ5INH3KJFGIK2S5XWFKMO","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-18T17:09:19Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ab54429a987f5c2d546e9dd87362771ac91a49d1e3e5495eccba1ac7147ed7b6","abstract_canon_sha256":"96f79b95adde148a60e89c612d264e306d3fc0d7e2a0f47f3f1e67d91ba6b4f2"},"schema_version":"1.0"},"canonical_sha256":"4b22f243a869f6a494c856a5dbd8aa639d65806754f6bb31e0d4cc17f085bdba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:31.936508Z","signature_b64":"g7Ya25dZbUnf/aSSpDHZufBrbmfFAep0DOzon0QMpefAZ4NFM4VVv5eBcavGMc4LEqSMwtY4ODJVkgNXua5NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b22f243a869f6a494c856a5dbd8aa639d65806754f6bb31e0d4cc17f085bdba","last_reissued_at":"2026-05-18T00:46:31.935835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:31.935835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05243","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3V+saQo4hcjD3RoIQG5i/3yT8mPlG8YlDE48jEXXjAX4ueibui4onGQv/bUqkfYeQEoblUcgLRssezNIJNHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:11:16.624274Z"},"content_sha256":"94fe7399de839ceeea01f42c801a4c0d25830226a085912bc4e9b40da9127101","schema_version":"1.0","event_id":"sha256:94fe7399de839ceeea01f42c801a4c0d25830226a085912bc4e9b40da9127101"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JMRPEQ5INH3KJFGIK2S5XWFKMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Strategyproof Mechanisms without Payments or Prior --- An Analytic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Yun Kuen Cheung","submitted_at":"2016-04-18T17:09:19Z","abstract_excerpt":"We revisit the problem of designing strategyproof mechanisms for allocating divisible items among two agents who have linear utilities, where payments are disallowed and there is no prior information on the agents' preferences. The objective is to design strategyproof mechanisms which are competitive against the most efficient (but not strategyproof) mechanism.\n  For the case with two items:\n  (1) We provide a set of sufficient conditions for strategyproofness.\n  (2) We use an analytic approach to derive strategyproof mechanisms which are more competitive than all prior strategyproof mechanism"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05243","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BLoWjImx7Ig3NUQ3pzonXTIcUAZJZhx5XHfeCS2SU+7bX72UebWdcQCyxqlVbR8Z+L48hrdGhGZR1SIdcr17AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:11:16.624936Z"},"content_sha256":"3df23a7665a804bc0e0dd2215d8e07d16fba34869da506a6a046bb58f2423ceb","schema_version":"1.0","event_id":"sha256:3df23a7665a804bc0e0dd2215d8e07d16fba34869da506a6a046bb58f2423ceb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO/bundle.json","state_url":"https://pith.science/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T18:11:16Z","links":{"resolver":"https://pith.science/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO","bundle":"https://pith.science/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO/bundle.json","state":"https://pith.science/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMRPEQ5INH3KJFGIK2S5XWFKMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JMRPEQ5INH3KJFGIK2S5XWFKMO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96f79b95adde148a60e89c612d264e306d3fc0d7e2a0f47f3f1e67d91ba6b4f2","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-18T17:09:19Z","title_canon_sha256":"ab54429a987f5c2d546e9dd87362771ac91a49d1e3e5495eccba1ac7147ed7b6"},"schema_version":"1.0","source":{"id":"1604.05243","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05243","created_at":"2026-05-18T00:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05243v2","created_at":"2026-05-18T00:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05243","created_at":"2026-05-18T00:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"JMRPEQ5INH3K","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JMRPEQ5INH3KJFGI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JMRPEQ5I","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:3df23a7665a804bc0e0dd2215d8e07d16fba34869da506a6a046bb58f2423ceb","target":"graph","created_at":"2026-05-18T00:46:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We revisit the problem of designing strategyproof mechanisms for allocating divisible items among two agents who have linear utilities, where payments are disallowed and there is no prior information on the agents' preferences. The objective is to design strategyproof mechanisms which are competitive against the most efficient (but not strategyproof) mechanism.\n  For the case with two items:\n  (1) We provide a set of sufficient conditions for strategyproofness.\n  (2) We use an analytic approach to derive strategyproof mechanisms which are more competitive than all prior strategyproof mechanism","authors_text":"Yun Kuen Cheung","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-18T17:09:19Z","title":"Better Strategyproof Mechanisms without Payments or Prior --- An Analytic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05243","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:94fe7399de839ceeea01f42c801a4c0d25830226a085912bc4e9b40da9127101","target":"record","created_at":"2026-05-18T00:46:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96f79b95adde148a60e89c612d264e306d3fc0d7e2a0f47f3f1e67d91ba6b4f2","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-18T17:09:19Z","title_canon_sha256":"ab54429a987f5c2d546e9dd87362771ac91a49d1e3e5495eccba1ac7147ed7b6"},"schema_version":"1.0","source":{"id":"1604.05243","kind":"arxiv","version":2}},"canonical_sha256":"4b22f243a869f6a494c856a5dbd8aa639d65806754f6bb31e0d4cc17f085bdba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b22f243a869f6a494c856a5dbd8aa639d65806754f6bb31e0d4cc17f085bdba","first_computed_at":"2026-05-18T00:46:31.935835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:31.935835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g7Ya25dZbUnf/aSSpDHZufBrbmfFAep0DOzon0QMpefAZ4NFM4VVv5eBcavGMc4LEqSMwtY4ODJVkgNXua5NBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:31.936508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05243","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94fe7399de839ceeea01f42c801a4c0d25830226a085912bc4e9b40da9127101","sha256:3df23a7665a804bc0e0dd2215d8e07d16fba34869da506a6a046bb58f2423ceb"],"state_sha256":"2b49425f62c781c658ae7d07e60e259fcde8f7ac87f66ef38582f089edda3e3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iep1YBml9PGzXcVZ38wJNPBmP7hs0hlnGmIEc5IzyRwRXGiShMXOE1LkDU+Y89RomX0LfTyHiIVR6VOTe6yVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:11:16.629113Z","bundle_sha256":"39293f5fa1d0c948f68807b41880f29439a03891127308bd382771edb1de48ca"}}