{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XSILF6JETQXQ63FO6WRVKEQTTQ","short_pith_number":"pith:XSILF6JE","canonical_record":{"source":{"id":"1901.09154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-26T03:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"ab9ab46422019cbacd9c6275f26e23333257f5d23165ba8eb5f83d5782cce1ea","abstract_canon_sha256":"b843f05cb561ed84e695858c7afae353a0474f37a75924ae0f51b50d8025e2f1"},"schema_version":"1.0"},"canonical_sha256":"bc90b2f9249c2f0f6caef5a35512139c2efff291cbacdde7ea428b1ad3af0dd5","source":{"kind":"arxiv","id":"1901.09154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09154","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09154v1","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09154","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"XSILF6JETQXQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XSILF6JETQXQ63FO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XSILF6JE","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XSILF6JETQXQ63FO6WRVKEQTTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-26T03:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"ab9ab46422019cbacd9c6275f26e23333257f5d23165ba8eb5f83d5782cce1ea","abstract_canon_sha256":"b843f05cb561ed84e695858c7afae353a0474f37a75924ae0f51b50d8025e2f1"},"schema_version":"1.0"},"canonical_sha256":"bc90b2f9249c2f0f6caef5a35512139c2efff291cbacdde7ea428b1ad3af0dd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:30.391184Z","signature_b64":"EkDnL4WMeUgEbbfU8zkBJndCfOguUKNR4xukt+2RSM8v+VRqM/3F9/Ve57wNhQtWvUW3pi5jyOqdZm5cv0o8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc90b2f9249c2f0f6caef5a35512139c2efff291cbacdde7ea428b1ad3af0dd5","last_reissued_at":"2026-05-17T23:55:30.390740Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:30.390740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09154","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-17T23:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMKmX/q/UbQEnJxzFEEV27j/FB6YH5W5wmfH66+lnWe9thmK0FicH1MzEaRD+2RVVew6gyWrJgm8LT7FPXTFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:17:55.352636Z"},"content_sha256":"37a90f50951059d18b368a13e6fa0c99fe2039d37d8ab1ead090cf90e9f984a5","schema_version":"1.0","event_id":"sha256:37a90f50951059d18b368a13e6fa0c99fe2039d37d8ab1ead090cf90e9f984a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XSILF6JETQXQ63FO6WRVKEQTTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Star Routing: Between Vehicle Routing and Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diego Delle Donne, Guido Tagliavini","submitted_at":"2019-01-26T03:52:03Z","abstract_excerpt":"We consider an optimization problem posed by an actual newspaper company, which consists of computing a minimum length route for a delivery truck, such that the driver only stops at street crossings, each time delivering copies to all customers adjacent to the crossing. This can be modeled as an abstract problem that takes an unweighted simple graph $G = (V, E)$ and a subset of edges $X$ and asks for a shortest cycle, not necessarily simple, such that every edge of $X$ has an endpoint in the cycle.\n  We show that the decision version of the problem is strongly NP-complete, even if $G$ is a gri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09154","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-17T23:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HcbRRJBjmUFWOEGD0B0NfbJJ6LHpiV50dpgiykwa9wAta114cJcuvJJ0PYg612+6lzhNPuuxrtEKVGLDge8WBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:17:55.353037Z"},"content_sha256":"ab2ec6bbb1539721d329b1a87bdad7ba8f10ee8c6d46814fe6cf882085287432","schema_version":"1.0","event_id":"sha256:ab2ec6bbb1539721d329b1a87bdad7ba8f10ee8c6d46814fe6cf882085287432"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/bundle.json","state_url":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/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-06-05T22:17:55Z","links":{"resolver":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ","bundle":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/bundle.json","state":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XSILF6JETQXQ63FO6WRVKEQTTQ","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":"b843f05cb561ed84e695858c7afae353a0474f37a75924ae0f51b50d8025e2f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-26T03:52:03Z","title_canon_sha256":"ab9ab46422019cbacd9c6275f26e23333257f5d23165ba8eb5f83d5782cce1ea"},"schema_version":"1.0","source":{"id":"1901.09154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09154","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09154v1","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09154","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"XSILF6JETQXQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XSILF6JETQXQ63FO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XSILF6JE","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:ab2ec6bbb1539721d329b1a87bdad7ba8f10ee8c6d46814fe6cf882085287432","target":"graph","created_at":"2026-05-17T23:55:30Z","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 an optimization problem posed by an actual newspaper company, which consists of computing a minimum length route for a delivery truck, such that the driver only stops at street crossings, each time delivering copies to all customers adjacent to the crossing. This can be modeled as an abstract problem that takes an unweighted simple graph $G = (V, E)$ and a subset of edges $X$ and asks for a shortest cycle, not necessarily simple, such that every edge of $X$ has an endpoint in the cycle.\n  We show that the decision version of the problem is strongly NP-complete, even if $G$ is a gri","authors_text":"Diego Delle Donne, Guido Tagliavini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-26T03:52:03Z","title":"Star Routing: Between Vehicle Routing and Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09154","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:37a90f50951059d18b368a13e6fa0c99fe2039d37d8ab1ead090cf90e9f984a5","target":"record","created_at":"2026-05-17T23:55:30Z","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":"b843f05cb561ed84e695858c7afae353a0474f37a75924ae0f51b50d8025e2f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-26T03:52:03Z","title_canon_sha256":"ab9ab46422019cbacd9c6275f26e23333257f5d23165ba8eb5f83d5782cce1ea"},"schema_version":"1.0","source":{"id":"1901.09154","kind":"arxiv","version":1}},"canonical_sha256":"bc90b2f9249c2f0f6caef5a35512139c2efff291cbacdde7ea428b1ad3af0dd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc90b2f9249c2f0f6caef5a35512139c2efff291cbacdde7ea428b1ad3af0dd5","first_computed_at":"2026-05-17T23:55:30.390740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:30.390740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkDnL4WMeUgEbbfU8zkBJndCfOguUKNR4xukt+2RSM8v+VRqM/3F9/Ve57wNhQtWvUW3pi5jyOqdZm5cv0o8DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:30.391184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37a90f50951059d18b368a13e6fa0c99fe2039d37d8ab1ead090cf90e9f984a5","sha256:ab2ec6bbb1539721d329b1a87bdad7ba8f10ee8c6d46814fe6cf882085287432"],"state_sha256":"48987f02cc3820cf759e62ca2da94b843d2bfb7ded4d293f4242757c52ba8f34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoo2uETpJQPwYtw5dCR2Tl8FXQgCcI53NkuwpR2iFdd35GnxedgFBKGvW0PeUxItxV7jgAWHCbMPAq5Wrg+NCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:17:55.356255Z","bundle_sha256":"b850006609f2bc764d7657d70f89bd4c7d16499445517975206e1dffd5da286c"}}