{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4U6UVYVE3IHR4RR74QMYGPCM5K","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":"bb80257d45ca7f22de04941b774651b7b714765bf9d12131d275ef790a2baf6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-21T18:33:15Z","title_canon_sha256":"75ad078db5c1deef066b392dfe926e4dda1365daf0c78168c8f8a01be63e4df6"},"schema_version":"1.0","source":{"id":"1008.3652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3652","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3652v1","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3652","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"pith_short_12","alias_value":"4U6UVYVE3IHR","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4U6UVYVE3IHR4RR7","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4U6UVYVE","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:2617a7e64fb90c0e85ab208219e726e2e9cc0a6e399a3d98807aa6a3d3dee0c4","target":"graph","created_at":"2026-05-18T04:41:55Z","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 give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian. Here, $f$ is a polynomial function, $n = |V(G)|$, $k = |E(H)|$ and $R$ is the maximum request $\\max_{h \\in E(H)} r(h)$. When $k$ is fixed, this gives a polynomial algorithm for the arc-disjoint paths problem under the same hypothesis.","authors_text":"Guyslain Naves","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-21T18:33:15Z","title":"On disjoint paths in acyclic planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3652","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:d07e22d0d48ba7a1c49865e6432326db8db3571674f9971131da11d280723713","target":"record","created_at":"2026-05-18T04:41:55Z","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":"bb80257d45ca7f22de04941b774651b7b714765bf9d12131d275ef790a2baf6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-21T18:33:15Z","title_canon_sha256":"75ad078db5c1deef066b392dfe926e4dda1365daf0c78168c8f8a01be63e4df6"},"schema_version":"1.0","source":{"id":"1008.3652","kind":"arxiv","version":1}},"canonical_sha256":"e53d4ae2a4da0f1e463fe419833c4cea89987eebd832086fa914dd3461b183bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e53d4ae2a4da0f1e463fe419833c4cea89987eebd832086fa914dd3461b183bd","first_computed_at":"2026-05-18T04:41:55.426379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:55.426379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PsQoKmknCwVvrOKl/aUcuJy9y6Xwqw5kX1cMtD7NXRJaxllH+KapXqVBL8+S+W65cnSENvyLgVzNSOzqtqP4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:55.426773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d07e22d0d48ba7a1c49865e6432326db8db3571674f9971131da11d280723713","sha256:2617a7e64fb90c0e85ab208219e726e2e9cc0a6e399a3d98807aa6a3d3dee0c4"],"state_sha256":"a8fc5172ca297cd04f07a1321356872d9edf58c59af37a6ba0bcc15a8fd2a034"}