{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UHNNW5G624ZYM37EKH62U26N3R","short_pith_number":"pith:UHNNW5G6","canonical_record":{"source":{"id":"1708.00143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T02:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"6950d79026a025031904f08bd89f8f57afce9358ae73f305b1b70deb97f654c4","abstract_canon_sha256":"6eb808fe37a67bd18d86ebb41ec3715ddfe49d007e72e4e2d018098aec656810"},"schema_version":"1.0"},"canonical_sha256":"a1dadb74ded733866fe451fdaa6bcddc733733d00f0df705943ba256ec11233c","source":{"kind":"arxiv","id":"1708.00143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00143","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00143v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00143","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"UHNNW5G624ZY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHNNW5G624ZYM37E","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHNNW5G6","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UHNNW5G624ZYM37EKH62U26N3R","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T02:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"6950d79026a025031904f08bd89f8f57afce9358ae73f305b1b70deb97f654c4","abstract_canon_sha256":"6eb808fe37a67bd18d86ebb41ec3715ddfe49d007e72e4e2d018098aec656810"},"schema_version":"1.0"},"canonical_sha256":"a1dadb74ded733866fe451fdaa6bcddc733733d00f0df705943ba256ec11233c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:05.941255Z","signature_b64":"DH7OP2AYoO492JnCrri2cQOcczbkr7JweFNhbWUCKiP1Xmg9RG/JwPTAbQ1o1L0g7J9yfX6GcKz4IxnX1BIpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1dadb74ded733866fe451fdaa6bcddc733733d00f0df705943ba256ec11233c","last_reissued_at":"2026-05-18T00:39:05.940574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:05.940574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00143","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-18T00:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQUSt4r7ZlAKSOrebGipQe+G5nk6IYwolG/rBg82hgRDUQSn5F0DN9j/j+5Dhk5Y3trxO8FMKhdBPrLNBcRODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:36:00.954965Z"},"content_sha256":"da7620b4d7fc209e2c88c8579805e359361194484459e826a9ef722e35e95b21","schema_version":"1.0","event_id":"sha256:da7620b4d7fc209e2c88c8579805e359361194484459e826a9ef722e35e95b21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UHNNW5G624ZYM37EKH62U26N3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Scheduling Unsplittable Flows on Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erez Kantor, Hamidreza Jahanjou, Rajmohan Rajaraman","submitted_at":"2017-08-01T02:57:43Z","abstract_excerpt":"In this paper, we investigate offline and online algorithms for rufpp, the problem of minimizing the number of rounds required to schedule a set of unsplittable flows of non-uniform sizes on a given path with non-uniform edge capacities. rufpp is NP-hard and constant-factor approximation algorithms are known under the no bottleneck assumption (NBA), which stipulates that maximum size of a flow is at most the minimum edge capacity. We study rufpp without the NBA, and present improved online and offline algorithms. We first study offline rufpp for a restricted class of instances called $\\alpha$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00143","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-18T00:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9IFSEJicuM0WmLVD185SzA5kVfbAvf8g/07MnVHsEhamShYY5V4SxtwxXXgtOrNJu6w3VTgzFeZL+pNyryPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:36:00.955358Z"},"content_sha256":"74ea9d3635b7f6adc56744369b672f7928c98f0e23edfc2443cd72fcb5b32ab4","schema_version":"1.0","event_id":"sha256:74ea9d3635b7f6adc56744369b672f7928c98f0e23edfc2443cd72fcb5b32ab4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHNNW5G624ZYM37EKH62U26N3R/bundle.json","state_url":"https://pith.science/pith/UHNNW5G624ZYM37EKH62U26N3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHNNW5G624ZYM37EKH62U26N3R/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-09T13:36:00Z","links":{"resolver":"https://pith.science/pith/UHNNW5G624ZYM37EKH62U26N3R","bundle":"https://pith.science/pith/UHNNW5G624ZYM37EKH62U26N3R/bundle.json","state":"https://pith.science/pith/UHNNW5G624ZYM37EKH62U26N3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHNNW5G624ZYM37EKH62U26N3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UHNNW5G624ZYM37EKH62U26N3R","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":"6eb808fe37a67bd18d86ebb41ec3715ddfe49d007e72e4e2d018098aec656810","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T02:57:43Z","title_canon_sha256":"6950d79026a025031904f08bd89f8f57afce9358ae73f305b1b70deb97f654c4"},"schema_version":"1.0","source":{"id":"1708.00143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00143","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00143v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00143","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"UHNNW5G624ZY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHNNW5G624ZYM37E","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHNNW5G6","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:74ea9d3635b7f6adc56744369b672f7928c98f0e23edfc2443cd72fcb5b32ab4","target":"graph","created_at":"2026-05-18T00:39:05Z","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 this paper, we investigate offline and online algorithms for rufpp, the problem of minimizing the number of rounds required to schedule a set of unsplittable flows of non-uniform sizes on a given path with non-uniform edge capacities. rufpp is NP-hard and constant-factor approximation algorithms are known under the no bottleneck assumption (NBA), which stipulates that maximum size of a flow is at most the minimum edge capacity. We study rufpp without the NBA, and present improved online and offline algorithms. We first study offline rufpp for a restricted class of instances called $\\alpha$-","authors_text":"Erez Kantor, Hamidreza Jahanjou, Rajmohan Rajaraman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T02:57:43Z","title":"Improved Algorithms for Scheduling Unsplittable Flows on Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00143","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:da7620b4d7fc209e2c88c8579805e359361194484459e826a9ef722e35e95b21","target":"record","created_at":"2026-05-18T00:39:05Z","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":"6eb808fe37a67bd18d86ebb41ec3715ddfe49d007e72e4e2d018098aec656810","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T02:57:43Z","title_canon_sha256":"6950d79026a025031904f08bd89f8f57afce9358ae73f305b1b70deb97f654c4"},"schema_version":"1.0","source":{"id":"1708.00143","kind":"arxiv","version":1}},"canonical_sha256":"a1dadb74ded733866fe451fdaa6bcddc733733d00f0df705943ba256ec11233c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1dadb74ded733866fe451fdaa6bcddc733733d00f0df705943ba256ec11233c","first_computed_at":"2026-05-18T00:39:05.940574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:05.940574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DH7OP2AYoO492JnCrri2cQOcczbkr7JweFNhbWUCKiP1Xmg9RG/JwPTAbQ1o1L0g7J9yfX6GcKz4IxnX1BIpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:05.941255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da7620b4d7fc209e2c88c8579805e359361194484459e826a9ef722e35e95b21","sha256:74ea9d3635b7f6adc56744369b672f7928c98f0e23edfc2443cd72fcb5b32ab4"],"state_sha256":"543fd4a91b57adfa7139985517dfc13eb419651c1c5c345afcb47f5de76f101d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXZN+yOWprG4/hehV14n5GJNG7fBCLhl/2nO3qWUdtRQWogUc39B3xAUJKKlXnx+45/s49YLB9pUt/82TROCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:36:00.957303Z","bundle_sha256":"c73abeb228fd1cde9eedc9b579024d1438fdabd15cdb59166cf8eb2cd5dcd4bb"}}