{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OK4ZTO5KYV32LX7DOQRZG5C4K7","short_pith_number":"pith:OK4ZTO5K","canonical_record":{"source":{"id":"1211.2670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"3971680d33138f19011d6cd892093e275b0d552d882b1fa8a7148c631f9479ae","abstract_canon_sha256":"02f7cd02a666d6371d124b4d96400f598588b5e80f367dfb526e45fdafb222a2"},"schema_version":"1.0"},"canonical_sha256":"72b999bbaac577a5dfe3742393745c57e67f903e61b95a331612756cd02b5297","source":{"kind":"arxiv","id":"1211.2670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2670","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2670v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2670","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"OK4ZTO5KYV32","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OK4ZTO5KYV32LX7D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OK4ZTO5K","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OK4ZTO5KYV32LX7DOQRZG5C4K7","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"3971680d33138f19011d6cd892093e275b0d552d882b1fa8a7148c631f9479ae","abstract_canon_sha256":"02f7cd02a666d6371d124b4d96400f598588b5e80f367dfb526e45fdafb222a2"},"schema_version":"1.0"},"canonical_sha256":"72b999bbaac577a5dfe3742393745c57e67f903e61b95a331612756cd02b5297","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.126175Z","signature_b64":"6AdqJ/TbiTArA+G4xAIGIXnBq2spgHZmDgzhgT/ZfgMWxfyM0shk7Qj7qo+SXmUqTGMtyWBCNeaURtDRowOqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72b999bbaac577a5dfe3742393745c57e67f903e61b95a331612756cd02b5297","last_reissued_at":"2026-05-18T03:41:02.125478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.125478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2670","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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTNftE86vjgq2bpheRbupIVCjYFAlVFp8T0MaXAT9qbjd1masZGJQBNMc6X2WoaWJF3GIs5nXXBv/wjq2hthAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:47:29.197363Z"},"content_sha256":"84075ffe3ddb0edd57493de81be45e357fdbf2015354d3f9b4203605db03dbf7","schema_version":"1.0","event_id":"sha256:84075ffe3ddb0edd57493de81be45e357fdbf2015354d3f9b4203605db03dbf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OK4ZTO5KYV32LX7DOQRZG5C4K7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Mazing 2+eps Approximation for Unsplittable Flow on a Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi","submitted_at":"2012-11-12T15:56:03Z","abstract_excerpt":"We study the unsplittable flow on a path problem (UFP) where we are given a path with non-negative edge capacities and tasks, which are characterized by a subpath, a demand, and a profit. The goal is to find the most profitable subset of tasks whose total demand does not violate the edge capacities. This problem naturally arises in many settings such as bandwidth allocation, resource constrained scheduling, and interval packing.\n  A natural task classification defines the size of a task i to be the ratio delta between the demand of i and the minimum capacity of any edge used by i. If all tasks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2670","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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqrcv+Z1NN4QQ/t6HOr0GqgdsWmhNlc/A+YuW159JICUv0uy+4iTDmVseMQYQEPlzHBEGPp+QqB3GHJuxYWwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:47:29.198105Z"},"content_sha256":"fcacbcdc903602fd644948871ae3dbc7b33d21553eb18e68f03a8110c14ab6c3","schema_version":"1.0","event_id":"sha256:fcacbcdc903602fd644948871ae3dbc7b33d21553eb18e68f03a8110c14ab6c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7/bundle.json","state_url":"https://pith.science/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7/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-25T02:47:29Z","links":{"resolver":"https://pith.science/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7","bundle":"https://pith.science/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7/bundle.json","state":"https://pith.science/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OK4ZTO5KYV32LX7DOQRZG5C4K7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OK4ZTO5KYV32LX7DOQRZG5C4K7","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":"02f7cd02a666d6371d124b4d96400f598588b5e80f367dfb526e45fdafb222a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:56:03Z","title_canon_sha256":"3971680d33138f19011d6cd892093e275b0d552d882b1fa8a7148c631f9479ae"},"schema_version":"1.0","source":{"id":"1211.2670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2670","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2670v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2670","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"OK4ZTO5KYV32","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OK4ZTO5KYV32LX7D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OK4ZTO5K","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:fcacbcdc903602fd644948871ae3dbc7b33d21553eb18e68f03a8110c14ab6c3","target":"graph","created_at":"2026-05-18T03:41:02Z","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 study the unsplittable flow on a path problem (UFP) where we are given a path with non-negative edge capacities and tasks, which are characterized by a subpath, a demand, and a profit. The goal is to find the most profitable subset of tasks whose total demand does not violate the edge capacities. This problem naturally arises in many settings such as bandwidth allocation, resource constrained scheduling, and interval packing.\n  A natural task classification defines the size of a task i to be the ratio delta between the demand of i and the minimum capacity of any edge used by i. If all tasks","authors_text":"Andreas Wiese, Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:56:03Z","title":"A Mazing 2+eps Approximation for Unsplittable Flow on a Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2670","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:84075ffe3ddb0edd57493de81be45e357fdbf2015354d3f9b4203605db03dbf7","target":"record","created_at":"2026-05-18T03:41:02Z","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":"02f7cd02a666d6371d124b4d96400f598588b5e80f367dfb526e45fdafb222a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:56:03Z","title_canon_sha256":"3971680d33138f19011d6cd892093e275b0d552d882b1fa8a7148c631f9479ae"},"schema_version":"1.0","source":{"id":"1211.2670","kind":"arxiv","version":1}},"canonical_sha256":"72b999bbaac577a5dfe3742393745c57e67f903e61b95a331612756cd02b5297","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72b999bbaac577a5dfe3742393745c57e67f903e61b95a331612756cd02b5297","first_computed_at":"2026-05-18T03:41:02.125478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:02.125478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6AdqJ/TbiTArA+G4xAIGIXnBq2spgHZmDgzhgT/ZfgMWxfyM0shk7Qj7qo+SXmUqTGMtyWBCNeaURtDRowOqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:02.126175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84075ffe3ddb0edd57493de81be45e357fdbf2015354d3f9b4203605db03dbf7","sha256:fcacbcdc903602fd644948871ae3dbc7b33d21553eb18e68f03a8110c14ab6c3"],"state_sha256":"bba930f9ba056a24145f367ce550137a2c94c3e1344c03283f4d56b610464356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XOsZJDkagL6mvnOZGr3eHIXT66gmCiM+N3MCfolVNZmJGTAaMvWUgXj3v42xd1tXiIdnqf14rC6bsPwrPqYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:47:29.201935Z","bundle_sha256":"32f9bb4ecddc41ab53094d585ca7fb349d0a54b9ce01c4821da73cec226b3570"}}