{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FKTO3QH2UVDXNSWNEFZC4ILRSH","short_pith_number":"pith:FKTO3QH2","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"},"canonical_sha256":"2aa6edc0faa54776cacd21722e217191db131d0f9ba2282946ef3caf54474346","source":{"kind":"arxiv","id":"1211.1490","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1490","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1490v3","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1490","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"FKTO3QH2UVDX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FKTO3QH2UVDXNSWN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FKTO3QH2","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FKTO3QH2UVDXNSWNEFZC4ILRSH","target":"record","payload":{"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"},"canonical_sha256":"2aa6edc0faa54776cacd21722e217191db131d0f9ba2282946ef3caf54474346","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"},"source_kind":"arxiv","source_id":"1211.1490","source_version":3,"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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpG+4oufzNmSyZ3tX9RukZPpKhDt/V4WtTn/xAuO0jGNTA1QLSzbGyjEP/qb8Gi78+14CeQKit5O5WY/4BxBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:40:33.564939Z"},"content_sha256":"b585abb0db9cb3d6e46cb44333ea2434595ed153b6ea1530e91fa92b8c357e30","schema_version":"1.0","event_id":"sha256:b585abb0db9cb3d6e46cb44333ea2434595ed153b6ea1530e91fa92b8c357e30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FKTO3QH2UVDXNSWNEFZC4ILRSH","target":"graph","payload":{"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"},"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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIa9SMEUbicfeOMTorP5XnA5pHV5sqtf1ewMxLKzk+2nAc4Nh3X9sSVP0+36TIdu+FAqrRe9DOA1jgSefucnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:40:33.565562Z"},"content_sha256":"722c79fa12097675b4853f7e97f8e1c191777b1c111aff689281e2eb80f41e88","schema_version":"1.0","event_id":"sha256:722c79fa12097675b4853f7e97f8e1c191777b1c111aff689281e2eb80f41e88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/bundle.json","state_url":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/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-27T03:40:33Z","links":{"resolver":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH","bundle":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/bundle.json","state":"https://pith.science/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKTO3QH2UVDXNSWNEFZC4ILRSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FKTO3QH2UVDXNSWNEFZC4ILRSH","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":"4abaead1653aef4c30bdbefb32d214186c09cbcb34733faf2827cd623e172956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T09:22:51Z","title_canon_sha256":"e24e4d6784607e08117abfabf5878fff821dd6b61dd0c276f3844f726d1e6f46"},"schema_version":"1.0","source":{"id":"1211.1490","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1490","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1490v3","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1490","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"FKTO3QH2UVDX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FKTO3QH2UVDXNSWN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FKTO3QH2","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:722c79fa12097675b4853f7e97f8e1c191777b1c111aff689281e2eb80f41e88","target":"graph","created_at":"2026-05-18T02:49:20Z","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":"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","authors_text":"Alexander Pilz, Carlos Seara, Jos\\'e Miguel D\\'iaz-B\\'a\\~nez, Matias Korman, Pablo P\\'erez-Lantero, Rodrigo I. Silveira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T09:22:51Z","title":"New results on stabbing segments with a polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1490","kind":"arxiv","version":3},"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:b585abb0db9cb3d6e46cb44333ea2434595ed153b6ea1530e91fa92b8c357e30","target":"record","created_at":"2026-05-18T02:49:20Z","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":"4abaead1653aef4c30bdbefb32d214186c09cbcb34733faf2827cd623e172956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T09:22:51Z","title_canon_sha256":"e24e4d6784607e08117abfabf5878fff821dd6b61dd0c276f3844f726d1e6f46"},"schema_version":"1.0","source":{"id":"1211.1490","kind":"arxiv","version":3}},"canonical_sha256":"2aa6edc0faa54776cacd21722e217191db131d0f9ba2282946ef3caf54474346","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aa6edc0faa54776cacd21722e217191db131d0f9ba2282946ef3caf54474346","first_computed_at":"2026-05-18T02:49:20.530144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:20.530144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nUkN3k7NZahqwDXyrMyRA5mvqwdz/yY8rvwzaPUO5lcBaTTi78sl2MnfjGMJwS/CNPJlBVdOO4954OGbeOc+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:20.530788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1490","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b585abb0db9cb3d6e46cb44333ea2434595ed153b6ea1530e91fa92b8c357e30","sha256:722c79fa12097675b4853f7e97f8e1c191777b1c111aff689281e2eb80f41e88"],"state_sha256":"b9f99dba18cce92ec114c104c6df545394ba9d80c5659b4971a509cad817aac5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuwmdMHp6pbSS5XH8yLmls8Hru+Qu9LZ7yJVrOir96UHZXF0rPSJ0ULmd8QHndSGKVebizo2oa1aACl9cghbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:40:33.568508Z","bundle_sha256":"edf1b8a4025ccf25498c436d3ef6cc58e405e950d3acabaf10c2b9aa464ea158"}}