{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:V7AHLJ5KYSYICSNKWMEUY2VCH2","short_pith_number":"pith:V7AHLJ5K","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"},"canonical_sha256":"afc075a7aac4b08149aab3094c6aa23e8c93f2b21bc5df61658b4c98605786a3","source":{"kind":"arxiv","id":"1102.3643","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3643","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3643v2","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3643","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"V7AHLJ5KYSYI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V7AHLJ5KYSYICSNK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V7AHLJ5K","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:V7AHLJ5KYSYICSNKWMEUY2VCH2","target":"record","payload":{"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"},"canonical_sha256":"afc075a7aac4b08149aab3094c6aa23e8c93f2b21bc5df61658b4c98605786a3","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"},"source_kind":"arxiv","source_id":"1102.3643","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:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPD1iyLXZnoAn3LAOInBDwa2VLFib6i8QzbcxATwB612Znea9wVB5Iin/orKVXSoexwVmiPdVkJkKEP7n2LeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:43:12.852587Z"},"content_sha256":"17dab0f14463f361187e146505b75944d65c5315813a0eb144f36261edc4d011","schema_version":"1.0","event_id":"sha256:17dab0f14463f361187e146505b75944d65c5315813a0eb144f36261edc4d011"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:V7AHLJ5KYSYICSNKWMEUY2VCH2","target":"graph","payload":{"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"},"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:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7hBeJnKmdl0TZ9ED22I5ffByxGJunKMSerAD2NWoAMvFQ9273cilGvWGRw2L7jDuO8mxoARoTlHBkMYrVn+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:43:12.853404Z"},"content_sha256":"49fec31194f48fb26a31977e6d149905947e4fca44e8cd2b2fc74d19653f03ab","schema_version":"1.0","event_id":"sha256:49fec31194f48fb26a31977e6d149905947e4fca44e8cd2b2fc74d19653f03ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/bundle.json","state_url":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/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-28T22:43:12Z","links":{"resolver":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2","bundle":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/bundle.json","state":"https://pith.science/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7AHLJ5KYSYICSNKWMEUY2VCH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:V7AHLJ5KYSYICSNKWMEUY2VCH2","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":"b53849040b738ab271d0604b69ce5fcec23af7e89096ec164d7a2553ac167f75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T17:43:08Z","title_canon_sha256":"175ff76fc45fba57dfebef876c52e674c68bee0cde778ff21e6f17ccda94ea1d"},"schema_version":"1.0","source":{"id":"1102.3643","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3643","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3643v2","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3643","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"V7AHLJ5KYSYI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V7AHLJ5KYSYICSNK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V7AHLJ5K","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:49fec31194f48fb26a31977e6d149905947e4fca44e8cd2b2fc74d19653f03ab","target":"graph","created_at":"2026-05-18T02:22:31Z","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 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","authors_text":"Andreas Wiese, Jens Schulz, Paul Bonsma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T17:43:08Z","title":"A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3643","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:17dab0f14463f361187e146505b75944d65c5315813a0eb144f36261edc4d011","target":"record","created_at":"2026-05-18T02:22:31Z","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":"b53849040b738ab271d0604b69ce5fcec23af7e89096ec164d7a2553ac167f75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T17:43:08Z","title_canon_sha256":"175ff76fc45fba57dfebef876c52e674c68bee0cde778ff21e6f17ccda94ea1d"},"schema_version":"1.0","source":{"id":"1102.3643","kind":"arxiv","version":2}},"canonical_sha256":"afc075a7aac4b08149aab3094c6aa23e8c93f2b21bc5df61658b4c98605786a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afc075a7aac4b08149aab3094c6aa23e8c93f2b21bc5df61658b4c98605786a3","first_computed_at":"2026-05-18T02:22:31.498021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:31.498021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPtWL0ts2eIzrIwk54QGwBMR9wKgzq4BnoauXVho2q2xhvuJgl+8Oe02gp+FGDqod+8BPvqz6akZ+kFKbwyfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:31.498496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3643","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17dab0f14463f361187e146505b75944d65c5315813a0eb144f36261edc4d011","sha256:49fec31194f48fb26a31977e6d149905947e4fca44e8cd2b2fc74d19653f03ab"],"state_sha256":"63621c86675f280157c301683665565cd5098b9277646053cb3e201ca8ecbe70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1hQ3ZtiexAWcgEiJNaauftTrH6eOQPm1Y0ziXntMmCX8/0ZN73s+VKQpErzFvYBzp5AfC2BS71fdr6S1tKZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:43:12.857370Z","bundle_sha256":"8fb122f2449767398dc60dc04e13e496924fe04cfc100567947a2b465ce758bd"}}