{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LJFLGKVDRHSKHHWTOHK4NNWEC7","short_pith_number":"pith:LJFLGKVD","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"},"canonical_sha256":"5a4ab32aa389e4a39ed371d5c6b6c417df8cdc00002a89e38201bf825323f759","source":{"kind":"arxiv","id":"1611.01004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01004","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01004v1","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01004","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"LJFLGKVDRHSK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LJFLGKVDRHSKHHWT","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LJFLGKVD","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LJFLGKVDRHSKHHWTOHK4NNWEC7","target":"record","payload":{"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"},"canonical_sha256":"5a4ab32aa389e4a39ed371d5c6b6c417df8cdc00002a89e38201bf825323f759","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"},"source_kind":"arxiv","source_id":"1611.01004","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnHVho0KVqQLyN0Cjd4a7DpR7z1z9ME9QZZo4jAlwt6tse4ZPrWAWBDKhoL/WS1uesWAJ+NnzlRM26otd2e5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:07:34.650665Z"},"content_sha256":"5c99e768ebdc9ce360f22983405deb60d2087ab2b51b1be9eb18265abe542317","schema_version":"1.0","event_id":"sha256:5c99e768ebdc9ce360f22983405deb60d2087ab2b51b1be9eb18265abe542317"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LJFLGKVDRHSKHHWTOHK4NNWEC7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoETmpGAFjtd3sIVUGZXxxUt0Z8ISxP6ri517xPgJ0z1fO4d1Vg8q119nsTt6MABD8rGCCoS8eA0S1JV8M34BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:07:34.651381Z"},"content_sha256":"52cbdf5420019004807f6156b51f3042500bfb136b331df6dd555c9809a7df09","schema_version":"1.0","event_id":"sha256:52cbdf5420019004807f6156b51f3042500bfb136b331df6dd555c9809a7df09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/bundle.json","state_url":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T21:07:34Z","links":{"resolver":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7","bundle":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/bundle.json","state":"https://pith.science/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJFLGKVDRHSKHHWTOHK4NNWEC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LJFLGKVDRHSKHHWTOHK4NNWEC7","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":"252c7b776505d3a6f0b1d6ebe3b6b8815518532a9f920a473d98576cd804fbe0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T13:35:51Z","title_canon_sha256":"9fc61f38c843211c9fa8332938cb71c3f3dbe8e0149142b63e7854eb07400ff5"},"schema_version":"1.0","source":{"id":"1611.01004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01004","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01004v1","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01004","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"LJFLGKVDRHSK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LJFLGKVDRHSKHHWT","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LJFLGKVD","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:52cbdf5420019004807f6156b51f3042500bfb136b331df6dd555c9809a7df09","target":"graph","created_at":"2026-05-18T01:00:17Z","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 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","authors_text":"Irene Muzi, Katherine Edwards, Paul Wollan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T13:35:51Z","title":"Half-integral linkages in highly connected directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01004","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:5c99e768ebdc9ce360f22983405deb60d2087ab2b51b1be9eb18265abe542317","target":"record","created_at":"2026-05-18T01:00:17Z","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":"252c7b776505d3a6f0b1d6ebe3b6b8815518532a9f920a473d98576cd804fbe0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T13:35:51Z","title_canon_sha256":"9fc61f38c843211c9fa8332938cb71c3f3dbe8e0149142b63e7854eb07400ff5"},"schema_version":"1.0","source":{"id":"1611.01004","kind":"arxiv","version":1}},"canonical_sha256":"5a4ab32aa389e4a39ed371d5c6b6c417df8cdc00002a89e38201bf825323f759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a4ab32aa389e4a39ed371d5c6b6c417df8cdc00002a89e38201bf825323f759","first_computed_at":"2026-05-18T01:00:17.946898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:17.946898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udmwt+PzBLG7vvdosb6YGC/G+krQLvSQo3wiSEbn0idJ8DCu+1XxMKWG1qsenJu/eGfInnHdvvN3iavfN2bmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:17.947638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c99e768ebdc9ce360f22983405deb60d2087ab2b51b1be9eb18265abe542317","sha256:52cbdf5420019004807f6156b51f3042500bfb136b331df6dd555c9809a7df09"],"state_sha256":"cd9d7e9954220c292594b6daa2c998f3473f7af3380b998b8a460ee0e9171df9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZ+MJWXPJhAafObn7HgkhpM4nfG9wpgF8ibdKE4Dz7o9U1Le10VOpJCDi7vHmIJzd1g3M62z6A7fcsI///IZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:07:34.654923Z","bundle_sha256":"81525bba1a8c088995df0cead03bffd1076d3d5b415ec2e8d2d3701048431716"}}