{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PS5Y5WZF4X63YBOX6DXAI56A7W","short_pith_number":"pith:PS5Y5WZF","schema_version":"1.0","canonical_sha256":"7cbb8edb25e5fdbc05d7f0ee0477c0fda9f570618f6b1a2961585f037485e836","source":{"kind":"arxiv","id":"1902.07568","version":1},"attestation_state":"computed","paper":{"title":"On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Voborn\\'ik, Kate\\v{r}ina Altmanov\\'a, Petr Kolman","submitted_at":"2019-02-20T14:21:01Z","abstract_excerpt":"Given a graph $G=(V,E)$ with two distinguished vertices $s,t\\in V$ and an integer $L$, an {\\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\\em maximum $L$-bounded flow problem} the task is to find a maximum $L$-bounded flow between a given pair of vertices in the input graph.\n  The problem can be solved in polynomial time using linear programming. However, as far as we know, no polynomial-time combinatorial algorithm for the $L$-bounded flow is known. The only attempt, that we are aware of, to describe a combinatorial algorit"},"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":"1902.07568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T14:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"a20fe4ba8794410ee482d79b0025680bcfaf96adf2e7eaec47b16b43ee0765c8","abstract_canon_sha256":"b42b34844d322c9f4369e6a736379577896e936fa089c20628b44e456dcaf5cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:07.475222Z","signature_b64":"hhZeRJi0+FhVjmsovjkVtd8/O79ysmJwlsTg373+Ktt9evlQFEOISX9B2WjjfJOCSGEAPeSih9rD+4FAXHg2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cbb8edb25e5fdbc05d7f0ee0477c0fda9f570618f6b1a2961585f037485e836","last_reissued_at":"2026-05-17T23:53:07.474531Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:07.474531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Voborn\\'ik, Kate\\v{r}ina Altmanov\\'a, Petr Kolman","submitted_at":"2019-02-20T14:21:01Z","abstract_excerpt":"Given a graph $G=(V,E)$ with two distinguished vertices $s,t\\in V$ and an integer $L$, an {\\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\\em maximum $L$-bounded flow problem} the task is to find a maximum $L$-bounded flow between a given pair of vertices in the input graph.\n  The problem can be solved in polynomial time using linear programming. However, as far as we know, no polynomial-time combinatorial algorithm for the $L$-bounded flow is known. The only attempt, that we are aware of, to describe a combinatorial algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07568","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.07568","created_at":"2026-05-17T23:53:07.474639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07568v1","created_at":"2026-05-17T23:53:07.474639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07568","created_at":"2026-05-17T23:53:07.474639+00:00"},{"alias_kind":"pith_short_12","alias_value":"PS5Y5WZF4X63","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PS5Y5WZF4X63YBOX","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PS5Y5WZF","created_at":"2026-05-18T12:33:24.271573+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/PS5Y5WZF4X63YBOX6DXAI56A7W","json":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W.json","graph_json":"https://pith.science/api/pith-number/PS5Y5WZF4X63YBOX6DXAI56A7W/graph.json","events_json":"https://pith.science/api/pith-number/PS5Y5WZF4X63YBOX6DXAI56A7W/events.json","paper":"https://pith.science/paper/PS5Y5WZF"},"agent_actions":{"view_html":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W","download_json":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W.json","view_paper":"https://pith.science/paper/PS5Y5WZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07568&json=true","fetch_graph":"https://pith.science/api/pith-number/PS5Y5WZF4X63YBOX6DXAI56A7W/graph.json","fetch_events":"https://pith.science/api/pith-number/PS5Y5WZF4X63YBOX6DXAI56A7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W/action/storage_attestation","attest_author":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W/action/author_attestation","sign_citation":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W/action/citation_signature","submit_replication":"https://pith.science/pith/PS5Y5WZF4X63YBOX6DXAI56A7W/action/replication_record"}},"created_at":"2026-05-17T23:53:07.474639+00:00","updated_at":"2026-05-17T23:53:07.474639+00:00"}