{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GIILAUGGVUK7LQ3H6GIOEFHTVT","short_pith_number":"pith:GIILAUGG","schema_version":"1.0","canonical_sha256":"3210b050c6ad15f5c367f190e214f3acff90d6457539bfaaa5d0dc8ef700c0c2","source":{"kind":"arxiv","id":"1404.3660","version":1},"attestation_state":"computed","paper":{"title":"Constant-factor approximations for Capacitated Arc Routing without triangle inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Manuel Sorge, Ren\\'e van Bevern, Sepp Hartung","submitted_at":"2014-04-14T17:28:19Z","abstract_excerpt":"Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all demands. Constant-factor polynomial-time approximation algorithms were proposed for CARP with triangle inequality, while CARP was claimed to be NP-hard to approximate within any constant factor in general. Correcting this claim, we show that any factor {\\alpha} approximation for CARP with triangle inequality yields a factor {\\alpha} approximation for the general CARP."},"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":"1404.3660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T17:28:19Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8ee7baaac60ce4c982665eae6d9dec423fde8412319a7c2a3de77a9d411645e8","abstract_canon_sha256":"d17e1c663866a5a957504796fda68cba4d85535243752b351e9c3f5245679c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:44.076780Z","signature_b64":"8vNGFfdScY/qLd2/ARBYuBurqWo+0385BWk+CsEbFbmsX8Y3rH60v0l8ptKdztABSNb6GzULD93sEAlBRkOFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3210b050c6ad15f5c367f190e214f3acff90d6457539bfaaa5d0dc8ef700c0c2","last_reissued_at":"2026-05-18T02:47:44.076067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:44.076067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-factor approximations for Capacitated Arc Routing without triangle inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Manuel Sorge, Ren\\'e van Bevern, Sepp Hartung","submitted_at":"2014-04-14T17:28:19Z","abstract_excerpt":"Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all demands. Constant-factor polynomial-time approximation algorithms were proposed for CARP with triangle inequality, while CARP was claimed to be NP-hard to approximate within any constant factor in general. Correcting this claim, we show that any factor {\\alpha} approximation for CARP with triangle inequality yields a factor {\\alpha} approximation for the general CARP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3660","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":"1404.3660","created_at":"2026-05-18T02:47:44.076183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3660v1","created_at":"2026-05-18T02:47:44.076183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3660","created_at":"2026-05-18T02:47:44.076183+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIILAUGGVUK7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIILAUGGVUK7LQ3H","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIILAUGG","created_at":"2026-05-18T12:28:30.664211+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/GIILAUGGVUK7LQ3H6GIOEFHTVT","json":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT.json","graph_json":"https://pith.science/api/pith-number/GIILAUGGVUK7LQ3H6GIOEFHTVT/graph.json","events_json":"https://pith.science/api/pith-number/GIILAUGGVUK7LQ3H6GIOEFHTVT/events.json","paper":"https://pith.science/paper/GIILAUGG"},"agent_actions":{"view_html":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT","download_json":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT.json","view_paper":"https://pith.science/paper/GIILAUGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3660&json=true","fetch_graph":"https://pith.science/api/pith-number/GIILAUGGVUK7LQ3H6GIOEFHTVT/graph.json","fetch_events":"https://pith.science/api/pith-number/GIILAUGGVUK7LQ3H6GIOEFHTVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/action/storage_attestation","attest_author":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/action/author_attestation","sign_citation":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/action/citation_signature","submit_replication":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/action/replication_record"}},"created_at":"2026-05-18T02:47:44.076183+00:00","updated_at":"2026-05-18T02:47:44.076183+00:00"}