{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S6GX3TVZY4QQBOZEAD7ZZHOPEV","short_pith_number":"pith:S6GX3TVZ","canonical_record":{"source":{"id":"1907.00817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-01T14:25:43Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"65485c35fcdd8de8a2633347d7e6a31894167873898a6276ef9d807c6a3fb183","abstract_canon_sha256":"f6714ddd97fa70e8065b4676187cf2bb01ec93405008490caf6368603f6528b7"},"schema_version":"1.0"},"canonical_sha256":"978d7dceb9c72100bb2400ff9c9dcf2556922c0ae3d24c53798f681597d86752","source":{"kind":"arxiv","id":"1907.00817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00817","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00817v1","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00817","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"S6GX3TVZY4QQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S6GX3TVZY4QQBOZE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S6GX3TVZ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S6GX3TVZY4QQBOZEAD7ZZHOPEV","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-01T14:25:43Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"65485c35fcdd8de8a2633347d7e6a31894167873898a6276ef9d807c6a3fb183","abstract_canon_sha256":"f6714ddd97fa70e8065b4676187cf2bb01ec93405008490caf6368603f6528b7"},"schema_version":"1.0"},"canonical_sha256":"978d7dceb9c72100bb2400ff9c9dcf2556922c0ae3d24c53798f681597d86752","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:47.999290Z","signature_b64":"b6jN+hMAiwwYnkmYIQb+rXLAim1Xk1nSoEVNjVhWffZZ6WaxLnfUs7472mvrUxBmp6h0HFH4WmWAC931JP13Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"978d7dceb9c72100bb2400ff9c9dcf2556922c0ae3d24c53798f681597d86752","last_reissued_at":"2026-05-17T23:41:47.998573Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:47.998573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00817","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-17T23:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrSMUk9zdEzBGC58zZGW2db/eXpavsHX6PlfbaVzenAfzJ6UbTfc6PUGD/OHI8j/bK3xWmtWf17FoQ/TNfAdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:34:39.430593Z"},"content_sha256":"15ba602ff48c8b41adbb976051384070f8fc09d445c011a0ab8d42544a02c9eb","schema_version":"1.0","event_id":"sha256:15ba602ff48c8b41adbb976051384070f8fc09d445c011a0ab8d42544a02c9eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S6GX3TVZY4QQBOZEAD7ZZHOPEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The directed 2-linkage problem with length constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Anders Yeo, J{\\o}rgen Bang-Jensen, Thomas Bellitto, William Lochet","submitted_at":"2019-07-01T14:25:43Z","abstract_excerpt":"The {\\sc weak 2-linkage} problem for digraphs asks for a given digraph and vertices $s_1,s_2,t_1,t_2$ whether $D$ contains a pair of arc-disjoint paths $P_1,P_2$ such that $P_i$ is an $(s_i,t_i)$-path. This problem is NP-complete for general digraphs but polynomially solvable for acyclic digraphs \\cite{fortuneTCS10}. Recently it was shown \\cite{bercziESA17} that if $D$ is equipped with a weight function $w$ on the arcs\n  which satisfies that all edges have positive weight, then there is a polynomial algorithm for the variant of the weak-2-linkage problem when both paths have to be shortest pat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00817","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-17T23:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3QFc+lZDDEoGoxI96aAo0OhWG5Es1IO2xjU8xEUxTOxu2eLkPhvEoJpNnS9pXc50fMr4DvqAvapgyI5s23MgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:34:39.430939Z"},"content_sha256":"1864db13ff3336fa746791f1a6ee5fa14e26d5dd653f9dae58c7d9d9460d46c1","schema_version":"1.0","event_id":"sha256:1864db13ff3336fa746791f1a6ee5fa14e26d5dd653f9dae58c7d9d9460d46c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV/bundle.json","state_url":"https://pith.science/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV/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-28T15:34:39Z","links":{"resolver":"https://pith.science/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV","bundle":"https://pith.science/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV/bundle.json","state":"https://pith.science/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6GX3TVZY4QQBOZEAD7ZZHOPEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S6GX3TVZY4QQBOZEAD7ZZHOPEV","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":"f6714ddd97fa70e8065b4676187cf2bb01ec93405008490caf6368603f6528b7","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-01T14:25:43Z","title_canon_sha256":"65485c35fcdd8de8a2633347d7e6a31894167873898a6276ef9d807c6a3fb183"},"schema_version":"1.0","source":{"id":"1907.00817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00817","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00817v1","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00817","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"S6GX3TVZY4QQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S6GX3TVZY4QQBOZE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S6GX3TVZ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:1864db13ff3336fa746791f1a6ee5fa14e26d5dd653f9dae58c7d9d9460d46c1","target":"graph","created_at":"2026-05-17T23:41:47Z","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":"The {\\sc weak 2-linkage} problem for digraphs asks for a given digraph and vertices $s_1,s_2,t_1,t_2$ whether $D$ contains a pair of arc-disjoint paths $P_1,P_2$ such that $P_i$ is an $(s_i,t_i)$-path. This problem is NP-complete for general digraphs but polynomially solvable for acyclic digraphs \\cite{fortuneTCS10}. Recently it was shown \\cite{bercziESA17} that if $D$ is equipped with a weight function $w$ on the arcs\n  which satisfies that all edges have positive weight, then there is a polynomial algorithm for the variant of the weak-2-linkage problem when both paths have to be shortest pat","authors_text":"Anders Yeo, J{\\o}rgen Bang-Jensen, Thomas Bellitto, William Lochet","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-01T14:25:43Z","title":"The directed 2-linkage problem with length constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00817","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:15ba602ff48c8b41adbb976051384070f8fc09d445c011a0ab8d42544a02c9eb","target":"record","created_at":"2026-05-17T23:41:47Z","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":"f6714ddd97fa70e8065b4676187cf2bb01ec93405008490caf6368603f6528b7","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-01T14:25:43Z","title_canon_sha256":"65485c35fcdd8de8a2633347d7e6a31894167873898a6276ef9d807c6a3fb183"},"schema_version":"1.0","source":{"id":"1907.00817","kind":"arxiv","version":1}},"canonical_sha256":"978d7dceb9c72100bb2400ff9c9dcf2556922c0ae3d24c53798f681597d86752","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"978d7dceb9c72100bb2400ff9c9dcf2556922c0ae3d24c53798f681597d86752","first_computed_at":"2026-05-17T23:41:47.998573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:47.998573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b6jN+hMAiwwYnkmYIQb+rXLAim1Xk1nSoEVNjVhWffZZ6WaxLnfUs7472mvrUxBmp6h0HFH4WmWAC931JP13Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:47.999290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15ba602ff48c8b41adbb976051384070f8fc09d445c011a0ab8d42544a02c9eb","sha256:1864db13ff3336fa746791f1a6ee5fa14e26d5dd653f9dae58c7d9d9460d46c1"],"state_sha256":"17f2ef50347b5af39f510edbc6903c0f3faf45c14e265f0909995b0f9fde008f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdwED910yq3MjXm2f9g2lsX2E+j9EV0+h102qHUBUgo8prDaUz51JY80BY+2HLkeeGsN2owkBYFayTmaw/52BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:34:39.432939Z","bundle_sha256":"dd5bc6f1052edf30fb079cf8465038f1fbcc19b36508075696ffff2171986f8c"}}