{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IXXT7DED76NB4BJLAPSYMAUQOC","short_pith_number":"pith:IXXT7DED","canonical_record":{"source":{"id":"1606.08077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-26T19:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"7877004366402a2fbb4b9a2c8d39bf01333d417ee15933ac5dec0da9c323ed96","abstract_canon_sha256":"6f6f7ab0b9ae9d9d48a426ca3e0207584a5a5ae8f6beaf37a0519f915a801a65"},"schema_version":"1.0"},"canonical_sha256":"45ef3f8c83ff9a1e052b03e5860290708937b03ad0028414d16c171dd4ee5e96","source":{"kind":"arxiv","id":"1606.08077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08077","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08077v1","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08077","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"IXXT7DED76NB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IXXT7DED76NB4BJL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IXXT7DED","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IXXT7DED76NB4BJLAPSYMAUQOC","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-26T19:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"7877004366402a2fbb4b9a2c8d39bf01333d417ee15933ac5dec0da9c323ed96","abstract_canon_sha256":"6f6f7ab0b9ae9d9d48a426ca3e0207584a5a5ae8f6beaf37a0519f915a801a65"},"schema_version":"1.0"},"canonical_sha256":"45ef3f8c83ff9a1e052b03e5860290708937b03ad0028414d16c171dd4ee5e96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.864783Z","signature_b64":"utk0PxRz7fdc5wHsH741r3kPRqEdYzoU39pdftVFaeCvUGtmfCKpJPd+QZy9Kg7hQD+DOobrsDw6lEHEf/3vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45ef3f8c83ff9a1e052b03e5860290708937b03ad0028414d16c171dd4ee5e96","last_reissued_at":"2026-05-17T23:54:48.864200Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.864200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08077","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-17T23:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XW/PlibU80CmeTcxbrsE98nw+Ii+dwmwmMqm1lDwTOgo1J/GE4CaV7Xyp6nWij1wKBHqtLX5VQUJ9b42rZAHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:44:14.822579Z"},"content_sha256":"0a1a6baf55ab2683a45fda0aff5402cc3896bf2b69c27a1fb077e735e7e66707","schema_version":"1.0","event_id":"sha256:0a1a6baf55ab2683a45fda0aff5402cc3896bf2b69c27a1fb077e735e7e66707"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IXXT7DED76NB4BJLAPSYMAUQOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Assigning a Small Agreeable Set of Indivisible Items to Multiple Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Warut Suksompong","submitted_at":"2016-06-26T19:41:00Z","abstract_excerpt":"We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen subset is \\emph{agreeable} to all players, i.e., every player weakly prefers the chosen subset to any subset of its complement. For an arbitrary number of players, we derive tight upper bounds on the size for which a subset of that size that is agreeable to all players always exists when preferences are monotonic. We then present polynomial-time algorithms that f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08077","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-17T23:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9HTT1lWDx2IKRA9YNGVvMkHCtisxO1y7gZStioxoWo0VLO1zwswgOlhUhzt52l5hZrff/SKkdS3sWr28UmuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:44:14.823245Z"},"content_sha256":"d09abdbe8d45a379825bf78be0482a2823d8ecf0d09508e1196f3e2571c99d3c","schema_version":"1.0","event_id":"sha256:d09abdbe8d45a379825bf78be0482a2823d8ecf0d09508e1196f3e2571c99d3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXXT7DED76NB4BJLAPSYMAUQOC/bundle.json","state_url":"https://pith.science/pith/IXXT7DED76NB4BJLAPSYMAUQOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXXT7DED76NB4BJLAPSYMAUQOC/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-08T16:44:14Z","links":{"resolver":"https://pith.science/pith/IXXT7DED76NB4BJLAPSYMAUQOC","bundle":"https://pith.science/pith/IXXT7DED76NB4BJLAPSYMAUQOC/bundle.json","state":"https://pith.science/pith/IXXT7DED76NB4BJLAPSYMAUQOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXXT7DED76NB4BJLAPSYMAUQOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IXXT7DED76NB4BJLAPSYMAUQOC","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":"6f6f7ab0b9ae9d9d48a426ca3e0207584a5a5ae8f6beaf37a0519f915a801a65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-26T19:41:00Z","title_canon_sha256":"7877004366402a2fbb4b9a2c8d39bf01333d417ee15933ac5dec0da9c323ed96"},"schema_version":"1.0","source":{"id":"1606.08077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08077","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08077v1","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08077","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"IXXT7DED76NB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IXXT7DED76NB4BJL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IXXT7DED","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:d09abdbe8d45a379825bf78be0482a2823d8ecf0d09508e1196f3e2571c99d3c","target":"graph","created_at":"2026-05-17T23:54:48Z","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 consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen subset is \\emph{agreeable} to all players, i.e., every player weakly prefers the chosen subset to any subset of its complement. For an arbitrary number of players, we derive tight upper bounds on the size for which a subset of that size that is agreeable to all players always exists when preferences are monotonic. We then present polynomial-time algorithms that f","authors_text":"Warut Suksompong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-26T19:41:00Z","title":"Assigning a Small Agreeable Set of Indivisible Items to Multiple Players"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08077","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:0a1a6baf55ab2683a45fda0aff5402cc3896bf2b69c27a1fb077e735e7e66707","target":"record","created_at":"2026-05-17T23:54:48Z","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":"6f6f7ab0b9ae9d9d48a426ca3e0207584a5a5ae8f6beaf37a0519f915a801a65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-26T19:41:00Z","title_canon_sha256":"7877004366402a2fbb4b9a2c8d39bf01333d417ee15933ac5dec0da9c323ed96"},"schema_version":"1.0","source":{"id":"1606.08077","kind":"arxiv","version":1}},"canonical_sha256":"45ef3f8c83ff9a1e052b03e5860290708937b03ad0028414d16c171dd4ee5e96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45ef3f8c83ff9a1e052b03e5860290708937b03ad0028414d16c171dd4ee5e96","first_computed_at":"2026-05-17T23:54:48.864200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:48.864200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"utk0PxRz7fdc5wHsH741r3kPRqEdYzoU39pdftVFaeCvUGtmfCKpJPd+QZy9Kg7hQD+DOobrsDw6lEHEf/3vCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:48.864783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a1a6baf55ab2683a45fda0aff5402cc3896bf2b69c27a1fb077e735e7e66707","sha256:d09abdbe8d45a379825bf78be0482a2823d8ecf0d09508e1196f3e2571c99d3c"],"state_sha256":"3375b9059eccbe8c9bbcfc1a52568fdd805d89388539cea34ec4b9795def877f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5C45sEQVYqpbFwaKsNy+14X9sxigkJjghyErJOTsWJN8ynRoQRh7NVJ+FVdH1JI0gprlRMEBLTLwcDgNKQqWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:44:14.826914Z","bundle_sha256":"ebfa5ad7f9b388efa8d82e42f1a3eba85677badd6b1ea342ffe436259d355ecf"}}