{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GXBBK22JIDEBZEQ5PAL5HNGZUT","short_pith_number":"pith:GXBBK22J","canonical_record":{"source":{"id":"1407.7498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-28T19:01:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"35f8d95901388615435c7e5518a1a42699291168c3c1979db9299f2de32ca8e2","abstract_canon_sha256":"7acbc1af503470b047de7c0f59ae0730cee798ab10971b5c49ee37c4f91ef730"},"schema_version":"1.0"},"canonical_sha256":"35c2156b4940c81c921d7817d3b4d9a4f048cdd0e38f69c986cc40fef786e264","source":{"kind":"arxiv","id":"1407.7498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7498","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7498v1","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7498","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"GXBBK22JIDEB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GXBBK22JIDEBZEQ5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GXBBK22J","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GXBBK22JIDEBZEQ5PAL5HNGZUT","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-28T19:01:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"35f8d95901388615435c7e5518a1a42699291168c3c1979db9299f2de32ca8e2","abstract_canon_sha256":"7acbc1af503470b047de7c0f59ae0730cee798ab10971b5c49ee37c4f91ef730"},"schema_version":"1.0"},"canonical_sha256":"35c2156b4940c81c921d7817d3b4d9a4f048cdd0e38f69c986cc40fef786e264","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:23.041698Z","signature_b64":"JfjNjiFSvSuik9PKxfq3Wx9KBNu8aeWn9nHWGqwi+bvfzvTYNm60/qnoMcYR56ZKYGqvqeD9qscDu4ou1IaiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c2156b4940c81c921d7817d3b4d9a4f048cdd0e38f69c986cc40fef786e264","last_reissued_at":"2026-05-18T02:46:23.041263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:23.041263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7498","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-18T02:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leSY/6sqQIi6GeqrbuLIsWS+bNwgwJ1qPHLOAR/9q2L8liYxV4kOmsAI58y7RZ+XaRFQL6sUmgY1mLBDAWPcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:08:12.405724Z"},"content_sha256":"25ce0b160f5506296bb45ca8bf03de4a206a5f9089503e91eaddb160af1e6bd0","schema_version":"1.0","event_id":"sha256:25ce0b160f5506296bb45ca8bf03de4a206a5f9089503e91eaddb160af1e6bd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GXBBK22JIDEBZEQ5PAL5HNGZUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directed Multicut with linearly ordered terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Jason Teutsch, Nirupama Talele, Robert F. Erbacher, Trent Jaeger","submitted_at":"2014-07-28T19:01:26Z","abstract_excerpt":"Motivated by an application in network security, we investigate the following \"linear\" case of Directed Mutlicut. Let $G$ be a directed graph which includes some distinguished vertices $t_1, \\ldots, t_k$. What is the size of the smallest edge cut which eliminates all paths from $t_i$ to $t_j$ for all $i < j$? We show that this problem is fixed-parameter tractable when parametrized in the cutset size $p$ via an algorithm running in $O(4^p p n^4)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7498","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-18T02:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyBwsC4qKVbCN2xgS9x7WP7eG2vOkemoWPrWUX77gKD6s8OaREYN4ddodccFb0SzFdA2//fhfri4mEgsnNZBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:08:12.406163Z"},"content_sha256":"ff7360bf0596c3a9c85f804eb4258ef2738b50328bdc4f752856d566fc1cddd2","schema_version":"1.0","event_id":"sha256:ff7360bf0596c3a9c85f804eb4258ef2738b50328bdc4f752856d566fc1cddd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/bundle.json","state_url":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/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-08-03T17:08:12Z","links":{"resolver":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT","bundle":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/bundle.json","state":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GXBBK22JIDEBZEQ5PAL5HNGZUT","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":"7acbc1af503470b047de7c0f59ae0730cee798ab10971b5c49ee37c4f91ef730","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-28T19:01:26Z","title_canon_sha256":"35f8d95901388615435c7e5518a1a42699291168c3c1979db9299f2de32ca8e2"},"schema_version":"1.0","source":{"id":"1407.7498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7498","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7498v1","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7498","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"GXBBK22JIDEB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GXBBK22JIDEBZEQ5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GXBBK22J","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:ff7360bf0596c3a9c85f804eb4258ef2738b50328bdc4f752856d566fc1cddd2","target":"graph","created_at":"2026-05-18T02:46:23Z","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":"Motivated by an application in network security, we investigate the following \"linear\" case of Directed Mutlicut. Let $G$ be a directed graph which includes some distinguished vertices $t_1, \\ldots, t_k$. What is the size of the smallest edge cut which eliminates all paths from $t_i$ to $t_j$ for all $i < j$? We show that this problem is fixed-parameter tractable when parametrized in the cutset size $p$ via an algorithm running in $O(4^p p n^4)$ time.","authors_text":"Jason Teutsch, Nirupama Talele, Robert F. Erbacher, Trent Jaeger","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-28T19:01:26Z","title":"Directed Multicut with linearly ordered terminals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7498","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:25ce0b160f5506296bb45ca8bf03de4a206a5f9089503e91eaddb160af1e6bd0","target":"record","created_at":"2026-05-18T02:46:23Z","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":"7acbc1af503470b047de7c0f59ae0730cee798ab10971b5c49ee37c4f91ef730","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-28T19:01:26Z","title_canon_sha256":"35f8d95901388615435c7e5518a1a42699291168c3c1979db9299f2de32ca8e2"},"schema_version":"1.0","source":{"id":"1407.7498","kind":"arxiv","version":1}},"canonical_sha256":"35c2156b4940c81c921d7817d3b4d9a4f048cdd0e38f69c986cc40fef786e264","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35c2156b4940c81c921d7817d3b4d9a4f048cdd0e38f69c986cc40fef786e264","first_computed_at":"2026-05-18T02:46:23.041263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:23.041263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JfjNjiFSvSuik9PKxfq3Wx9KBNu8aeWn9nHWGqwi+bvfzvTYNm60/qnoMcYR56ZKYGqvqeD9qscDu4ou1IaiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:23.041698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25ce0b160f5506296bb45ca8bf03de4a206a5f9089503e91eaddb160af1e6bd0","sha256:ff7360bf0596c3a9c85f804eb4258ef2738b50328bdc4f752856d566fc1cddd2"],"state_sha256":"1e7bcc117f325e5b81248a2114867cad755609812da864ba8b8b5ea195451f5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuCvsHrK3vWqUYLJvGZx2ZJvymwWNIhD8UdHnDb4+u9AzJ911+LtjQBcRdKXXdzRRONUaBAoL68nbKsT7G52Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:08:12.409480Z","bundle_sha256":"26b33a3b5a3eba3395b32f3fc71e779e82f97fcfc2bbb0fe41370cfcdc6bf910"}}