{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GXJWPZDMLBVTB5WEGSAO47LUKL","short_pith_number":"pith:GXJWPZDM","schema_version":"1.0","canonical_sha256":"35d367e46c586b30f6c43480ee7d7452d8c71140b3eb14007e4e4c2c136fbc9d","source":{"kind":"arxiv","id":"1312.1526","version":1},"attestation_state":"computed","paper":{"title":"Vertex Disjoint Path in Upward Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ali Golshani, Saeed Amiri, Sebastian Siebertz, Stephan Kreutzer","submitted_at":"2013-12-05T12:47:28Z","abstract_excerpt":"The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter $k$) on this restricted class. Only recently, \\cite{CMPP}.\\ achieved a major breakthrough and answered the question positively. Despite the importance of this result (and the brilliance of their proof), it is of rather theoretical importance. Th"},"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":"1312.1526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T12:47:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e322d08ea1a20e5558644c319af8fd9974917fd1c6aba7fc6eedaa1f0c438843","abstract_canon_sha256":"f27b756e66d4c93de05c30300213b232375a332cef768049d66fb17fc93610ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.007507Z","signature_b64":"vgV9Q2DP6e8eOHjMdSKozoz6SpjkswDKYIekMFHQAdVlJn6LZ5jkggRUwsvpyB4oUhTSMCqVMV1mLgclYnjNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d367e46c586b30f6c43480ee7d7452d8c71140b3eb14007e4e4c2c136fbc9d","last_reissued_at":"2026-05-18T03:05:27.007010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.007010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Disjoint Path in Upward Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ali Golshani, Saeed Amiri, Sebastian Siebertz, Stephan Kreutzer","submitted_at":"2013-12-05T12:47:28Z","abstract_excerpt":"The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter $k$) on this restricted class. Only recently, \\cite{CMPP}.\\ achieved a major breakthrough and answered the question positively. Despite the importance of this result (and the brilliance of their proof), it is of rather theoretical importance. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1526","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":"1312.1526","created_at":"2026-05-18T03:05:27.007083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1526v1","created_at":"2026-05-18T03:05:27.007083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1526","created_at":"2026-05-18T03:05:27.007083+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXJWPZDMLBVT","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXJWPZDMLBVTB5WE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXJWPZDM","created_at":"2026-05-18T12:27:46.883200+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/GXJWPZDMLBVTB5WEGSAO47LUKL","json":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL.json","graph_json":"https://pith.science/api/pith-number/GXJWPZDMLBVTB5WEGSAO47LUKL/graph.json","events_json":"https://pith.science/api/pith-number/GXJWPZDMLBVTB5WEGSAO47LUKL/events.json","paper":"https://pith.science/paper/GXJWPZDM"},"agent_actions":{"view_html":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL","download_json":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL.json","view_paper":"https://pith.science/paper/GXJWPZDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1526&json=true","fetch_graph":"https://pith.science/api/pith-number/GXJWPZDMLBVTB5WEGSAO47LUKL/graph.json","fetch_events":"https://pith.science/api/pith-number/GXJWPZDMLBVTB5WEGSAO47LUKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL/action/storage_attestation","attest_author":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL/action/author_attestation","sign_citation":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL/action/citation_signature","submit_replication":"https://pith.science/pith/GXJWPZDMLBVTB5WEGSAO47LUKL/action/replication_record"}},"created_at":"2026-05-18T03:05:27.007083+00:00","updated_at":"2026-05-18T03:05:27.007083+00:00"}