{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HMDF2O7D47R6ACHGH6URNRIGLN","short_pith_number":"pith:HMDF2O7D","canonical_record":{"source":{"id":"1504.00627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T17:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"75cce761f54895983e06655146cb45a80d4b48b028e3b7d61e25fa00edc1f32b","abstract_canon_sha256":"0d8db749f57d21d3960d97bb1148936fdc921e2eaef57a22892dac7aff2aacbb"},"schema_version":"1.0"},"canonical_sha256":"3b065d3be3e7e3e008e63fa916c5065b6bb37e3803051b516db0d8796725678e","source":{"kind":"arxiv","id":"1504.00627","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00627","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00627v2","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00627","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"HMDF2O7D47R6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HMDF2O7D47R6ACHG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HMDF2O7D","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HMDF2O7D47R6ACHGH6URNRIGLN","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T17:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"75cce761f54895983e06655146cb45a80d4b48b028e3b7d61e25fa00edc1f32b","abstract_canon_sha256":"0d8db749f57d21d3960d97bb1148936fdc921e2eaef57a22892dac7aff2aacbb"},"schema_version":"1.0"},"canonical_sha256":"3b065d3be3e7e3e008e63fa916c5065b6bb37e3803051b516db0d8796725678e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:41.074405Z","signature_b64":"LVgF9w5OF4T0i3Ws3puQlMxfgXTzHsVbGTTsv+T/aN2tPNCkMegHBzce2w7/T5G4kJ+LQruLe6XbaXtSy8cfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b065d3be3e7e3e008e63fa916c5065b6bb37e3803051b516db0d8796725678e","last_reissued_at":"2026-05-18T02:09:41.073697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:41.073697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00627","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:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZQgxeWXTS/zxKXd6X7P2VizlieVC00IJFPfN0YZI0HKvt8zmh1w6PUykC696oKeLsMPcfCc+mbUS3YZvBoJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:08:31.881397Z"},"content_sha256":"a59a87080066fa88fcbbaf5b8e13a6db4c2169aea96d25990439fdf1087c986d","schema_version":"1.0","event_id":"sha256:a59a87080066fa88fcbbaf5b8e13a6db4c2169aea96d25990439fdf1087c986d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HMDF2O7D47R6ACHGH6URNRIGLN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Vetta, F. Bruce Shepherd","submitted_at":"2015-04-02T17:55:03Z","abstract_excerpt":"We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node $t$ and a set of demands that we want to send to the sink. Here demand $i$ is located at a node $s_i$ and requests an amount $d_i$ of flow capacity in order to route successfully. Two standard objectives are to maximise (i) the number of demands (cardinality) and (ii) the total demand (throughput) that can be routed subject to the capacity constraints. Furthermore, we examine these maximisation problems for three specialised types of network flow: unsplittable, confl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00627","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:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cq+E5GvcwCz2S7smrRdmQkrqnnhTkYY739T81wYtTMctV9YCDyJkBtgzrM73ZIwWgnWJXfAtBy8KDHhgpd2zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:08:31.882115Z"},"content_sha256":"30d090acf5be017fe8c0991bedda1de32521e71dbaac8129fb4ddef44855545d","schema_version":"1.0","event_id":"sha256:30d090acf5be017fe8c0991bedda1de32521e71dbaac8129fb4ddef44855545d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMDF2O7D47R6ACHGH6URNRIGLN/bundle.json","state_url":"https://pith.science/pith/HMDF2O7D47R6ACHGH6URNRIGLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMDF2O7D47R6ACHGH6URNRIGLN/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-27T08:08:31Z","links":{"resolver":"https://pith.science/pith/HMDF2O7D47R6ACHGH6URNRIGLN","bundle":"https://pith.science/pith/HMDF2O7D47R6ACHGH6URNRIGLN/bundle.json","state":"https://pith.science/pith/HMDF2O7D47R6ACHGH6URNRIGLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMDF2O7D47R6ACHGH6URNRIGLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HMDF2O7D47R6ACHGH6URNRIGLN","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":"0d8db749f57d21d3960d97bb1148936fdc921e2eaef57a22892dac7aff2aacbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T17:55:03Z","title_canon_sha256":"75cce761f54895983e06655146cb45a80d4b48b028e3b7d61e25fa00edc1f32b"},"schema_version":"1.0","source":{"id":"1504.00627","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00627","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00627v2","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00627","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"HMDF2O7D47R6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HMDF2O7D47R6ACHG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HMDF2O7D","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:30d090acf5be017fe8c0991bedda1de32521e71dbaac8129fb4ddef44855545d","target":"graph","created_at":"2026-05-18T02:09:41Z","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 single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node $t$ and a set of demands that we want to send to the sink. Here demand $i$ is located at a node $s_i$ and requests an amount $d_i$ of flow capacity in order to route successfully. Two standard objectives are to maximise (i) the number of demands (cardinality) and (ii) the total demand (throughput) that can be routed subject to the capacity constraints. Furthermore, we examine these maximisation problems for three specialised types of network flow: unsplittable, confl","authors_text":"Adrian Vetta, F. Bruce Shepherd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T17:55:03Z","title":"The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00627","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:a59a87080066fa88fcbbaf5b8e13a6db4c2169aea96d25990439fdf1087c986d","target":"record","created_at":"2026-05-18T02:09:41Z","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":"0d8db749f57d21d3960d97bb1148936fdc921e2eaef57a22892dac7aff2aacbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-02T17:55:03Z","title_canon_sha256":"75cce761f54895983e06655146cb45a80d4b48b028e3b7d61e25fa00edc1f32b"},"schema_version":"1.0","source":{"id":"1504.00627","kind":"arxiv","version":2}},"canonical_sha256":"3b065d3be3e7e3e008e63fa916c5065b6bb37e3803051b516db0d8796725678e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b065d3be3e7e3e008e63fa916c5065b6bb37e3803051b516db0d8796725678e","first_computed_at":"2026-05-18T02:09:41.073697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:41.073697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVgF9w5OF4T0i3Ws3puQlMxfgXTzHsVbGTTsv+T/aN2tPNCkMegHBzce2w7/T5G4kJ+LQruLe6XbaXtSy8cfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:41.074405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00627","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a59a87080066fa88fcbbaf5b8e13a6db4c2169aea96d25990439fdf1087c986d","sha256:30d090acf5be017fe8c0991bedda1de32521e71dbaac8129fb4ddef44855545d"],"state_sha256":"0289d070f60c38a30dca1acc202e50081294a1348b0e52b10c3e06dec5282d58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cMIHw53O7C//8CNiyhpKilT3cEqdNiLZn4kfWreNBuDc8XMDzJNFkhUv5x5camOLbDRj6gdBrQ0mFBA9naFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:08:31.886174Z","bundle_sha256":"cd9c63640c596d6f3b71989e9c1aa95762d7a6f6141805cdb72439a5b91392d2"}}