{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6GPZSPXM7LZEVJBJGEBX3YS4G7","short_pith_number":"pith:6GPZSPXM","canonical_record":{"source":{"id":"1502.04048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T16:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"1571f02f1974447a85774655a9a23a1dda67239f9310f29c4128bd18cf293fee","abstract_canon_sha256":"7d62bf2edaf31f3a4bc1eeba6de34a96bccbb95647f499dc42a6e805ad1c85d7"},"schema_version":"1.0"},"canonical_sha256":"f19f993eecfaf24aa42931037de25c37ea6ac56fb89bf1be81c0eebba25f497b","source":{"kind":"arxiv","id":"1502.04048","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04048","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04048v3","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04048","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"pith_short_12","alias_value":"6GPZSPXM7LZE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GPZSPXM7LZEVJBJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GPZSPXM","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6GPZSPXM7LZEVJBJGEBX3YS4G7","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T16:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"1571f02f1974447a85774655a9a23a1dda67239f9310f29c4128bd18cf293fee","abstract_canon_sha256":"7d62bf2edaf31f3a4bc1eeba6de34a96bccbb95647f499dc42a6e805ad1c85d7"},"schema_version":"1.0"},"canonical_sha256":"f19f993eecfaf24aa42931037de25c37ea6ac56fb89bf1be81c0eebba25f497b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:24.065221Z","signature_b64":"sbDDz3ND+DkcTjFKPUSnxuk8Np4zpzJ7I1K6b8u3C5BLMuW7J52cX9R4LpQ6DWatWH9IZIKM+BZ2H5F8iOPdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19f993eecfaf24aa42931037de25c37ea6ac56fb89bf1be81c0eebba25f497b","last_reissued_at":"2026-05-18T00:31:24.064793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:24.064793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04048","source_version":3,"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:31:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WherlpkQG6KIzcK7m0tMjYIwOkpkwuQwUreJdcPX5vRwU0JKHAWE9k9riZJE8veWBeTcsOC91zn0RjerajvSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:08:46.776835Z"},"content_sha256":"a3bf8e43f58f78488cc132d757909e904683fdaf632e086683a9786e3e51a956","schema_version":"1.0","event_id":"sha256:a3bf8e43f58f78488cc132d757909e904683fdaf632e086683a9786e3e51a956"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6GPZSPXM7LZEVJBJGEBX3YS4G7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raphael Reitzig, Sebastian Wild","submitted_at":"2015-02-13T16:22:18Z","abstract_excerpt":"Given a set of n sticks of various (not necessarily different) lengths, what is the largest length so that we can cut k equally long pieces of this length from the given set of sticks? We analyze the structure of this problem and show that it essentially reduces to a single call of a selection algorithm; we thus obtain an optimal linear-time algorithm.\n  This algorithm also solves the related envy-free stick-division problem, which Segal-Halevi, Hassidim, and Aumann (AAMAS, 2015) recently used as their central primitive operation for the first discrete and bounded envy-free cake cutting protoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04048","kind":"arxiv","version":3},"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:31:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIhmAeoBZP5XzAg/G2cO4MEFgeVssUNb8VMzJMHOnPmEfka+fc6FwGejBWTptG7KdBTroxGknL62SPa1nPy+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:08:46.777538Z"},"content_sha256":"8c2b7ef0dcefdd9102c4402382289741307ee3a411c620821947ad76f0b52602","schema_version":"1.0","event_id":"sha256:8c2b7ef0dcefdd9102c4402382289741307ee3a411c620821947ad76f0b52602"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7/bundle.json","state_url":"https://pith.science/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7/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-30T04:08:46Z","links":{"resolver":"https://pith.science/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7","bundle":"https://pith.science/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7/bundle.json","state":"https://pith.science/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GPZSPXM7LZEVJBJGEBX3YS4G7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6GPZSPXM7LZEVJBJGEBX3YS4G7","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":"7d62bf2edaf31f3a4bc1eeba6de34a96bccbb95647f499dc42a6e805ad1c85d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T16:22:18Z","title_canon_sha256":"1571f02f1974447a85774655a9a23a1dda67239f9310f29c4128bd18cf293fee"},"schema_version":"1.0","source":{"id":"1502.04048","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04048","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04048v3","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04048","created_at":"2026-05-18T00:31:24Z"},{"alias_kind":"pith_short_12","alias_value":"6GPZSPXM7LZE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GPZSPXM7LZEVJBJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GPZSPXM","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:8c2b7ef0dcefdd9102c4402382289741307ee3a411c620821947ad76f0b52602","target":"graph","created_at":"2026-05-18T00:31:24Z","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":"Given a set of n sticks of various (not necessarily different) lengths, what is the largest length so that we can cut k equally long pieces of this length from the given set of sticks? We analyze the structure of this problem and show that it essentially reduces to a single call of a selection algorithm; we thus obtain an optimal linear-time algorithm.\n  This algorithm also solves the related envy-free stick-division problem, which Segal-Halevi, Hassidim, and Aumann (AAMAS, 2015) recently used as their central primitive operation for the first discrete and bounded envy-free cake cutting protoc","authors_text":"Raphael Reitzig, Sebastian Wild","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T16:22:18Z","title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04048","kind":"arxiv","version":3},"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:a3bf8e43f58f78488cc132d757909e904683fdaf632e086683a9786e3e51a956","target":"record","created_at":"2026-05-18T00:31:24Z","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":"7d62bf2edaf31f3a4bc1eeba6de34a96bccbb95647f499dc42a6e805ad1c85d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T16:22:18Z","title_canon_sha256":"1571f02f1974447a85774655a9a23a1dda67239f9310f29c4128bd18cf293fee"},"schema_version":"1.0","source":{"id":"1502.04048","kind":"arxiv","version":3}},"canonical_sha256":"f19f993eecfaf24aa42931037de25c37ea6ac56fb89bf1be81c0eebba25f497b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f19f993eecfaf24aa42931037de25c37ea6ac56fb89bf1be81c0eebba25f497b","first_computed_at":"2026-05-18T00:31:24.064793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:24.064793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sbDDz3ND+DkcTjFKPUSnxuk8Np4zpzJ7I1K6b8u3C5BLMuW7J52cX9R4LpQ6DWatWH9IZIKM+BZ2H5F8iOPdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:24.065221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04048","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3bf8e43f58f78488cc132d757909e904683fdaf632e086683a9786e3e51a956","sha256:8c2b7ef0dcefdd9102c4402382289741307ee3a411c620821947ad76f0b52602"],"state_sha256":"37b513d87fb8a0362cf22afbc8423bbf183ab2205e5f38bcbc88d17d7e395a4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzTCYZK5QsazjCC9d+ND69KNHwWcPoTtOX+Fz2oe5GgI6YIbQCvDlFRaYOABGmVUn4i8KAiQTzpUEmj/9v+ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:08:46.781221Z","bundle_sha256":"e238fca1c36a39369944ca51b92a7afe7ddd0ed0450e80be9a91ca341e4d48e9"}}