{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AR4SYAQ73DOIAM5JUNS3JIXJPI","short_pith_number":"pith:AR4SYAQ7","canonical_record":{"source":{"id":"1309.3675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-14T14:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"78a45f96e2b29d08bafd82559145944c5b277f8de25c585f2eca23c14f65cd9c","abstract_canon_sha256":"544c1f55bc7afd12292c3116655bd43e1b580dd2b55cb88181fa23360d46a29a"},"schema_version":"1.0"},"canonical_sha256":"04792c021fd8dc8033a9a365b4a2e97a26117f664540356687b847d7d1097023","source":{"kind":"arxiv","id":"1309.3675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3675","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3675v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3675","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"AR4SYAQ73DOI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AR4SYAQ73DOIAM5J","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AR4SYAQ7","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AR4SYAQ73DOIAM5JUNS3JIXJPI","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-14T14:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"78a45f96e2b29d08bafd82559145944c5b277f8de25c585f2eca23c14f65cd9c","abstract_canon_sha256":"544c1f55bc7afd12292c3116655bd43e1b580dd2b55cb88181fa23360d46a29a"},"schema_version":"1.0"},"canonical_sha256":"04792c021fd8dc8033a9a365b4a2e97a26117f664540356687b847d7d1097023","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.778904Z","signature_b64":"ACPMHeG4w1YtkLC8iUlYvXR1rw2qWq/Slh6i6ABGBWvFuUeEImRhfl5BuKdovSpyR9tBREHYYyvfs9PiQphPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04792c021fd8dc8033a9a365b4a2e97a26117f664540356687b847d7d1097023","last_reissued_at":"2026-05-18T03:13:20.778422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.778422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3675","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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x492+AU7+WGcNTr8KhZP2W6VBW1a1KD7Im3AJh0DbuuyC+PVrp8bcZQoK4REyrdDDQgqt2dwgj8Yb+KOSJ10Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:36:54.324648Z"},"content_sha256":"7c259f6b2d154c9d85b10353140e9665aacedb164830cfe9d50dc43c88804385","schema_version":"1.0","event_id":"sha256:7c259f6b2d154c9d85b10353140e9665aacedb164830cfe9d50dc43c88804385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AR4SYAQ73DOIAM5JUNS3JIXJPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maxim Sviridenko, Sungjin Im","submitted_at":"2013-09-14T14:34:48Z","abstract_excerpt":"We consider the pull-based broadcast scheduling model. In this model, there are n unit-sized pages of information available at the server. Requests arrive over time at the server asking for a specific page. When the server transmits a page, all outstanding requests for the page are simultaneously satisfied, and this is what distinguishes broadcast scheduling from the standard scheduling setting where each job must be processed separately by the server. Broadcast scheduling has received a considerable amount of attention due to the algorithmic challenges that it gives in addition to its applica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3675","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":""},"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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"de3bPr9UHvi3hkXHNmVZb1a6hwMRjkWJ52G+a4wCg98F2hMFPnC+vPVK+BQQ9LKGEHj9evnKXUfz50MlDNO6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:36:54.324977Z"},"content_sha256":"e31e7fd427fa54010a1e1f66ce898b3c27b36fca0a0877138264ebcb265ea467","schema_version":"1.0","event_id":"sha256:e31e7fd427fa54010a1e1f66ce898b3c27b36fca0a0877138264ebcb265ea467"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI/bundle.json","state_url":"https://pith.science/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI/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-27T19:36:54Z","links":{"resolver":"https://pith.science/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI","bundle":"https://pith.science/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI/bundle.json","state":"https://pith.science/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR4SYAQ73DOIAM5JUNS3JIXJPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AR4SYAQ73DOIAM5JUNS3JIXJPI","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":"544c1f55bc7afd12292c3116655bd43e1b580dd2b55cb88181fa23360d46a29a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-14T14:34:48Z","title_canon_sha256":"78a45f96e2b29d08bafd82559145944c5b277f8de25c585f2eca23c14f65cd9c"},"schema_version":"1.0","source":{"id":"1309.3675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3675","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3675v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3675","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"AR4SYAQ73DOI","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AR4SYAQ73DOIAM5J","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AR4SYAQ7","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:e31e7fd427fa54010a1e1f66ce898b3c27b36fca0a0877138264ebcb265ea467","target":"graph","created_at":"2026-05-18T03:13:20Z","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 consider the pull-based broadcast scheduling model. In this model, there are n unit-sized pages of information available at the server. Requests arrive over time at the server asking for a specific page. When the server transmits a page, all outstanding requests for the page are simultaneously satisfied, and this is what distinguishes broadcast scheduling from the standard scheduling setting where each job must be processed separately by the server. Broadcast scheduling has received a considerable amount of attention due to the algorithmic challenges that it gives in addition to its applica","authors_text":"Maxim Sviridenko, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-14T14:34:48Z","title":"Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3675","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:7c259f6b2d154c9d85b10353140e9665aacedb164830cfe9d50dc43c88804385","target":"record","created_at":"2026-05-18T03:13:20Z","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":"544c1f55bc7afd12292c3116655bd43e1b580dd2b55cb88181fa23360d46a29a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-14T14:34:48Z","title_canon_sha256":"78a45f96e2b29d08bafd82559145944c5b277f8de25c585f2eca23c14f65cd9c"},"schema_version":"1.0","source":{"id":"1309.3675","kind":"arxiv","version":1}},"canonical_sha256":"04792c021fd8dc8033a9a365b4a2e97a26117f664540356687b847d7d1097023","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04792c021fd8dc8033a9a365b4a2e97a26117f664540356687b847d7d1097023","first_computed_at":"2026-05-18T03:13:20.778422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:20.778422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ACPMHeG4w1YtkLC8iUlYvXR1rw2qWq/Slh6i6ABGBWvFuUeEImRhfl5BuKdovSpyR9tBREHYYyvfs9PiQphPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:20.778904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c259f6b2d154c9d85b10353140e9665aacedb164830cfe9d50dc43c88804385","sha256:e31e7fd427fa54010a1e1f66ce898b3c27b36fca0a0877138264ebcb265ea467"],"state_sha256":"98e251926b3f7859d3a44104ccf338be52a5d7e7a5f9e626936db94a76441861"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drwHyPiB58CmAMeK+LUohE6cfokWlminhgUsoMcWazfL2DYARwzfpoLO61NZLkTA+m8AnHruyzGW8kL9yfnPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:36:54.326760Z","bundle_sha256":"3ff74b80821e24ce1e75a61165d0cbf329d2dc4f4238a4e8afe73353a48a1362"}}