{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LJFLGKVDRHSKHHWTOHK4NNWEC7","short_pith_number":"pith:LJFLGKVD","schema_version":"1.0","canonical_sha256":"5a4ab32aa389e4a39ed371d5c6b6c417df8cdc00002a89e38201bf825323f759","source":{"kind":"arxiv","id":"1611.01004","version":1},"attestation_state":"computed","paper":{"title":"Half-integral linkages in highly connected directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Irene Muzi, Katherine Edwards, Paul Wollan","submitted_at":"2016-11-03T13:35:51Z","abstract_excerpt":"We study the half-integral $k$-Directed Disjoint Paths Problem ($\\tfrac12$kDDPP) in highly strongly connected digraphs. The integral kDDPP is NP-complete even when restricted to instances where $k=2$, and the input graph is $L$-strongly connected, for any $L\\geq 1$. We show that when the integrality condition is relaxed to allow each vertex to be used in two paths, the problem becomes efficiently solvable in highly connected digraphs (even with $k$ as part of the input). Specifically, we show that there is an absolute constant $c$ such that for each $k\\geq 2$ there exists $L(k)$ such that $\\tf"},"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":"1611.01004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T13:35:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9fc61f38c843211c9fa8332938cb71c3f3dbe8e0149142b63e7854eb07400ff5","abstract_canon_sha256":"252c7b776505d3a6f0b1d6ebe3b6b8815518532a9f920a473d98576cd804fbe0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:17.947638Z","signature_b64":"udmwt+PzBLG7vvdosb6YGC/G+krQLvSQo3wiSEbn0idJ8DCu+1XxMKWG1qsenJu/eGfInnHdvvN3iavfN2bmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a4ab32aa389e4a39ed371d5c6b6c417df8cdc00002a89e38201bf825323f759","last_reissued_at":"2026-05-18T01:00:17.946898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:17.946898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Half-integral linkages in highly connected directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Irene Muzi, Katherine Edwards, Paul Wollan","submitted_at":"2016-11-03T13:35:51Z","abstract_excerpt":"We study the half-integral $k$-Directed Disjoint Paths Problem ($\\tfrac12$kDDPP) in highly strongly connected digraphs. The integral kDDPP is NP-complete even when restricted to instances where $k=2$, and the input graph is $L$-strongly connected, for any $L\\geq 1$. We show that when the integrality condition is relaxed to allow each vertex to be used in two paths, the problem becomes efficiently solvable in highly connected digraphs (even with $k$ as part of the input). Specifically, we show that there is an absolute constant $c$ such that for each $k\\geq 2$ there exists $L(k)$ such that $\\tf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01004","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":"1611.01004","created_at":"2026-05-18T01:00:17.947043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01004v1","created_at":"2026-05-18T01:00:17.947043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01004","created_at":"2026-05-18T01:00:17.947043+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJFLGKVDRHSK","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJFLGKVDRHSKHHWT","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJFLGKVD","created_at":"2026-05-18T12:30:29.479603+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/LJFLGKVDRHSKHHWTOHK4NNWEC7","json":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7.json","graph_json":"https://pith.science/api/pith-number/LJFLGKVDRHSKHHWTOHK4NNWEC7/graph.json","events_json":"https://pith.science/api/pith-number/LJFLGKVDRHSKHHWTOHK4NNWEC7/events.json","paper":"https://pith.science/paper/LJFLGKVD"},"agent_actions":{"view_html":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7","download_json":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7.json","view_paper":"https://pith.science/paper/LJFLGKVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01004&json=true","fetch_graph":"https://pith.science/api/pith-number/LJFLGKVDRHSKHHWTOHK4NNWEC7/graph.json","fetch_events":"https://pith.science/api/pith-number/LJFLGKVDRHSKHHWTOHK4NNWEC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/action/storage_attestation","attest_author":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/action/author_attestation","sign_citation":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/action/citation_signature","submit_replication":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/action/replication_record"}},"created_at":"2026-05-18T01:00:17.947043+00:00","updated_at":"2026-05-18T01:00:17.947043+00:00"}