{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:734YCCI5RYOYHTJ3TIWK52WZ7V","short_pith_number":"pith:734YCCI5","canonical_record":{"source":{"id":"2605.21829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T23:51:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fe694313da66d56c46a0e29891910b7634ccbeb618d124f2f0fdcff62894d82d","abstract_canon_sha256":"5e8e084d788ff9686fd2a4f2b79c7f4ce0e68fb95baff9cfa7d54b6f919f2d13"},"schema_version":"1.0"},"canonical_sha256":"fef981091d8e1d83cd3b9a2caeead9fd742f042cc157d00efd996dae5346af4f","source":{"kind":"arxiv","id":"2605.21829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21829","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21829v1","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21829","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"734YCCI5RYOY","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_16","alias_value":"734YCCI5RYOYHTJ3","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_8","alias_value":"734YCCI5","created_at":"2026-05-22T01:04:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:734YCCI5RYOYHTJ3TIWK52WZ7V","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T23:51:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fe694313da66d56c46a0e29891910b7634ccbeb618d124f2f0fdcff62894d82d","abstract_canon_sha256":"5e8e084d788ff9686fd2a4f2b79c7f4ce0e68fb95baff9cfa7d54b6f919f2d13"},"schema_version":"1.0"},"canonical_sha256":"fef981091d8e1d83cd3b9a2caeead9fd742f042cc157d00efd996dae5346af4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:09.830458Z","signature_b64":"SmY5NNHyA/sUPHYbp2kTY7bf1mbkY+DNURHXyF8gQ8Re1EeDcCJNX5Kq7m8ITvBwWQoRq8KZBMhtq4pfe7nlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fef981091d8e1d83cd3b9a2caeead9fd742f042cc157d00efd996dae5346af4f","last_reissued_at":"2026-05-22T01:04:09.829708Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:09.829708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21829","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-22T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGN1iPeHFV4hfhyOL+auRIYrKiXFtlpwpdk6Cy1DvyMBgAKvZyRPm2K7SvxvGtv0R4Gg9LrMVjBCD9l5XwesCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:27:06.138636Z"},"content_sha256":"7c8434b7450e67bb50fb74973a3ec1976df1eb64eb096698d90318c9c32f3c77","schema_version":"1.0","event_id":"sha256:7c8434b7450e67bb50fb74973a3ec1976df1eb64eb096698d90318c9c32f3c77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:734YCCI5RYOYHTJ3TIWK52WZ7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $\\Omega(n \\log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Kirk Pruhs (university of Pittsburgh), Stephen Arndt (Carnegie Mellon University), Trung Tran (University of Pittsburgh)","submitted_at":"2026-05-20T23:51:30Z","abstract_excerpt":"We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use $\\Omega(n \\log n)$ queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21829","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/2605.21829/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-05-22T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+Zgp9v5VnhmV4AAR97EUgdwR36sWe06lrDYM2UGNKQ7Ve8nfyHwQ646KKie0lcxOAmEaDgkIcSIytV/bsvmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:27:06.139405Z"},"content_sha256":"aa17ad52b091a2d0d951dbc52f2e5a6022b7d2f0b4f5d5bd033cca9045956bf7","schema_version":"1.0","event_id":"sha256:aa17ad52b091a2d0d951dbc52f2e5a6022b7d2f0b4f5d5bd033cca9045956bf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/734YCCI5RYOYHTJ3TIWK52WZ7V/bundle.json","state_url":"https://pith.science/pith/734YCCI5RYOYHTJ3TIWK52WZ7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/734YCCI5RYOYHTJ3TIWK52WZ7V/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-10T10:27:06Z","links":{"resolver":"https://pith.science/pith/734YCCI5RYOYHTJ3TIWK52WZ7V","bundle":"https://pith.science/pith/734YCCI5RYOYHTJ3TIWK52WZ7V/bundle.json","state":"https://pith.science/pith/734YCCI5RYOYHTJ3TIWK52WZ7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/734YCCI5RYOYHTJ3TIWK52WZ7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:734YCCI5RYOYHTJ3TIWK52WZ7V","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":"5e8e084d788ff9686fd2a4f2b79c7f4ce0e68fb95baff9cfa7d54b6f919f2d13","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T23:51:30Z","title_canon_sha256":"fe694313da66d56c46a0e29891910b7634ccbeb618d124f2f0fdcff62894d82d"},"schema_version":"1.0","source":{"id":"2605.21829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21829","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21829v1","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21829","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"734YCCI5RYOY","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_16","alias_value":"734YCCI5RYOYHTJ3","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_8","alias_value":"734YCCI5","created_at":"2026-05-22T01:04:09Z"}],"graph_snapshots":[{"event_id":"sha256:aa17ad52b091a2d0d951dbc52f2e5a6022b7d2f0b4f5d5bd033cca9045956bf7","target":"graph","created_at":"2026-05-22T01:04:09Z","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/2605.21829/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use $\\Omega(n \\log n)$ queries.","authors_text":"Kirk Pruhs (university of Pittsburgh), Stephen Arndt (Carnegie Mellon University), Trung Tran (University of Pittsburgh)","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T23:51:30Z","title":"An $\\Omega(n \\log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21829","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:7c8434b7450e67bb50fb74973a3ec1976df1eb64eb096698d90318c9c32f3c77","target":"record","created_at":"2026-05-22T01:04:09Z","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":"5e8e084d788ff9686fd2a4f2b79c7f4ce0e68fb95baff9cfa7d54b6f919f2d13","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T23:51:30Z","title_canon_sha256":"fe694313da66d56c46a0e29891910b7634ccbeb618d124f2f0fdcff62894d82d"},"schema_version":"1.0","source":{"id":"2605.21829","kind":"arxiv","version":1}},"canonical_sha256":"fef981091d8e1d83cd3b9a2caeead9fd742f042cc157d00efd996dae5346af4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fef981091d8e1d83cd3b9a2caeead9fd742f042cc157d00efd996dae5346af4f","first_computed_at":"2026-05-22T01:04:09.829708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:09.829708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmY5NNHyA/sUPHYbp2kTY7bf1mbkY+DNURHXyF8gQ8Re1EeDcCJNX5Kq7m8ITvBwWQoRq8KZBMhtq4pfe7nlCw==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:09.830458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c8434b7450e67bb50fb74973a3ec1976df1eb64eb096698d90318c9c32f3c77","sha256:aa17ad52b091a2d0d951dbc52f2e5a6022b7d2f0b4f5d5bd033cca9045956bf7"],"state_sha256":"64b7463b9cc6c2cb0896f6533ce6f249f2c261daef4e41398fd41ca6f17a4d94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65peCCUMzDSBHqsG2ew/TYwfJt31UPeggvPBIjLu9hJUlhoHqaDFW9QBPJv6+BrcuHMbktUt5Ok7iCAEtdASCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:27:06.143797Z","bundle_sha256":"9c09daab477e8f91fb685ce7aa761900c5797e2e6fa667af49badc3345e631cf"}}