{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NLXRY5LUTOTRZ725YGEF4KKIRE","short_pith_number":"pith:NLXRY5LU","canonical_record":{"source":{"id":"1808.04417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T19:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"3690d2c1bf3d8dda68e497515bc52a30751472346a3e13d68837d9386f15a1da","abstract_canon_sha256":"a807442a288278874fe478742c3b612356da05725b54fcc46d3de1a2cc11e858"},"schema_version":"1.0"},"canonical_sha256":"6aef1c75749ba71cff5dc1885e2948891f5b889aeaf5bfd58bcffc50327ac197","source":{"kind":"arxiv","id":"1808.04417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04417","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04417v2","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04417","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"pith_short_12","alias_value":"NLXRY5LUTOTR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLXRY5LUTOTRZ725","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLXRY5LU","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NLXRY5LUTOTRZ725YGEF4KKIRE","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T19:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"3690d2c1bf3d8dda68e497515bc52a30751472346a3e13d68837d9386f15a1da","abstract_canon_sha256":"a807442a288278874fe478742c3b612356da05725b54fcc46d3de1a2cc11e858"},"schema_version":"1.0"},"canonical_sha256":"6aef1c75749ba71cff5dc1885e2948891f5b889aeaf5bfd58bcffc50327ac197","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:48.811959Z","signature_b64":"KSWfZz4gCZ5xU/8S7grTclLFRJ5/HLmWwVDQxjb7zM8jD4UQPu0xBClfFkjtQ2jfv6PKQLwMCVMIsT9nu6ZnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aef1c75749ba71cff5dc1885e2948891f5b889aeaf5bfd58bcffc50327ac197","last_reissued_at":"2026-05-17T23:47:48.811407Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:48.811407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04417","source_version":2,"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-17T23:47:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hv+ADplpIdaxn2nId5AaCry1HiezyOBxIa4FbOQX1yWN6H53295RH4EFHzG/rAYQbCJDuraS/OzkaNUQndMhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:17:59.226380Z"},"content_sha256":"74ffd8bdecf2e944b21ac09da7d488f90a9bfac4afbbceddcdc4b53c135bdbdb","schema_version":"1.0","event_id":"sha256:74ffd8bdecf2e944b21ac09da7d488f90a9bfac4afbbceddcdc4b53c135bdbdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NLXRY5LUTOTRZ725YGEF4KKIRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dominik Krupke, S\\'andor P. Fekete","submitted_at":"2018-08-13T19:38:21Z","abstract_excerpt":"We investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results as well as open problems dating back to work by Arkin et al. in 2001. A wide spectrum of practical applications have renewed the interest in these questions, and spawned variants: for full coverage, every point has to be covered, for subset coverage, specific points have to be covered, and for penalty coverage, points may be left uncovered by incurring an individual penalty.\n  We make a number of contribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04417","kind":"arxiv","version":2},"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-17T23:47:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5F88lcBqA47P1ulvoPV8e1OubtTygiwKtdyzV3eej8oQwgzibwC1ruhh9YiauDSivhfmcJuJwaG9SmM8TsuPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:17:59.226751Z"},"content_sha256":"391b54614d9b855c0eb859e44eff7ece84bc6fa23fcefb781ba3a995bbb35fb8","schema_version":"1.0","event_id":"sha256:391b54614d9b855c0eb859e44eff7ece84bc6fa23fcefb781ba3a995bbb35fb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLXRY5LUTOTRZ725YGEF4KKIRE/bundle.json","state_url":"https://pith.science/pith/NLXRY5LUTOTRZ725YGEF4KKIRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLXRY5LUTOTRZ725YGEF4KKIRE/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-27T23:17:59Z","links":{"resolver":"https://pith.science/pith/NLXRY5LUTOTRZ725YGEF4KKIRE","bundle":"https://pith.science/pith/NLXRY5LUTOTRZ725YGEF4KKIRE/bundle.json","state":"https://pith.science/pith/NLXRY5LUTOTRZ725YGEF4KKIRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLXRY5LUTOTRZ725YGEF4KKIRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NLXRY5LUTOTRZ725YGEF4KKIRE","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":"a807442a288278874fe478742c3b612356da05725b54fcc46d3de1a2cc11e858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T19:38:21Z","title_canon_sha256":"3690d2c1bf3d8dda68e497515bc52a30751472346a3e13d68837d9386f15a1da"},"schema_version":"1.0","source":{"id":"1808.04417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04417","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04417v2","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04417","created_at":"2026-05-17T23:47:48Z"},{"alias_kind":"pith_short_12","alias_value":"NLXRY5LUTOTR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLXRY5LUTOTRZ725","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLXRY5LU","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:391b54614d9b855c0eb859e44eff7ece84bc6fa23fcefb781ba3a995bbb35fb8","target":"graph","created_at":"2026-05-17T23:47:48Z","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 investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results as well as open problems dating back to work by Arkin et al. in 2001. A wide spectrum of practical applications have renewed the interest in these questions, and spawned variants: for full coverage, every point has to be covered, for subset coverage, specific points have to be covered, and for penalty coverage, points may be left uncovered by incurring an individual penalty.\n  We make a number of contribut","authors_text":"Dominik Krupke, S\\'andor P. Fekete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T19:38:21Z","title":"Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04417","kind":"arxiv","version":2},"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:74ffd8bdecf2e944b21ac09da7d488f90a9bfac4afbbceddcdc4b53c135bdbdb","target":"record","created_at":"2026-05-17T23:47:48Z","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":"a807442a288278874fe478742c3b612356da05725b54fcc46d3de1a2cc11e858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T19:38:21Z","title_canon_sha256":"3690d2c1bf3d8dda68e497515bc52a30751472346a3e13d68837d9386f15a1da"},"schema_version":"1.0","source":{"id":"1808.04417","kind":"arxiv","version":2}},"canonical_sha256":"6aef1c75749ba71cff5dc1885e2948891f5b889aeaf5bfd58bcffc50327ac197","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aef1c75749ba71cff5dc1885e2948891f5b889aeaf5bfd58bcffc50327ac197","first_computed_at":"2026-05-17T23:47:48.811407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:48.811407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSWfZz4gCZ5xU/8S7grTclLFRJ5/HLmWwVDQxjb7zM8jD4UQPu0xBClfFkjtQ2jfv6PKQLwMCVMIsT9nu6ZnDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:48.811959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74ffd8bdecf2e944b21ac09da7d488f90a9bfac4afbbceddcdc4b53c135bdbdb","sha256:391b54614d9b855c0eb859e44eff7ece84bc6fa23fcefb781ba3a995bbb35fb8"],"state_sha256":"ae2ccaf2f8a00da5ae7b5209c9292c174a9ac8558adab8e550c8da34d48a7afb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2wFLL1N61KMO50gYYJJFWpOpMer8RdPzl8jooYKLWIDMByCyyPgbJ4xt6iwJifWf0rqc5YvJK0tzgdLXdZfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:17:59.229195Z","bundle_sha256":"2139d340a9be0a7dd63e625b0865989ff9718b3bdb050a6ee54f7d3d2421cbef"}}