{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3WOX2L7RIFGUCNH2J5HRM24TMI","short_pith_number":"pith:3WOX2L7R","schema_version":"1.0","canonical_sha256":"dd9d7d2ff1414d4134fa4f4f166b936200907680b9088e7cf324218dfe0b8b2e","source":{"kind":"arxiv","id":"1905.01185","version":1},"attestation_state":"computed","paper":{"title":"Most vital segment barriers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Irina Kostitsyna, Maarten L\\\"offler, Valentin Polishchuk","submitted_at":"2019-05-03T13:51:12Z","abstract_excerpt":"We study continuous analogues of \"vitality\" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain. This extends the graph-theoretic notion of \"most vital arcs\" for flows/paths to geometric environments. We give hardness results and efficient algorithms for various versions of the problem, (almost) completely separating hard and polynomially-solvable cases."},"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":"1905.01185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-03T13:51:12Z","cross_cats_sorted":[],"title_canon_sha256":"411791c43d239f040b011d7af2e15597bb05750cbd29758717ec34e5cb10c1c9","abstract_canon_sha256":"dfeb71c13ace7164ddd5afa943eacefd515d44ccac5aab10a8055b7fa5091adb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.569290Z","signature_b64":"yBpjSiRSRJvNl1L+u3miuci6SmEaKJaVuxFBQJ9ZoaJCatGmW0mppjAcVuY3BVQClKWsjZSoQd4IM30U4I+lDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd9d7d2ff1414d4134fa4f4f166b936200907680b9088e7cf324218dfe0b8b2e","last_reissued_at":"2026-05-17T23:47:06.568680Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.568680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Most vital segment barriers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Irina Kostitsyna, Maarten L\\\"offler, Valentin Polishchuk","submitted_at":"2019-05-03T13:51:12Z","abstract_excerpt":"We study continuous analogues of \"vitality\" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain. This extends the graph-theoretic notion of \"most vital arcs\" for flows/paths to geometric environments. We give hardness results and efficient algorithms for various versions of the problem, (almost) completely separating hard and polynomially-solvable cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01185","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":"1905.01185","created_at":"2026-05-17T23:47:06.568802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01185v1","created_at":"2026-05-17T23:47:06.568802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01185","created_at":"2026-05-17T23:47:06.568802+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WOX2L7RIFGU","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WOX2L7RIFGUCNH2","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WOX2L7R","created_at":"2026-05-18T12:33:10.108867+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/3WOX2L7RIFGUCNH2J5HRM24TMI","json":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI.json","graph_json":"https://pith.science/api/pith-number/3WOX2L7RIFGUCNH2J5HRM24TMI/graph.json","events_json":"https://pith.science/api/pith-number/3WOX2L7RIFGUCNH2J5HRM24TMI/events.json","paper":"https://pith.science/paper/3WOX2L7R"},"agent_actions":{"view_html":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI","download_json":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI.json","view_paper":"https://pith.science/paper/3WOX2L7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01185&json=true","fetch_graph":"https://pith.science/api/pith-number/3WOX2L7RIFGUCNH2J5HRM24TMI/graph.json","fetch_events":"https://pith.science/api/pith-number/3WOX2L7RIFGUCNH2J5HRM24TMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI/action/storage_attestation","attest_author":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI/action/author_attestation","sign_citation":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI/action/citation_signature","submit_replication":"https://pith.science/pith/3WOX2L7RIFGUCNH2J5HRM24TMI/action/replication_record"}},"created_at":"2026-05-17T23:47:06.568802+00:00","updated_at":"2026-05-17T23:47:06.568802+00:00"}