{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FKTO3QH2UVDXNSWNEFZC4ILRSH","short_pith_number":"pith:FKTO3QH2","schema_version":"1.0","canonical_sha256":"2aa6edc0faa54776cacd21722e217191db131d0f9ba2282946ef3caf54474346","source":{"kind":"arxiv","id":"1211.1490","version":3},"attestation_state":"computed","paper":{"title":"New results on stabbing segments with a polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Pilz, Carlos Seara, Jos\\'e Miguel D\\'iaz-B\\'a\\~nez, Matias Korman, Pablo P\\'erez-Lantero, Rodrigo I. Silveira","submitted_at":"2012-11-07T09:22:51Z","abstract_excerpt":"We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\\mathcal{P}$ if at least one of its two endpoints is contained in $\\mathcal{P}$. A segment set $S$ is stabbed by $\\mathcal{P}$ if every segment of $S$ is stabbed by $\\mathcal{P}$. We show that if $S$ is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing $S$ can be solved in polynomial time. We also prove that for general segments the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves"},"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":"1211.1490","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T09:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"e24e4d6784607e08117abfabf5878fff821dd6b61dd0c276f3844f726d1e6f46","abstract_canon_sha256":"4abaead1653aef4c30bdbefb32d214186c09cbcb34733faf2827cd623e172956"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:20.530788Z","signature_b64":"nUkN3k7NZahqwDXyrMyRA5mvqwdz/yY8rvwzaPUO5lcBaTTi78sl2MnfjGMJwS/CNPJlBVdOO4954OGbeOc+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa6edc0faa54776cacd21722e217191db131d0f9ba2282946ef3caf54474346","last_reissued_at":"2026-05-18T02:49:20.530144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:20.530144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New results on stabbing segments with a polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Pilz, Carlos Seara, Jos\\'e Miguel D\\'iaz-B\\'a\\~nez, Matias Korman, Pablo P\\'erez-Lantero, Rodrigo I. Silveira","submitted_at":"2012-11-07T09:22:51Z","abstract_excerpt":"We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\\mathcal{P}$ if at least one of its two endpoints is contained in $\\mathcal{P}$. A segment set $S$ is stabbed by $\\mathcal{P}$ if every segment of $S$ is stabbed by $\\mathcal{P}$. We show that if $S$ is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing $S$ can be solved in polynomial time. We also prove that for general segments the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1490","kind":"arxiv","version":3},"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":"1211.1490","created_at":"2026-05-18T02:49:20.530255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1490v3","created_at":"2026-05-18T02:49:20.530255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1490","created_at":"2026-05-18T02:49:20.530255+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKTO3QH2UVDX","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKTO3QH2UVDXNSWN","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKTO3QH2","created_at":"2026-05-18T12:27:06.952714+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/FKTO3QH2UVDXNSWNEFZC4ILRSH","json":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH.json","graph_json":"https://pith.science/api/pith-number/FKTO3QH2UVDXNSWNEFZC4ILRSH/graph.json","events_json":"https://pith.science/api/pith-number/FKTO3QH2UVDXNSWNEFZC4ILRSH/events.json","paper":"https://pith.science/paper/FKTO3QH2"},"agent_actions":{"view_html":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH","download_json":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH.json","view_paper":"https://pith.science/paper/FKTO3QH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1490&json=true","fetch_graph":"https://pith.science/api/pith-number/FKTO3QH2UVDXNSWNEFZC4ILRSH/graph.json","fetch_events":"https://pith.science/api/pith-number/FKTO3QH2UVDXNSWNEFZC4ILRSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/action/storage_attestation","attest_author":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/action/author_attestation","sign_citation":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/action/citation_signature","submit_replication":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/action/replication_record"}},"created_at":"2026-05-18T02:49:20.530255+00:00","updated_at":"2026-05-18T02:49:20.530255+00:00"}