{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EAORMCAKQCEMBEVKTATJ6XX4ZY","short_pith_number":"pith:EAORMCAK","canonical_record":{"source":{"id":"1311.0452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T10:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"e3513f94188fa02e4ce13d1e599cf2ab2bdd0a66b6fff4f1650b87696dbd95b1","abstract_canon_sha256":"84c01ae573a5bfaedfe014b625a9d8f601d601d64d85c094e78c98c67a519f2e"},"schema_version":"1.0"},"canonical_sha256":"201d16080a8088c092aa98269f5efcce29024614eb790d671be8de5ce539bb1f","source":{"kind":"arxiv","id":"1311.0452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0452","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0452v1","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0452","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"EAORMCAKQCEM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EAORMCAKQCEMBEVK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EAORMCAK","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EAORMCAKQCEMBEVKTATJ6XX4ZY","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T10:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"e3513f94188fa02e4ce13d1e599cf2ab2bdd0a66b6fff4f1650b87696dbd95b1","abstract_canon_sha256":"84c01ae573a5bfaedfe014b625a9d8f601d601d64d85c094e78c98c67a519f2e"},"schema_version":"1.0"},"canonical_sha256":"201d16080a8088c092aa98269f5efcce29024614eb790d671be8de5ce539bb1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.907552Z","signature_b64":"fetQ4+2V9CinpoJ/3XKKK1VpErWdv6I1O6BL0WSd+/GSHZuC8m2UslyH2LYurqXI11ZDoQxUkPHLhPHeGYgpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201d16080a8088c092aa98269f5efcce29024614eb790d671be8de5ce539bb1f","last_reissued_at":"2026-05-18T03:08:05.907040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.907040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0452","source_version":1,"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-18T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkPxb/EnYScsGvCKkcIaiubu9Ow8rcUy0TQaapzaFJ39EX/u3RycXFwu65uWP+pw6gUO1acxHjgtIAmNTIjzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:08:55.302469Z"},"content_sha256":"16a82e57d1e53b0b109edfce3a96708ab847d1f32cf23bd28718f3ea2958151d","schema_version":"1.0","event_id":"sha256:16a82e57d1e53b0b109edfce3a96708ab847d1f32cf23bd28718f3ea2958151d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EAORMCAKQCEMBEVKTATJ6XX4ZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Paths and Trees for Planar Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh","submitted_at":"2013-11-03T10:24:15Z","abstract_excerpt":"Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is $2\\min(n,m)-1$ except when we allow crossings and $n=m\\ge 3$, in which case the minimal number of segments of such a path is $2\\min(n,m)-2$, i.e., in this case we can save one segment. In fact we show that these are true even if we consider covering trees instead of paths.\n  These results extend previous works on axis-aligned covering paths of n x m grids and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0452","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"},"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-18T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wW+KbF3TNAbGk+wSoyCWNxk6bTWa3k2laSrajFLeWtOCTm51usa48/tmSg6wZ0SWPwciZhLwagykpyehiHU5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:08:55.303043Z"},"content_sha256":"a3255776d9526d7e88cdf64efa843d8bd875064a03d9d626c70d212bc7094e54","schema_version":"1.0","event_id":"sha256:a3255776d9526d7e88cdf64efa843d8bd875064a03d9d626c70d212bc7094e54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY/bundle.json","state_url":"https://pith.science/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY/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-28T16:08:55Z","links":{"resolver":"https://pith.science/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY","bundle":"https://pith.science/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY/bundle.json","state":"https://pith.science/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAORMCAKQCEMBEVKTATJ6XX4ZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EAORMCAKQCEMBEVKTATJ6XX4ZY","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":"84c01ae573a5bfaedfe014b625a9d8f601d601d64d85c094e78c98c67a519f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T10:24:15Z","title_canon_sha256":"e3513f94188fa02e4ce13d1e599cf2ab2bdd0a66b6fff4f1650b87696dbd95b1"},"schema_version":"1.0","source":{"id":"1311.0452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0452","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0452v1","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0452","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"EAORMCAKQCEM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EAORMCAKQCEMBEVK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EAORMCAK","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:a3255776d9526d7e88cdf64efa843d8bd875064a03d9d626c70d212bc7094e54","target":"graph","created_at":"2026-05-18T03:08:05Z","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":"Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is $2\\min(n,m)-1$ except when we allow crossings and $n=m\\ge 3$, in which case the minimal number of segments of such a path is $2\\min(n,m)-2$, i.e., in this case we can save one segment. In fact we show that these are true even if we consider covering trees instead of paths.\n  These results extend previous works on axis-aligned covering paths of n x m grids and c","authors_text":"Bal\\'azs Keszegh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T10:24:15Z","title":"Covering Paths and Trees for Planar Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0452","kind":"arxiv","version":1},"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:16a82e57d1e53b0b109edfce3a96708ab847d1f32cf23bd28718f3ea2958151d","target":"record","created_at":"2026-05-18T03:08:05Z","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":"84c01ae573a5bfaedfe014b625a9d8f601d601d64d85c094e78c98c67a519f2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T10:24:15Z","title_canon_sha256":"e3513f94188fa02e4ce13d1e599cf2ab2bdd0a66b6fff4f1650b87696dbd95b1"},"schema_version":"1.0","source":{"id":"1311.0452","kind":"arxiv","version":1}},"canonical_sha256":"201d16080a8088c092aa98269f5efcce29024614eb790d671be8de5ce539bb1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"201d16080a8088c092aa98269f5efcce29024614eb790d671be8de5ce539bb1f","first_computed_at":"2026-05-18T03:08:05.907040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:05.907040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fetQ4+2V9CinpoJ/3XKKK1VpErWdv6I1O6BL0WSd+/GSHZuC8m2UslyH2LYurqXI11ZDoQxUkPHLhPHeGYgpCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:05.907552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16a82e57d1e53b0b109edfce3a96708ab847d1f32cf23bd28718f3ea2958151d","sha256:a3255776d9526d7e88cdf64efa843d8bd875064a03d9d626c70d212bc7094e54"],"state_sha256":"eda92333cf511e6c9e8b6b979188b3b87bf3c5ff94755eaf1512e5fa0628bbca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCmDGw1tapUpDBDeIlb5yDDoflVFy8ypvvwpm7AZd1lq6HqFNe1pWiCMgK5eE0SCqRc0h7gzM9J4ys8PGtoDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:08:55.306264Z","bundle_sha256":"52416b5ef46e38192d00ef646c2a6cc1053b05a618a0aa67d285ea0a25fa0e0e"}}