{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XSILF6JETQXQ63FO6WRVKEQTTQ","short_pith_number":"pith:XSILF6JE","schema_version":"1.0","canonical_sha256":"bc90b2f9249c2f0f6caef5a35512139c2efff291cbacdde7ea428b1ad3af0dd5","source":{"kind":"arxiv","id":"1901.09154","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.09154","created_at":"2026-05-17T23:55:30.390808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09154v1","created_at":"2026-05-17T23:55:30.390808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09154","created_at":"2026-05-17T23:55:30.390808+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSILF6JETQXQ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSILF6JETQXQ63FO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSILF6JE","created_at":"2026-05-18T12:33:33.725879+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/XSILF6JETQXQ63FO6WRVKEQTTQ","json":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ.json","graph_json":"https://pith.science/api/pith-number/XSILF6JETQXQ63FO6WRVKEQTTQ/graph.json","events_json":"https://pith.science/api/pith-number/XSILF6JETQXQ63FO6WRVKEQTTQ/events.json","paper":"https://pith.science/paper/XSILF6JE"},"agent_actions":{"view_html":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ","download_json":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ.json","view_paper":"https://pith.science/paper/XSILF6JE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09154&json=true","fetch_graph":"https://pith.science/api/pith-number/XSILF6JETQXQ63FO6WRVKEQTTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XSILF6JETQXQ63FO6WRVKEQTTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/action/storage_attestation","attest_author":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/action/author_attestation","sign_citation":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/action/citation_signature","submit_replication":"https://pith.science/pith/XSILF6JETQXQ63FO6WRVKEQTTQ/action/replication_record"}},"created_at":"2026-05-17T23:55:30.390808+00:00","updated_at":"2026-05-17T23:55:30.390808+00:00"}