{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AJOJ2E5P4A7CPN36UW7CKCFLGO","short_pith_number":"pith:AJOJ2E5P","canonical_record":{"source":{"id":"1404.1732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T10:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"5af79f4d8c73837251c16881fa5888cee30cb92e7ef535427f93c6854bce7d21","abstract_canon_sha256":"05d0a5953fdf55a1b2e7f5cbf15bdb169e592a44a6635ca4950189e1bd4308b1"},"schema_version":"1.0"},"canonical_sha256":"025c9d13afe03e27b77ea5be2508ab33b0e1adb8bc081fb7df349a4633d2c487","source":{"kind":"arxiv","id":"1404.1732","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1732","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1732v2","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1732","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"AJOJ2E5P4A7C","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJOJ2E5P4A7CPN36","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJOJ2E5P","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AJOJ2E5P4A7CPN36UW7CKCFLGO","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T10:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"5af79f4d8c73837251c16881fa5888cee30cb92e7ef535427f93c6854bce7d21","abstract_canon_sha256":"05d0a5953fdf55a1b2e7f5cbf15bdb169e592a44a6635ca4950189e1bd4308b1"},"schema_version":"1.0"},"canonical_sha256":"025c9d13afe03e27b77ea5be2508ab33b0e1adb8bc081fb7df349a4633d2c487","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:17.112936Z","signature_b64":"X0Z4MDWr897qwxZi6uMoimIJoHRPguScVPsvOC3AkzNKQ26ajYYf15XB2vM9dK/j0sPWn6g8GiIs1AbYgCZWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025c9d13afe03e27b77ea5be2508ab33b0e1adb8bc081fb7df349a4633d2c487","last_reissued_at":"2026-05-18T02:48:17.112514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:17.112514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1732","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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBG7rjV8W01Y2VwnQhSGhkZW/0NUk9ZwevOCzd2ReaSVN1YXeeFcqDXkD51i/iFHn4Z3i87IFpMQzb1tds+9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:02:13.768587Z"},"content_sha256":"f8259c4c926882988a18af3ae310423db99f50da22550e0fe94109b3ff35b03a","schema_version":"1.0","event_id":"sha256:f8259c4c926882988a18af3ae310423db99f50da22550e0fe94109b3ff35b03a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AJOJ2E5P4A7CPN36UW7CKCFLGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Algorithms for Partitioning Integer Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Konrad, L\\'aszl\\'o Kozma","submitted_at":"2014-04-07T10:37:09Z","abstract_excerpt":"We study the problem of partitioning integer sequences in the one-pass data streaming model. Given is an input stream of integers $X \\in \\{0, 1, \\dots, m \\}^n$ of length $n$ with maximum element $m$, and a parameter $p$. The goal is to output the positions of separators splitting the input stream into $p$ contiguous blocks such that the maximal weight of a block is minimized. We show that computing an optimal solution requires linear space, and we design space efficient $(1+\\epsilon)$-approximation algorithms for this problem following the parametric search framework. We demonstrate that param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1732","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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Svcq2lh0Zto6Ig2fKFk6J0D6QWAG7yarCIhoGG52Y+SvtE6xexDPpv/fRPP9b/+Dfh8W0qqa9su3j3RmybhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:02:13.768936Z"},"content_sha256":"b632cec1992999d2a98b4e3bb55873e15aa6c7fdfc10797bd01fa05c5077b012","schema_version":"1.0","event_id":"sha256:b632cec1992999d2a98b4e3bb55873e15aa6c7fdfc10797bd01fa05c5077b012"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO/bundle.json","state_url":"https://pith.science/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO/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-05T16:02:13Z","links":{"resolver":"https://pith.science/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO","bundle":"https://pith.science/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO/bundle.json","state":"https://pith.science/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJOJ2E5P4A7CPN36UW7CKCFLGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AJOJ2E5P4A7CPN36UW7CKCFLGO","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":"05d0a5953fdf55a1b2e7f5cbf15bdb169e592a44a6635ca4950189e1bd4308b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T10:37:09Z","title_canon_sha256":"5af79f4d8c73837251c16881fa5888cee30cb92e7ef535427f93c6854bce7d21"},"schema_version":"1.0","source":{"id":"1404.1732","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1732","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1732v2","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1732","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"AJOJ2E5P4A7C","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJOJ2E5P4A7CPN36","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJOJ2E5P","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b632cec1992999d2a98b4e3bb55873e15aa6c7fdfc10797bd01fa05c5077b012","target":"graph","created_at":"2026-05-18T02:48:17Z","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 partitioning integer sequences in the one-pass data streaming model. Given is an input stream of integers $X \\in \\{0, 1, \\dots, m \\}^n$ of length $n$ with maximum element $m$, and a parameter $p$. The goal is to output the positions of separators splitting the input stream into $p$ contiguous blocks such that the maximal weight of a block is minimized. We show that computing an optimal solution requires linear space, and we design space efficient $(1+\\epsilon)$-approximation algorithms for this problem following the parametric search framework. We demonstrate that param","authors_text":"Christian Konrad, L\\'aszl\\'o Kozma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T10:37:09Z","title":"Streaming Algorithms for Partitioning Integer Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1732","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:f8259c4c926882988a18af3ae310423db99f50da22550e0fe94109b3ff35b03a","target":"record","created_at":"2026-05-18T02:48:17Z","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":"05d0a5953fdf55a1b2e7f5cbf15bdb169e592a44a6635ca4950189e1bd4308b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T10:37:09Z","title_canon_sha256":"5af79f4d8c73837251c16881fa5888cee30cb92e7ef535427f93c6854bce7d21"},"schema_version":"1.0","source":{"id":"1404.1732","kind":"arxiv","version":2}},"canonical_sha256":"025c9d13afe03e27b77ea5be2508ab33b0e1adb8bc081fb7df349a4633d2c487","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"025c9d13afe03e27b77ea5be2508ab33b0e1adb8bc081fb7df349a4633d2c487","first_computed_at":"2026-05-18T02:48:17.112514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:17.112514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X0Z4MDWr897qwxZi6uMoimIJoHRPguScVPsvOC3AkzNKQ26ajYYf15XB2vM9dK/j0sPWn6g8GiIs1AbYgCZWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:17.112936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1732","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8259c4c926882988a18af3ae310423db99f50da22550e0fe94109b3ff35b03a","sha256:b632cec1992999d2a98b4e3bb55873e15aa6c7fdfc10797bd01fa05c5077b012"],"state_sha256":"917614add631ee96aaeed4f59c023f7ef52ddd28351b39b927047ef8a974fb8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyEwmqH1ZFuhGkJGph3M1mF9apXRFGhNpuM+Yl/+m66aj9z2QoAM036PD32ZKSnX3X1gsX8Eg8CWLVvryNG1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:02:13.770959Z","bundle_sha256":"47508c21deed667262280c89b2ecc35dd4384139dba5e8012ca315199b7174b1"}}