{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XPKCJWQ3WJ47XJJDSSFUMWLKGM","short_pith_number":"pith:XPKCJWQ3","schema_version":"1.0","canonical_sha256":"bbd424da1bb279fba523948b46596a3318a23c0fce9e41762a56f1556b2037ab","source":{"kind":"arxiv","id":"1211.3566","version":1},"attestation_state":"computed","paper":{"title":"Free partially commutative groups, cohomology, and paths and circuits in directed graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Alexander Schrijver","submitted_at":"2012-11-15T10:37:36Z","abstract_excerpt":"We show that for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces needed to cover all sources and sinks. Moreover, the method can be extended to any fixed compact orientable surface (instead of the plane) and to rooted trees (instead of paths).\n  Our approach is algebraic and is based on cohomology over graph (nonabelian) groups. More precisely, let $D=(V,A)$ be a directed graph and let $(G,\\cdot)$ be a group. Call two func"},"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":"1211.3566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-15T10:37:36Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"5c45e848848ee731bc4144f9e648c351f731aa7b5f645c7358c808586300ec86","abstract_canon_sha256":"5dacb670a9b9aaae8c9ec39a1a9f83b9f38d30411c1fc8e72e47f936ba993c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:39.415385Z","signature_b64":"4wOOfGenkscFj5BdHhsH+vErsKn7fOOxVfPeMcCOP79A8cKHmGtg9GtxZkqw7jmbk+mVM89ivvqcwMecAmBrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd424da1bb279fba523948b46596a3318a23c0fce9e41762a56f1556b2037ab","last_reissued_at":"2026-05-18T03:40:39.414734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:39.414734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Free partially commutative groups, cohomology, and paths and circuits in directed graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Alexander Schrijver","submitted_at":"2012-11-15T10:37:36Z","abstract_excerpt":"We show that for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces needed to cover all sources and sinks. Moreover, the method can be extended to any fixed compact orientable surface (instead of the plane) and to rooted trees (instead of paths).\n  Our approach is algebraic and is based on cohomology over graph (nonabelian) groups. More precisely, let $D=(V,A)$ be a directed graph and let $(G,\\cdot)$ be a group. Call two func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3566","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":"1211.3566","created_at":"2026-05-18T03:40:39.414821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3566v1","created_at":"2026-05-18T03:40:39.414821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3566","created_at":"2026-05-18T03:40:39.414821+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPKCJWQ3WJ47","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPKCJWQ3WJ47XJJD","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPKCJWQ3","created_at":"2026-05-18T12:27:27.928770+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/XPKCJWQ3WJ47XJJDSSFUMWLKGM","json":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM.json","graph_json":"https://pith.science/api/pith-number/XPKCJWQ3WJ47XJJDSSFUMWLKGM/graph.json","events_json":"https://pith.science/api/pith-number/XPKCJWQ3WJ47XJJDSSFUMWLKGM/events.json","paper":"https://pith.science/paper/XPKCJWQ3"},"agent_actions":{"view_html":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM","download_json":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM.json","view_paper":"https://pith.science/paper/XPKCJWQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3566&json=true","fetch_graph":"https://pith.science/api/pith-number/XPKCJWQ3WJ47XJJDSSFUMWLKGM/graph.json","fetch_events":"https://pith.science/api/pith-number/XPKCJWQ3WJ47XJJDSSFUMWLKGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM/action/storage_attestation","attest_author":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM/action/author_attestation","sign_citation":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM/action/citation_signature","submit_replication":"https://pith.science/pith/XPKCJWQ3WJ47XJJDSSFUMWLKGM/action/replication_record"}},"created_at":"2026-05-18T03:40:39.414821+00:00","updated_at":"2026-05-18T03:40:39.414821+00:00"}