{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GXBBK22JIDEBZEQ5PAL5HNGZUT","short_pith_number":"pith:GXBBK22J","schema_version":"1.0","canonical_sha256":"35c2156b4940c81c921d7817d3b4d9a4f048cdd0e38f69c986cc40fef786e264","source":{"kind":"arxiv","id":"1407.7498","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7498","created_at":"2026-05-18T02:46:23.041332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7498v1","created_at":"2026-05-18T02:46:23.041332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7498","created_at":"2026-05-18T02:46:23.041332+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXBBK22JIDEB","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXBBK22JIDEBZEQ5","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXBBK22J","created_at":"2026-05-18T12:28:30.664211+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/GXBBK22JIDEBZEQ5PAL5HNGZUT","json":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT.json","graph_json":"https://pith.science/api/pith-number/GXBBK22JIDEBZEQ5PAL5HNGZUT/graph.json","events_json":"https://pith.science/api/pith-number/GXBBK22JIDEBZEQ5PAL5HNGZUT/events.json","paper":"https://pith.science/paper/GXBBK22J"},"agent_actions":{"view_html":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT","download_json":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT.json","view_paper":"https://pith.science/paper/GXBBK22J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7498&json=true","fetch_graph":"https://pith.science/api/pith-number/GXBBK22JIDEBZEQ5PAL5HNGZUT/graph.json","fetch_events":"https://pith.science/api/pith-number/GXBBK22JIDEBZEQ5PAL5HNGZUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/action/storage_attestation","attest_author":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/action/author_attestation","sign_citation":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/action/citation_signature","submit_replication":"https://pith.science/pith/GXBBK22JIDEBZEQ5PAL5HNGZUT/action/replication_record"}},"created_at":"2026-05-18T02:46:23.041332+00:00","updated_at":"2026-05-18T02:46:23.041332+00:00"}