{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BGXIPNUQDF4K5TKXX7OYYTCQOG","short_pith_number":"pith:BGXIPNUQ","schema_version":"1.0","canonical_sha256":"09ae87b6901978aecd57bfdd8c4c5071bbcd9612d38c2c2724706bded98f47ac","source":{"kind":"arxiv","id":"1304.6800","version":2},"attestation_state":"computed","paper":{"title":"Approximation Hardness of Graphic TSP on Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"Marek Karpinski, Richard Schmied","submitted_at":"2013-04-25T05:07:16Z","abstract_excerpt":"We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest."},"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":"1304.6800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-25T05:07:16Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.OC"],"title_canon_sha256":"ffffc774810bad9df58310e46eb16b14086e95ebade4aa146a2f91495f11c0ea","abstract_canon_sha256":"e40d4d3a5075d1c9c92b6f4a76a1acc57e7968fedb45f7bc241d01cafc658e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:45.558495Z","signature_b64":"ffp1XjEo4ZWsrTcBJJB5KrmfZ734TF0sQeW5W+o+0Wec5ynLBJRP4jlT6zoe8vCPLblQM3CbalJjbiPLAiXaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09ae87b6901978aecd57bfdd8c4c5071bbcd9612d38c2c2724706bded98f47ac","last_reissued_at":"2026-05-18T03:25:45.557556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:45.557556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Hardness of Graphic TSP on Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"Marek Karpinski, Richard Schmied","submitted_at":"2013-04-25T05:07:16Z","abstract_excerpt":"We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6800","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.6800","created_at":"2026-05-18T03:25:45.557703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6800v2","created_at":"2026-05-18T03:25:45.557703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6800","created_at":"2026-05-18T03:25:45.557703+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGXIPNUQDF4K","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGXIPNUQDF4K5TKX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGXIPNUQ","created_at":"2026-05-18T12:27:38.830355+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/BGXIPNUQDF4K5TKXX7OYYTCQOG","json":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG.json","graph_json":"https://pith.science/api/pith-number/BGXIPNUQDF4K5TKXX7OYYTCQOG/graph.json","events_json":"https://pith.science/api/pith-number/BGXIPNUQDF4K5TKXX7OYYTCQOG/events.json","paper":"https://pith.science/paper/BGXIPNUQ"},"agent_actions":{"view_html":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG","download_json":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG.json","view_paper":"https://pith.science/paper/BGXIPNUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6800&json=true","fetch_graph":"https://pith.science/api/pith-number/BGXIPNUQDF4K5TKXX7OYYTCQOG/graph.json","fetch_events":"https://pith.science/api/pith-number/BGXIPNUQDF4K5TKXX7OYYTCQOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG/action/storage_attestation","attest_author":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG/action/author_attestation","sign_citation":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG/action/citation_signature","submit_replication":"https://pith.science/pith/BGXIPNUQDF4K5TKXX7OYYTCQOG/action/replication_record"}},"created_at":"2026-05-18T03:25:45.557703+00:00","updated_at":"2026-05-18T03:25:45.557703+00:00"}