{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TBC2K4DCGKPU5HBCAA3FR5C6Y7","short_pith_number":"pith:TBC2K4DC","canonical_record":{"source":{"id":"1605.04026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-13T01:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"347e5b7df6a14501eda0794df79ba9a1a9fee842dcd38398981931aa2ecade74","abstract_canon_sha256":"457b9cf0728e15fb9c04861c3c476b734b7cc350d4435b413b9efdbd5a90d3b2"},"schema_version":"1.0"},"canonical_sha256":"9845a57062329f4e9c22003658f45ec7e6f5faa7fc4388830e0563d9ed920f3d","source":{"kind":"arxiv","id":"1605.04026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04026","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04026v1","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04026","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"TBC2K4DCGKPU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TBC2K4DCGKPU5HBC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TBC2K4DC","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TBC2K4DCGKPU5HBCAA3FR5C6Y7","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-13T01:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"347e5b7df6a14501eda0794df79ba9a1a9fee842dcd38398981931aa2ecade74","abstract_canon_sha256":"457b9cf0728e15fb9c04861c3c476b734b7cc350d4435b413b9efdbd5a90d3b2"},"schema_version":"1.0"},"canonical_sha256":"9845a57062329f4e9c22003658f45ec7e6f5faa7fc4388830e0563d9ed920f3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:54.512644Z","signature_b64":"wxuwMZT7KAXi/9gpFHsV7Hfkk8yZRAPUnJ7Pinmw+tX/KiuAkc2KRCxZ2A/16NXkvWM1y0zbiVkZfTl8Qnt5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9845a57062329f4e9c22003658f45ec7e6f5faa7fc4388830e0563d9ed920f3d","last_reissued_at":"2026-05-18T01:14:54.512212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:54.512212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04026","source_version":1,"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-18T01:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhGe4buX54qWqIm8cmhNqIfiM9g/zMlhHzVBRvqwyT/i566D9JScETD+KYpA6VRe13kqnanq0jhFZu7geOcbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:52:33.109577Z"},"content_sha256":"cc2b962b57820c9200e7b7496c3161d8c070075494ecaed7606d1ea6e1954516","schema_version":"1.0","event_id":"sha256:cc2b962b57820c9200e7b7496c3161d8c070075494ecaed7606d1ea6e1954516"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TBC2K4DCGKPU5HBCAA3FR5C6Y7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Truthful Mechanisms for Maximin Share Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Evangelos Markakis, Georgios Amanatidis, Georgios Birmpas","submitted_at":"2016-05-13T01:32:24Z","abstract_excerpt":"We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition the items in any way she prefers, into $n$ bundles, and then receive her least desirable bundle. The objective then is to find an allocation, so that each player is guaranteed her maximin share. Previous works have studied this problem mostly algorithmically, providing constant factor approximation algorithms. In this work we embark on a mechanism design app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04026","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"},"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-18T01:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvErXuhETdtlxT41zfMYRS93ASTgWjawlQ4UPA392lGBe6YFqC3+Q4vM+/F65mVhqRtFRCEq5fEzxRuX9c+VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:52:33.110197Z"},"content_sha256":"d1e07c88bd6da359381e4f8f3bce747f16c931bb8a38772f71418ef065cb9128","schema_version":"1.0","event_id":"sha256:d1e07c88bd6da359381e4f8f3bce747f16c931bb8a38772f71418ef065cb9128"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7/bundle.json","state_url":"https://pith.science/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7/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-05-22T21:52:33Z","links":{"resolver":"https://pith.science/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7","bundle":"https://pith.science/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7/bundle.json","state":"https://pith.science/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBC2K4DCGKPU5HBCAA3FR5C6Y7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TBC2K4DCGKPU5HBCAA3FR5C6Y7","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":"457b9cf0728e15fb9c04861c3c476b734b7cc350d4435b413b9efdbd5a90d3b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-13T01:32:24Z","title_canon_sha256":"347e5b7df6a14501eda0794df79ba9a1a9fee842dcd38398981931aa2ecade74"},"schema_version":"1.0","source":{"id":"1605.04026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04026","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04026v1","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04026","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"TBC2K4DCGKPU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TBC2K4DCGKPU5HBC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TBC2K4DC","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:d1e07c88bd6da359381e4f8f3bce747f16c931bb8a38772f71418ef065cb9128","target":"graph","created_at":"2026-05-18T01:14:54Z","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 study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition the items in any way she prefers, into $n$ bundles, and then receive her least desirable bundle. The objective then is to find an allocation, so that each player is guaranteed her maximin share. Previous works have studied this problem mostly algorithmically, providing constant factor approximation algorithms. In this work we embark on a mechanism design app","authors_text":"Evangelos Markakis, Georgios Amanatidis, Georgios Birmpas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-13T01:32:24Z","title":"On Truthful Mechanisms for Maximin Share Allocations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04026","kind":"arxiv","version":1},"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:cc2b962b57820c9200e7b7496c3161d8c070075494ecaed7606d1ea6e1954516","target":"record","created_at":"2026-05-18T01:14:54Z","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":"457b9cf0728e15fb9c04861c3c476b734b7cc350d4435b413b9efdbd5a90d3b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-13T01:32:24Z","title_canon_sha256":"347e5b7df6a14501eda0794df79ba9a1a9fee842dcd38398981931aa2ecade74"},"schema_version":"1.0","source":{"id":"1605.04026","kind":"arxiv","version":1}},"canonical_sha256":"9845a57062329f4e9c22003658f45ec7e6f5faa7fc4388830e0563d9ed920f3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9845a57062329f4e9c22003658f45ec7e6f5faa7fc4388830e0563d9ed920f3d","first_computed_at":"2026-05-18T01:14:54.512212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:54.512212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wxuwMZT7KAXi/9gpFHsV7Hfkk8yZRAPUnJ7Pinmw+tX/KiuAkc2KRCxZ2A/16NXkvWM1y0zbiVkZfTl8Qnt5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:54.512644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc2b962b57820c9200e7b7496c3161d8c070075494ecaed7606d1ea6e1954516","sha256:d1e07c88bd6da359381e4f8f3bce747f16c931bb8a38772f71418ef065cb9128"],"state_sha256":"9b62479972e3e30ee0304bda271db2c81bd6af360d23d2fc78e9e268355bb4d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqDCeHJpXyas38TnpmUrf6YXwX8Id/yW5WIsads/jaQabP48MJgNfVJpg+5WeTsV0jiSs6QmtH13oXMKay+kCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:52:33.113393Z","bundle_sha256":"1bb210c2dd88eb1cce95c7d63f0c3de175dfb00105f41f53ca135dae686952ab"}}