{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YFNBY5RI2HA7HSQVD42CYN4P36","short_pith_number":"pith:YFNBY5RI","canonical_record":{"source":{"id":"1705.02748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-08T05:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"2d62acf16b6931b9bf2fc4efc7aa9fb3dc9ee5fb7cf77ea5019901bae204fd62","abstract_canon_sha256":"d3d76b72f662e4261fa7900a72769a4664a276fba2c630ffae5945b82d6d5b6c"},"schema_version":"1.0"},"canonical_sha256":"c15a1c7628d1c1f3ca151f342c378fdf9ce0c928e36c2cedb5ecedbe7d5d63a6","source":{"kind":"arxiv","id":"1705.02748","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02748","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02748v2","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02748","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"YFNBY5RI2HA7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFNBY5RI2HA7HSQV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFNBY5RI","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YFNBY5RI2HA7HSQVD42CYN4P36","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-08T05:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"2d62acf16b6931b9bf2fc4efc7aa9fb3dc9ee5fb7cf77ea5019901bae204fd62","abstract_canon_sha256":"d3d76b72f662e4261fa7900a72769a4664a276fba2c630ffae5945b82d6d5b6c"},"schema_version":"1.0"},"canonical_sha256":"c15a1c7628d1c1f3ca151f342c378fdf9ce0c928e36c2cedb5ecedbe7d5d63a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.750272Z","signature_b64":"pTWgXWx5YXhzBXihlONc+iauRi7/urQRQC0H+aS15ZPOFdbyTkzsQOzkPwrleQJTpSo1l6Crq03ducGL1mK8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c15a1c7628d1c1f3ca151f342c378fdf9ce0c928e36c2cedb5ecedbe7d5d63a6","last_reissued_at":"2026-05-17T23:54:48.749697Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.749697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02748","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-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":"w3qLCWWnAC1gVYgPtZHx51v07RmVgsbEEXKb0BHTH6zWvQ3IqOjXBelp8ze25Xb3WC9GWPzevB7zPknNuCOdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:27:57.168324Z"},"content_sha256":"d18c8042151bf6468d81ef9aac5e51751fdedec7c0de3df89a03b43c5c08787e","schema_version":"1.0","event_id":"sha256:d18c8042151bf6468d81ef9aac5e51751fdedec7c0de3df89a03b43c5c08787e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YFNBY5RI2HA7HSQVD42CYN4P36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing an Approximately Optimal Agreeable Set of Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Pasin Manurangsi, Warut Suksompong","submitted_at":"2017-05-08T05:31:17Z","abstract_excerpt":"We study the problem of finding a small subset of items that is \\emph{agreeable} to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with a given number of agents and items, on the number of items that may need to be included in such a subset. Our goal in this paper is to efficiently compute an agreeable subset whose size approximates the size of the smallest agreeable subset for a given instance. We consider three well-known models for representing the preferences of the agents: ordinal prefe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02748","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-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":"wFyhGu0YynTKCfd440IiWxZNdDxF5eUy8NbpqZ3TwclzviEHhlCcNZGT0CkThTGICjW9PUMwhg9zHtiOj8CMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:27:57.168672Z"},"content_sha256":"e9ddeaaab59a2dc01a342bec1b906d03f43e528f114d3609ace2239bb88189ae","schema_version":"1.0","event_id":"sha256:e9ddeaaab59a2dc01a342bec1b906d03f43e528f114d3609ace2239bb88189ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFNBY5RI2HA7HSQVD42CYN4P36/bundle.json","state_url":"https://pith.science/pith/YFNBY5RI2HA7HSQVD42CYN4P36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFNBY5RI2HA7HSQVD42CYN4P36/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-02T00:27:57Z","links":{"resolver":"https://pith.science/pith/YFNBY5RI2HA7HSQVD42CYN4P36","bundle":"https://pith.science/pith/YFNBY5RI2HA7HSQVD42CYN4P36/bundle.json","state":"https://pith.science/pith/YFNBY5RI2HA7HSQVD42CYN4P36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFNBY5RI2HA7HSQVD42CYN4P36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YFNBY5RI2HA7HSQVD42CYN4P36","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":"d3d76b72f662e4261fa7900a72769a4664a276fba2c630ffae5945b82d6d5b6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-08T05:31:17Z","title_canon_sha256":"2d62acf16b6931b9bf2fc4efc7aa9fb3dc9ee5fb7cf77ea5019901bae204fd62"},"schema_version":"1.0","source":{"id":"1705.02748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02748","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02748v2","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02748","created_at":"2026-05-17T23:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"YFNBY5RI2HA7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFNBY5RI2HA7HSQV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFNBY5RI","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e9ddeaaab59a2dc01a342bec1b906d03f43e528f114d3609ace2239bb88189ae","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 study the problem of finding a small subset of items that is \\emph{agreeable} to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with a given number of agents and items, on the number of items that may need to be included in such a subset. Our goal in this paper is to efficiently compute an agreeable subset whose size approximates the size of the smallest agreeable subset for a given instance. We consider three well-known models for representing the preferences of the agents: ordinal prefe","authors_text":"Pasin Manurangsi, Warut Suksompong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-08T05:31:17Z","title":"Computing an Approximately Optimal Agreeable Set of Items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02748","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:d18c8042151bf6468d81ef9aac5e51751fdedec7c0de3df89a03b43c5c08787e","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":"d3d76b72f662e4261fa7900a72769a4664a276fba2c630ffae5945b82d6d5b6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-08T05:31:17Z","title_canon_sha256":"2d62acf16b6931b9bf2fc4efc7aa9fb3dc9ee5fb7cf77ea5019901bae204fd62"},"schema_version":"1.0","source":{"id":"1705.02748","kind":"arxiv","version":2}},"canonical_sha256":"c15a1c7628d1c1f3ca151f342c378fdf9ce0c928e36c2cedb5ecedbe7d5d63a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c15a1c7628d1c1f3ca151f342c378fdf9ce0c928e36c2cedb5ecedbe7d5d63a6","first_computed_at":"2026-05-17T23:54:48.749697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:48.749697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pTWgXWx5YXhzBXihlONc+iauRi7/urQRQC0H+aS15ZPOFdbyTkzsQOzkPwrleQJTpSo1l6Crq03ducGL1mK8CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:48.750272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d18c8042151bf6468d81ef9aac5e51751fdedec7c0de3df89a03b43c5c08787e","sha256:e9ddeaaab59a2dc01a342bec1b906d03f43e528f114d3609ace2239bb88189ae"],"state_sha256":"0d46cbaf77af50fb1d4f3bb9aeb633cb7ef125116539175948c17b239db130ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIQ/h4aoorheNj4FmXoIIJQrM9JG9W41X7voLnaVdv55/X/eBogXkmNdZ8U3IfvG/XU029dY5dS+igmATorSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:27:57.170551Z","bundle_sha256":"06bc2dd5f60783ed4cc22d4fdb3f57864c14600b371470878d0f658bc01f0a4c"}}