{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:V7AHLJ5KYSYICSNKWMEUY2VCH2","short_pith_number":"pith:V7AHLJ5K","schema_version":"1.0","canonical_sha256":"afc075a7aac4b08149aab3094c6aa23e8c93f2b21bc5df61658b4c98605786a3","source":{"kind":"arxiv","id":"1102.3643","version":2},"attestation_state":"computed","paper":{"title":"A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Jens Schulz, Paul Bonsma","submitted_at":"2011-02-17T17:43:08Z","abstract_excerpt":"In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge $e$ of $P$, the total demand of selected tasks that use $e$ does not exceed the capacity of $e$. This is a well-studied problem that has been studied under alternative names, such as resource allocation, bandwidth allocation, resource constrained scheduling, temporal knapsack and interval packing.\n  We present a polynomial time constant-factor approximation al"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1102.3643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T17:43:08Z","cross_cats_sorted":[],"title_canon_sha256":"175ff76fc45fba57dfebef876c52e674c68bee0cde778ff21e6f17ccda94ea1d","abstract_canon_sha256":"b53849040b738ab271d0604b69ce5fcec23af7e89096ec164d7a2553ac167f75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.498496Z","signature_b64":"FPtWL0ts2eIzrIwk54QGwBMR9wKgzq4BnoauXVho2q2xhvuJgl+8Oe02gp+FGDqod+8BPvqz6akZ+kFKbwyfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afc075a7aac4b08149aab3094c6aa23e8c93f2b21bc5df61658b4c98605786a3","last_reissued_at":"2026-05-18T02:22:31.498021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.498021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Jens Schulz, Paul Bonsma","submitted_at":"2011-02-17T17:43:08Z","abstract_excerpt":"In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge $e$ of $P$, the total demand of selected tasks that use $e$ does not exceed the capacity of $e$. This is a well-studied problem that has been studied under alternative names, such as resource allocation, bandwidth allocation, resource constrained scheduling, temporal knapsack and interval packing.\n  We present a polynomial time constant-factor approximation al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3643","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.3643","created_at":"2026-05-18T02:22:31.498096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3643v2","created_at":"2026-05-18T02:22:31.498096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3643","created_at":"2026-05-18T02:22:31.498096+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7AHLJ5KYSYI","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7AHLJ5KYSYICSNK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7AHLJ5K","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2","json":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2.json","graph_json":"https://pith.science/api/pith-number/V7AHLJ5KYSYICSNKWMEUY2VCH2/graph.json","events_json":"https://pith.science/api/pith-number/V7AHLJ5KYSYICSNKWMEUY2VCH2/events.json","paper":"https://pith.science/paper/V7AHLJ5K"},"agent_actions":{"view_html":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2","download_json":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2.json","view_paper":"https://pith.science/paper/V7AHLJ5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3643&json=true","fetch_graph":"https://pith.science/api/pith-number/V7AHLJ5KYSYICSNKWMEUY2VCH2/graph.json","fetch_events":"https://pith.science/api/pith-number/V7AHLJ5KYSYICSNKWMEUY2VCH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/action/storage_attestation","attest_author":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/action/author_attestation","sign_citation":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/action/citation_signature","submit_replication":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/action/replication_record"}},"created_at":"2026-05-18T02:22:31.498096+00:00","updated_at":"2026-05-18T02:22:31.498096+00:00"}