{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GIILAUGGVUK7LQ3H6GIOEFHTVT","short_pith_number":"pith:GIILAUGG","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"},"canonical_sha256":"3210b050c6ad15f5c367f190e214f3acff90d6457539bfaaa5d0dc8ef700c0c2","source":{"kind":"arxiv","id":"1404.3660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3660","created_at":"2026-05-18T02:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3660v1","created_at":"2026-05-18T02:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3660","created_at":"2026-05-18T02:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"GIILAUGGVUK7","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIILAUGGVUK7LQ3H","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIILAUGG","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GIILAUGGVUK7LQ3H6GIOEFHTVT","target":"record","payload":{"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"},"canonical_sha256":"3210b050c6ad15f5c367f190e214f3acff90d6457539bfaaa5d0dc8ef700c0c2","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"},"source_kind":"arxiv","source_id":"1404.3660","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-18T02:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYUAgBd6uTEH+UaKQgRMyFq7Y+18o6ArbGKOoENPhNzth1SQwwPQ+c8cHBxt8wQd/MS3kItU3igfDKKBx+BnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:42:57.511243Z"},"content_sha256":"b24b5f8c7b9d4be19d68f5d2f010a5398a042dc9b65d4a24ecd6ba2f53475831","schema_version":"1.0","event_id":"sha256:b24b5f8c7b9d4be19d68f5d2f010a5398a042dc9b65d4a24ecd6ba2f53475831"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GIILAUGGVUK7LQ3H6GIOEFHTVT","target":"graph","payload":{"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"},"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-18T02:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9v8j9TFY8vOo3EO+Pw+HSrUHd3BIGQDd8NdKF76GIRnKZhgmUQy0lzlc3sssePUz9yHxA8wcW0UqVuPcSh0tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:42:57.512051Z"},"content_sha256":"f22c192fbb957c13209d9776d95f1615cf0bc54c5b3325d72f1346f6701147a0","schema_version":"1.0","event_id":"sha256:f22c192fbb957c13209d9776d95f1615cf0bc54c5b3325d72f1346f6701147a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/bundle.json","state_url":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/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-01T04:42:57Z","links":{"resolver":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT","bundle":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/bundle.json","state":"https://pith.science/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIILAUGGVUK7LQ3H6GIOEFHTVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GIILAUGGVUK7LQ3H6GIOEFHTVT","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":"d17e1c663866a5a957504796fda68cba4d85535243752b351e9c3f5245679c0e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T17:28:19Z","title_canon_sha256":"8ee7baaac60ce4c982665eae6d9dec423fde8412319a7c2a3de77a9d411645e8"},"schema_version":"1.0","source":{"id":"1404.3660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3660","created_at":"2026-05-18T02:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3660v1","created_at":"2026-05-18T02:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3660","created_at":"2026-05-18T02:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"GIILAUGGVUK7","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIILAUGGVUK7LQ3H","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIILAUGG","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:f22c192fbb957c13209d9776d95f1615cf0bc54c5b3325d72f1346f6701147a0","target":"graph","created_at":"2026-05-18T02:47:44Z","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 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.","authors_text":"Andr\\'e Nichterlein, Manuel Sorge, Ren\\'e van Bevern, Sepp Hartung","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T17:28:19Z","title":"Constant-factor approximations for Capacitated Arc Routing without triangle inequality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3660","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:b24b5f8c7b9d4be19d68f5d2f010a5398a042dc9b65d4a24ecd6ba2f53475831","target":"record","created_at":"2026-05-18T02:47:44Z","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":"d17e1c663866a5a957504796fda68cba4d85535243752b351e9c3f5245679c0e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T17:28:19Z","title_canon_sha256":"8ee7baaac60ce4c982665eae6d9dec423fde8412319a7c2a3de77a9d411645e8"},"schema_version":"1.0","source":{"id":"1404.3660","kind":"arxiv","version":1}},"canonical_sha256":"3210b050c6ad15f5c367f190e214f3acff90d6457539bfaaa5d0dc8ef700c0c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3210b050c6ad15f5c367f190e214f3acff90d6457539bfaaa5d0dc8ef700c0c2","first_computed_at":"2026-05-18T02:47:44.076067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:44.076067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8vNGFfdScY/qLd2/ARBYuBurqWo+0385BWk+CsEbFbmsX8Y3rH60v0l8ptKdztABSNb6GzULD93sEAlBRkOFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:44.076780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b24b5f8c7b9d4be19d68f5d2f010a5398a042dc9b65d4a24ecd6ba2f53475831","sha256:f22c192fbb957c13209d9776d95f1615cf0bc54c5b3325d72f1346f6701147a0"],"state_sha256":"a76802181645919867595c3f24bdc59583ee1fdc0de35edd97f7d7aba37b4f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNKRFLjsYgxq2meqhf/P+viHLMwHpzC8dsKj49TLLZj7pgCc0pU9H8N4mG9PP7JNya5Ac8iwp1awN91EA7iKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:42:57.515642Z","bundle_sha256":"38f56ac87fa9a931f55a5a500b06d4e11d20c7e5a6261578dc19b5da35345eb3"}}