{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4APJPIXAIROOQ5FLNHWIPOBQ54","short_pith_number":"pith:4APJPIXA","canonical_record":{"source":{"id":"1507.02378","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"928ad4266f44540fd05ce7669f9be9a4835f7849438f50046d5f696037af250d","abstract_canon_sha256":"96188a9bbb5527c737b8a45cc3b581584bb8eebd1720ae1f75f644271209ce61"},"schema_version":"1.0"},"canonical_sha256":"e01e97a2e0445ce874ab69ec87b830ef212c574b105719b4c86ae5690e3f88e3","source":{"kind":"arxiv","id":"1507.02378","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02378","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02378v3","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02378","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"4APJPIXAIROO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4APJPIXAIROOQ5FL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4APJPIXA","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4APJPIXAIROOQ5FLNHWIPOBQ54","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02378","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"928ad4266f44540fd05ce7669f9be9a4835f7849438f50046d5f696037af250d","abstract_canon_sha256":"96188a9bbb5527c737b8a45cc3b581584bb8eebd1720ae1f75f644271209ce61"},"schema_version":"1.0"},"canonical_sha256":"e01e97a2e0445ce874ab69ec87b830ef212c574b105719b4c86ae5690e3f88e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:51.282063Z","signature_b64":"mp3qj1igF2TBtSHMxz0mRUctTaHsxo6u1sBfqNyh2uDP8gycgKAvXk4lpFPRKjO34T51knMBQ5g1kdxFZMt/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01e97a2e0445ce874ab69ec87b830ef212c574b105719b4c86ae5690e3f88e3","last_reissued_at":"2026-05-18T00:53:51.281660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:51.281660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02378","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:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lh/2fImf3cqZH0LuIw/p7slbV6tayBdSYZF8A5EInPU4eXKyBfi7R8NSVIqk0LCWLIsj9uWojByDtmIhJK4aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:48:38.296073Z"},"content_sha256":"219312952df0476840acfd09c49200536bf12536bb877705a653aae238134dcf","schema_version":"1.0","event_id":"sha256:219312952df0476840acfd09c49200536bf12536bb877705a653aae238134dcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4APJPIXAIROOQ5FLNHWIPOBQ54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Algorithms for Multi-Level Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph D\\\"urr, Jaroslaw Byrka, Ji\\v{r}\\'i Sgall, {\\L}ukasz Je\\.z, Luk\\'a\\v{s} Folwarczn\\'y, Marcin Bienkowski, Marek Chrobak, Martin B\\\"ohm, Nguyen Kim Thang, Pavel Vesel\\'y","submitted_at":"2015-07-09T05:01:37Z","abstract_excerpt":"In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival and service times. The objective is to minimize the total waiting cost of all requests plus the total cost of all service subtrees. MLAP is a generalization of some well-studied optimization problems; for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02378","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:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsJtwZUIfqsETbtaPyVj1X/i1p2JVRAGEUIt6dmGjxpQJfJvBK1HJxvg8l+1bw8rdtX2jHdBXVg7Ou2PhgbeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:48:38.296439Z"},"content_sha256":"f79927d2fc01610890d42159d492ce1bf96483eafb874671bc33c4f0ccd597d4","schema_version":"1.0","event_id":"sha256:f79927d2fc01610890d42159d492ce1bf96483eafb874671bc33c4f0ccd597d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4APJPIXAIROOQ5FLNHWIPOBQ54/bundle.json","state_url":"https://pith.science/pith/4APJPIXAIROOQ5FLNHWIPOBQ54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4APJPIXAIROOQ5FLNHWIPOBQ54/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-27T08:48:38Z","links":{"resolver":"https://pith.science/pith/4APJPIXAIROOQ5FLNHWIPOBQ54","bundle":"https://pith.science/pith/4APJPIXAIROOQ5FLNHWIPOBQ54/bundle.json","state":"https://pith.science/pith/4APJPIXAIROOQ5FLNHWIPOBQ54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4APJPIXAIROOQ5FLNHWIPOBQ54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4APJPIXAIROOQ5FLNHWIPOBQ54","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":"96188a9bbb5527c737b8a45cc3b581584bb8eebd1720ae1f75f644271209ce61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:01:37Z","title_canon_sha256":"928ad4266f44540fd05ce7669f9be9a4835f7849438f50046d5f696037af250d"},"schema_version":"1.0","source":{"id":"1507.02378","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02378","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02378v3","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02378","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"4APJPIXAIROO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4APJPIXAIROOQ5FL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4APJPIXA","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:f79927d2fc01610890d42159d492ce1bf96483eafb874671bc33c4f0ccd597d4","target":"graph","created_at":"2026-05-18T00:53:51Z","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":"In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival and service times. The objective is to minimize the total waiting cost of all requests plus the total cost of all service subtrees. MLAP is a generalization of some well-studied optimization problems; for","authors_text":"Christoph D\\\"urr, Jaroslaw Byrka, Ji\\v{r}\\'i Sgall, {\\L}ukasz Je\\.z, Luk\\'a\\v{s} Folwarczn\\'y, Marcin Bienkowski, Marek Chrobak, Martin B\\\"ohm, Nguyen Kim Thang, Pavel Vesel\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:01:37Z","title":"Online Algorithms for Multi-Level Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02378","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:219312952df0476840acfd09c49200536bf12536bb877705a653aae238134dcf","target":"record","created_at":"2026-05-18T00:53:51Z","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":"96188a9bbb5527c737b8a45cc3b581584bb8eebd1720ae1f75f644271209ce61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T05:01:37Z","title_canon_sha256":"928ad4266f44540fd05ce7669f9be9a4835f7849438f50046d5f696037af250d"},"schema_version":"1.0","source":{"id":"1507.02378","kind":"arxiv","version":3}},"canonical_sha256":"e01e97a2e0445ce874ab69ec87b830ef212c574b105719b4c86ae5690e3f88e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e01e97a2e0445ce874ab69ec87b830ef212c574b105719b4c86ae5690e3f88e3","first_computed_at":"2026-05-18T00:53:51.281660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:51.281660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mp3qj1igF2TBtSHMxz0mRUctTaHsxo6u1sBfqNyh2uDP8gycgKAvXk4lpFPRKjO34T51knMBQ5g1kdxFZMt/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:51.282063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02378","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:219312952df0476840acfd09c49200536bf12536bb877705a653aae238134dcf","sha256:f79927d2fc01610890d42159d492ce1bf96483eafb874671bc33c4f0ccd597d4"],"state_sha256":"5d1fb217cb01903118c8d9e6639910949ddf1203e884ab980bd910c33757b842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBo/CpW79pl/2Gmbw2seA6T5rgerPIgisfVMhUsj8pgNjF8rEITOAAbhbMpNybcZuFBtp06k4X5lzxsNXdHfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:48:38.298691Z","bundle_sha256":"24c68c6bdb5bc00b0d6c34b9f5ff9cda48f9e3246d70d6ef9c73f1c965acbfe4"}}