{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JE4R5QLXCJPUREAE7A23XB77RG","short_pith_number":"pith:JE4R5QLX","canonical_record":{"source":{"id":"2607.00775","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T11:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"42a0f5b3184945e46a807c88abefc1cfbbc0edcc4e28717c3f03d7f9008c352e","abstract_canon_sha256":"45a6c350495d1995df4e1bbbd05116f1ecb6d3cc88c2bffe6d2c107cee708281"},"schema_version":"1.0"},"canonical_sha256":"49391ec177125f489004f835bb87ff899ac164fd5e99f21f28a8a8cbc8486ef1","source":{"kind":"arxiv","id":"2607.00775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00775","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00775v1","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00775","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"JE4R5QLXCJPU","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"pith_short_16","alias_value":"JE4R5QLXCJPUREAE","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"pith_short_8","alias_value":"JE4R5QLX","created_at":"2026-07-02T01:17:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JE4R5QLXCJPUREAE7A23XB77RG","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00775","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T11:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"42a0f5b3184945e46a807c88abefc1cfbbc0edcc4e28717c3f03d7f9008c352e","abstract_canon_sha256":"45a6c350495d1995df4e1bbbd05116f1ecb6d3cc88c2bffe6d2c107cee708281"},"schema_version":"1.0"},"canonical_sha256":"49391ec177125f489004f835bb87ff899ac164fd5e99f21f28a8a8cbc8486ef1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:55.093079Z","signature_b64":"jQWDmai+KA33aHSVbSgyxDNKfIoOr4BQlkGfITFu0WCYl4kFJxCLcbgZakY4gdq+chyqtS+dH2rDG6Y6GHjyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49391ec177125f489004f835bb87ff899ac164fd5e99f21f28a8a8cbc8486ef1","last_reissued_at":"2026-07-02T01:17:55.092694Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:55.092694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00775","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-07-02T01:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3T2dsW5GAlQRPDNG4JAO1vxoTRD6PmEZnWeHuD6XPTPUBKHiOhQ8f1mqOyKvM8Bigcrd4DaXdkrndaE8DURHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:14:37.286838Z"},"content_sha256":"285659dbbec1ddb6be7f7b5c2d2ca4a2e2a6a4d3ef30b5c12263cb90f013c165","schema_version":"1.0","event_id":"sha256:285659dbbec1ddb6be7f7b5c2d2ca4a2e2a6a4d3ef30b5c12263cb90f013c165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JE4R5QLXCJPUREAE7A23XB77RG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On balancing consecutive slices of cake","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Bevan","submitted_at":"2026-07-01T11:00:53Z","abstract_excerpt":"Let $\\boldsymbol{a}=(a_i)_{i=1}^\\infty$ be an infinite sequence of points on a circle. The first $n$ of these points cuts the circle into $n$ pieces. For any given $r$, let $\\mu^r_n(\\boldsymbol{a})$ be the ratio between the maximum and minimum sizes of $r$ consecutive pieces. Addressing a question of De Bruijn and Erd\\H{o}s, we define a family of sequences for which the asymptotic least upper bound of this ratio, \\[ \\mu_r(\\boldsymbol{a}) \\;=\\; \\limsup_{n\\to\\infty}\\mu^r_n(\\boldsymbol{a}) , \\] can easily be calculated. Hence, for small $r$, we present upper bounds on $\\inf\\mu_r(\\boldsymbol{a})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00775","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00775/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-02T01:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/QOra+mZWG4dZL9NvzlRtbbS09DLAafnIYpEgxSeXHwaqPnVzg4BIYsNHwn5sFZgN+j4AzFZem6inQFgoaMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:14:37.287205Z"},"content_sha256":"e3964eb143566e52007ae50ce5936cb51372c7585a6ec6e0e48a0a8e53e4f066","schema_version":"1.0","event_id":"sha256:e3964eb143566e52007ae50ce5936cb51372c7585a6ec6e0e48a0a8e53e4f066"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JE4R5QLXCJPUREAE7A23XB77RG/bundle.json","state_url":"https://pith.science/pith/JE4R5QLXCJPUREAE7A23XB77RG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JE4R5QLXCJPUREAE7A23XB77RG/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-07-07T12:14:37Z","links":{"resolver":"https://pith.science/pith/JE4R5QLXCJPUREAE7A23XB77RG","bundle":"https://pith.science/pith/JE4R5QLXCJPUREAE7A23XB77RG/bundle.json","state":"https://pith.science/pith/JE4R5QLXCJPUREAE7A23XB77RG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JE4R5QLXCJPUREAE7A23XB77RG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JE4R5QLXCJPUREAE7A23XB77RG","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":"45a6c350495d1995df4e1bbbd05116f1ecb6d3cc88c2bffe6d2c107cee708281","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T11:00:53Z","title_canon_sha256":"42a0f5b3184945e46a807c88abefc1cfbbc0edcc4e28717c3f03d7f9008c352e"},"schema_version":"1.0","source":{"id":"2607.00775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00775","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00775v1","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00775","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"JE4R5QLXCJPU","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"pith_short_16","alias_value":"JE4R5QLXCJPUREAE","created_at":"2026-07-02T01:17:55Z"},{"alias_kind":"pith_short_8","alias_value":"JE4R5QLX","created_at":"2026-07-02T01:17:55Z"}],"graph_snapshots":[{"event_id":"sha256:e3964eb143566e52007ae50ce5936cb51372c7585a6ec6e0e48a0a8e53e4f066","target":"graph","created_at":"2026-07-02T01:17:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00775/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\boldsymbol{a}=(a_i)_{i=1}^\\infty$ be an infinite sequence of points on a circle. The first $n$ of these points cuts the circle into $n$ pieces. For any given $r$, let $\\mu^r_n(\\boldsymbol{a})$ be the ratio between the maximum and minimum sizes of $r$ consecutive pieces. Addressing a question of De Bruijn and Erd\\H{o}s, we define a family of sequences for which the asymptotic least upper bound of this ratio, \\[ \\mu_r(\\boldsymbol{a}) \\;=\\; \\limsup_{n\\to\\infty}\\mu^r_n(\\boldsymbol{a}) , \\] can easily be calculated. Hence, for small $r$, we present upper bounds on $\\inf\\mu_r(\\boldsymbol{a})$.","authors_text":"David Bevan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T11:00:53Z","title":"On balancing consecutive slices of cake"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00775","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:285659dbbec1ddb6be7f7b5c2d2ca4a2e2a6a4d3ef30b5c12263cb90f013c165","target":"record","created_at":"2026-07-02T01:17:55Z","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":"45a6c350495d1995df4e1bbbd05116f1ecb6d3cc88c2bffe6d2c107cee708281","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T11:00:53Z","title_canon_sha256":"42a0f5b3184945e46a807c88abefc1cfbbc0edcc4e28717c3f03d7f9008c352e"},"schema_version":"1.0","source":{"id":"2607.00775","kind":"arxiv","version":1}},"canonical_sha256":"49391ec177125f489004f835bb87ff899ac164fd5e99f21f28a8a8cbc8486ef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49391ec177125f489004f835bb87ff899ac164fd5e99f21f28a8a8cbc8486ef1","first_computed_at":"2026-07-02T01:17:55.092694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:55.092694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jQWDmai+KA33aHSVbSgyxDNKfIoOr4BQlkGfITFu0WCYl4kFJxCLcbgZakY4gdq+chyqtS+dH2rDG6Y6GHjyDQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:55.093079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:285659dbbec1ddb6be7f7b5c2d2ca4a2e2a6a4d3ef30b5c12263cb90f013c165","sha256:e3964eb143566e52007ae50ce5936cb51372c7585a6ec6e0e48a0a8e53e4f066"],"state_sha256":"c577be181e43b442013f7aa2fe4c27a1a664cb73849a5c471c5f1b8ec1c33882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tn8gD83nN7xeECCVSMb/Bkk6a9orvvEK81o+H883iRPfffYH8rQc+oW4GOr319VNQV9O1H25AawUeku8JCaPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:14:37.289083Z","bundle_sha256":"90dd824752d08020456f48c9f5b6d3830c5ec2fee7f6acbe9ae1767b758c38c9"}}