{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PS5Y5WZF4X63YBOX6DXAI56A7W","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":"b42b34844d322c9f4369e6a736379577896e936fa089c20628b44e456dcaf5cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T14:21:01Z","title_canon_sha256":"a20fe4ba8794410ee482d79b0025680bcfaf96adf2e7eaec47b16b43ee0765c8"},"schema_version":"1.0","source":{"id":"1902.07568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07568","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07568v1","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07568","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"PS5Y5WZF4X63","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PS5Y5WZF4X63YBOX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PS5Y5WZF","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:aa0b7155322043cbf3385d97a57105fbb011128d6e5f256a165ee546af03e9d7","target":"graph","created_at":"2026-05-17T23:53:07Z","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":"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","authors_text":"Jan Voborn\\'ik, Kate\\v{r}ina Altmanov\\'a, Petr Kolman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T14:21:01Z","title":"On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07568","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:70a44440c1c0ec9efc87e416da94f8e3a2c5f14bc397be03e7f82e1ce590c2c2","target":"record","created_at":"2026-05-17T23:53:07Z","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":"b42b34844d322c9f4369e6a736379577896e936fa089c20628b44e456dcaf5cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T14:21:01Z","title_canon_sha256":"a20fe4ba8794410ee482d79b0025680bcfaf96adf2e7eaec47b16b43ee0765c8"},"schema_version":"1.0","source":{"id":"1902.07568","kind":"arxiv","version":1}},"canonical_sha256":"7cbb8edb25e5fdbc05d7f0ee0477c0fda9f570618f6b1a2961585f037485e836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cbb8edb25e5fdbc05d7f0ee0477c0fda9f570618f6b1a2961585f037485e836","first_computed_at":"2026-05-17T23:53:07.474531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:07.474531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hhZeRJi0+FhVjmsovjkVtd8/O79ysmJwlsTg373+Ktt9evlQFEOISX9B2WjjfJOCSGEAPeSih9rD+4FAXHg2BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:07.475222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70a44440c1c0ec9efc87e416da94f8e3a2c5f14bc397be03e7f82e1ce590c2c2","sha256:aa0b7155322043cbf3385d97a57105fbb011128d6e5f256a165ee546af03e9d7"],"state_sha256":"0305a5e9ac624fe15482692d518de61f6799f8dad47bcc9edae4111978d3bbbe"}