{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L3YN57E3XUNLQMDV5JZVLBVU24","short_pith_number":"pith:L3YN57E3","canonical_record":{"source":{"id":"1205.3982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-17T17:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"ac15f7f3c8ab56727d9beb90ee0160fcfa2c9daae739e0fda8477d119af0e76b","abstract_canon_sha256":"fa90d35ff96ec4beae74bf705e73198caafabffec602b0ad08ad886526275efd"},"schema_version":"1.0"},"canonical_sha256":"5ef0defc9bbd1ab83075ea735586b4d7143f9e67150b66644649b29b2313696c","source":{"kind":"arxiv","id":"1205.3982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3982","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3982v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3982","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"L3YN57E3XUNL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L3YN57E3XUNLQMDV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L3YN57E3","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L3YN57E3XUNLQMDV5JZVLBVU24","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-17T17:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"ac15f7f3c8ab56727d9beb90ee0160fcfa2c9daae739e0fda8477d119af0e76b","abstract_canon_sha256":"fa90d35ff96ec4beae74bf705e73198caafabffec602b0ad08ad886526275efd"},"schema_version":"1.0"},"canonical_sha256":"5ef0defc9bbd1ab83075ea735586b4d7143f9e67150b66644649b29b2313696c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:35.924923Z","signature_b64":"5Lk8cVc8PH25lDWJDk4iitqy1qKP00paw7ZqShaOQ00DdY+mePkzlIYrZQyI7usBLDCBC4mbVvIepkYCrUytDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef0defc9bbd1ab83075ea735586b4d7143f9e67150b66644649b29b2313696c","last_reissued_at":"2026-05-18T00:59:35.924354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:35.924354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3982","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-18T00:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhFIMkl5cG0UZivVgR3Q4kO21BSulekimnQT6yG7SDzUB6BV7WS8Ya/hCdUUw3ktrNAK8mUqbjUq91/IA+b7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:07:33.727286Z"},"content_sha256":"c061030fb504d529524fdac90dffea70f4aec88c82305f169c3c7e19fc0f1972","schema_version":"1.0","event_id":"sha256:c061030fb504d529524fdac90dffea70f4aec88c82305f169c3c7e19fc0f1972"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L3YN57E3XUNLQMDV5JZVLBVU24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Socially-Efficient Cake Divisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Avinatan Hassidim, Yair Dombb, Yonatan Aumann","submitted_at":"2012-05-17T17:01:39Z","abstract_excerpt":"We consider a setting in which a single divisible good (\"cake\") needs to be divided between n players, each with a possibly different valuation function over pieces of the cake. For this setting, we address the problem of finding divisions that maximize the social welfare, focusing on divisions where each player needs to get one contiguous piece of the cake. We show that for both the utilitarian and the egalitarian social welfare functions it is NP-hard to find the optimal division. For the utilitarian welfare, we provide a constant factor approximation algorithm, and prove that no FPTAS is po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3982","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-18T00:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgI+3jeLHPuO+NJkxnR3lzre/nEdlQwTDszjXhUHiDFb2uYQclUnarYWN0ttFnrw08Rf9uDFqwd90mEanDd9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:07:33.728003Z"},"content_sha256":"bb10efa0f5a260e4bb78a633dad8a4ccf8a949d8534660c0da35fabac05a47a5","schema_version":"1.0","event_id":"sha256:bb10efa0f5a260e4bb78a633dad8a4ccf8a949d8534660c0da35fabac05a47a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3YN57E3XUNLQMDV5JZVLBVU24/bundle.json","state_url":"https://pith.science/pith/L3YN57E3XUNLQMDV5JZVLBVU24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3YN57E3XUNLQMDV5JZVLBVU24/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-08T17:07:33Z","links":{"resolver":"https://pith.science/pith/L3YN57E3XUNLQMDV5JZVLBVU24","bundle":"https://pith.science/pith/L3YN57E3XUNLQMDV5JZVLBVU24/bundle.json","state":"https://pith.science/pith/L3YN57E3XUNLQMDV5JZVLBVU24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3YN57E3XUNLQMDV5JZVLBVU24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L3YN57E3XUNLQMDV5JZVLBVU24","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":"fa90d35ff96ec4beae74bf705e73198caafabffec602b0ad08ad886526275efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-17T17:01:39Z","title_canon_sha256":"ac15f7f3c8ab56727d9beb90ee0160fcfa2c9daae739e0fda8477d119af0e76b"},"schema_version":"1.0","source":{"id":"1205.3982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3982","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3982v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3982","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"L3YN57E3XUNL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L3YN57E3XUNLQMDV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L3YN57E3","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:bb10efa0f5a260e4bb78a633dad8a4ccf8a949d8534660c0da35fabac05a47a5","target":"graph","created_at":"2026-05-18T00:59:35Z","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 a setting in which a single divisible good (\"cake\") needs to be divided between n players, each with a possibly different valuation function over pieces of the cake. For this setting, we address the problem of finding divisions that maximize the social welfare, focusing on divisions where each player needs to get one contiguous piece of the cake. We show that for both the utilitarian and the egalitarian social welfare functions it is NP-hard to find the optimal division. For the utilitarian welfare, we provide a constant factor approximation algorithm, and prove that no FPTAS is po","authors_text":"Avinatan Hassidim, Yair Dombb, Yonatan Aumann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-17T17:01:39Z","title":"Computing Socially-Efficient Cake Divisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3982","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:c061030fb504d529524fdac90dffea70f4aec88c82305f169c3c7e19fc0f1972","target":"record","created_at":"2026-05-18T00:59:35Z","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":"fa90d35ff96ec4beae74bf705e73198caafabffec602b0ad08ad886526275efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-17T17:01:39Z","title_canon_sha256":"ac15f7f3c8ab56727d9beb90ee0160fcfa2c9daae739e0fda8477d119af0e76b"},"schema_version":"1.0","source":{"id":"1205.3982","kind":"arxiv","version":1}},"canonical_sha256":"5ef0defc9bbd1ab83075ea735586b4d7143f9e67150b66644649b29b2313696c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ef0defc9bbd1ab83075ea735586b4d7143f9e67150b66644649b29b2313696c","first_computed_at":"2026-05-18T00:59:35.924354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:35.924354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Lk8cVc8PH25lDWJDk4iitqy1qKP00paw7ZqShaOQ00DdY+mePkzlIYrZQyI7usBLDCBC4mbVvIepkYCrUytDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:35.924923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c061030fb504d529524fdac90dffea70f4aec88c82305f169c3c7e19fc0f1972","sha256:bb10efa0f5a260e4bb78a633dad8a4ccf8a949d8534660c0da35fabac05a47a5"],"state_sha256":"72a6269e3210b3ed2981350d2dddaa2b1b33d28b73b54c18cb7ba37cb20951ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcMIpugOe/a5CvETwxh92yKxEc1SJols50lyuKCC3HwQtfVz+bE2z4Fy0jlPM+nIvLFpWQm5FHj0d863mcBvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:07:33.731981Z","bundle_sha256":"4d1e1bd7c9ca1af1b142bf4022bd8fd93e8620da44763dbb0c541b5c1cfd04e4"}}