{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FDKGVJ7JI3Z27MFEK5CGRGTITU","short_pith_number":"pith:FDKGVJ7J","schema_version":"1.0","canonical_sha256":"28d46aa7e946f3afb0a45744689a689d00dca5e45ab2e72afe5896609464d368","source":{"kind":"arxiv","id":"1303.0262","version":1},"attestation_state":"computed","paper":{"title":"Covering Paths for Planar Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adrian Dumitrescu, Balazs Keszegh, Csaba D. Toth, Daniel Gerbner","submitted_at":"2013-03-01T19:54:45Z","abstract_excerpt":"Given $n$ points in the plane, a \\emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$ segments, and $n-1$ straight line segments obviously suffice even if the covering path is required to be noncrossing. We show that every set of $n$ points in the plane admits a (possibly self-crossi ng) covering path consisting of $n/2 +O(n/\\log{n})$ straight line segments. If the path is required to be noncrossing, we prove that $(1-\\eps)n$ straight line segments suffice for a small constant $\\eps>0$, and we exhibit"},"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":"1303.0262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-01T19:54:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7c83de8c2e5d8954690dc98b2765172880ee75b9cecbf96b6942adfc52b1c68e","abstract_canon_sha256":"045224fbeff1b5d7c22f04c8b14839821561a1b1c005d7fb527cab1f8bd5a6cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:06.448249Z","signature_b64":"pCwTLE0b490SyXHMROrCiJGNM3mTQcWmU3ERyR3Td8lTaru8zhMvXUvLGH/E89ZWl8CM5iIj9nMyAEtLMfxRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d46aa7e946f3afb0a45744689a689d00dca5e45ab2e72afe5896609464d368","last_reissued_at":"2026-05-18T03:32:06.447449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:06.447449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Paths for Planar Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adrian Dumitrescu, Balazs Keszegh, Csaba D. Toth, Daniel Gerbner","submitted_at":"2013-03-01T19:54:45Z","abstract_excerpt":"Given $n$ points in the plane, a \\emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$ segments, and $n-1$ straight line segments obviously suffice even if the covering path is required to be noncrossing. We show that every set of $n$ points in the plane admits a (possibly self-crossi ng) covering path consisting of $n/2 +O(n/\\log{n})$ straight line segments. If the path is required to be noncrossing, we prove that $(1-\\eps)n$ straight line segments suffice for a small constant $\\eps>0$, and we exhibit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0262","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":"1303.0262","created_at":"2026-05-18T03:32:06.447573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0262v1","created_at":"2026-05-18T03:32:06.447573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0262","created_at":"2026-05-18T03:32:06.447573+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDKGVJ7JI3Z2","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDKGVJ7JI3Z27MFE","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDKGVJ7J","created_at":"2026-05-18T12:27:45.050594+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/FDKGVJ7JI3Z27MFEK5CGRGTITU","json":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU.json","graph_json":"https://pith.science/api/pith-number/FDKGVJ7JI3Z27MFEK5CGRGTITU/graph.json","events_json":"https://pith.science/api/pith-number/FDKGVJ7JI3Z27MFEK5CGRGTITU/events.json","paper":"https://pith.science/paper/FDKGVJ7J"},"agent_actions":{"view_html":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU","download_json":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU.json","view_paper":"https://pith.science/paper/FDKGVJ7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0262&json=true","fetch_graph":"https://pith.science/api/pith-number/FDKGVJ7JI3Z27MFEK5CGRGTITU/graph.json","fetch_events":"https://pith.science/api/pith-number/FDKGVJ7JI3Z27MFEK5CGRGTITU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU/action/storage_attestation","attest_author":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU/action/author_attestation","sign_citation":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU/action/citation_signature","submit_replication":"https://pith.science/pith/FDKGVJ7JI3Z27MFEK5CGRGTITU/action/replication_record"}},"created_at":"2026-05-18T03:32:06.447573+00:00","updated_at":"2026-05-18T03:32:06.447573+00:00"}