{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JR4L2TCOOTOIOMRRRJEV4D7567","short_pith_number":"pith:JR4L2TCO","schema_version":"1.0","canonical_sha256":"4c78bd4c4e74dc8732318a495e0ffdf7fa2981788869bef739506a87ff72413d","source":{"kind":"arxiv","id":"1506.06369","version":2},"attestation_state":"computed","paper":{"title":"Cubic TSP - a 1.3-approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Barbora Candr\\'akov\\'a, Robert Luko\\v{t}ka","submitted_at":"2015-06-21T14:15:57Z","abstract_excerpt":"We prove that every simple bridgeless cubic graph with n >= 8 vertices has a travelling salesman tour of length at most 1.3n - 2, which can be constructed in polynomial time."},"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":"1506.06369","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-21T14:15:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b0d546aea5916ec458749c400bc44cdb4abe64fe77d5788ad9849d5e37c900a0","abstract_canon_sha256":"a9d899e0a4e0c2af65b6dc3f0c7eeacd1e6ee5978feb1202c163487263d8c010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:31.092706Z","signature_b64":"v9uASrid5Nug93bsIAICQmIG57uKiQWUEOC+XcgugkaeAOdmCi3wvJTrZcDBA5ZMikjqSJvjjnFxBwv4ReIrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c78bd4c4e74dc8732318a495e0ffdf7fa2981788869bef739506a87ff72413d","last_reissued_at":"2026-05-18T01:02:31.092095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:31.092095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cubic TSP - a 1.3-approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Barbora Candr\\'akov\\'a, Robert Luko\\v{t}ka","submitted_at":"2015-06-21T14:15:57Z","abstract_excerpt":"We prove that every simple bridgeless cubic graph with n >= 8 vertices has a travelling salesman tour of length at most 1.3n - 2, which can be constructed in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06369","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":"1506.06369","created_at":"2026-05-18T01:02:31.092185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06369v2","created_at":"2026-05-18T01:02:31.092185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06369","created_at":"2026-05-18T01:02:31.092185+00:00"},{"alias_kind":"pith_short_12","alias_value":"JR4L2TCOOTOI","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JR4L2TCOOTOIOMRR","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JR4L2TCO","created_at":"2026-05-18T12:29:27.538025+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/JR4L2TCOOTOIOMRRRJEV4D7567","json":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567.json","graph_json":"https://pith.science/api/pith-number/JR4L2TCOOTOIOMRRRJEV4D7567/graph.json","events_json":"https://pith.science/api/pith-number/JR4L2TCOOTOIOMRRRJEV4D7567/events.json","paper":"https://pith.science/paper/JR4L2TCO"},"agent_actions":{"view_html":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567","download_json":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567.json","view_paper":"https://pith.science/paper/JR4L2TCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06369&json=true","fetch_graph":"https://pith.science/api/pith-number/JR4L2TCOOTOIOMRRRJEV4D7567/graph.json","fetch_events":"https://pith.science/api/pith-number/JR4L2TCOOTOIOMRRRJEV4D7567/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567/action/storage_attestation","attest_author":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567/action/author_attestation","sign_citation":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567/action/citation_signature","submit_replication":"https://pith.science/pith/JR4L2TCOOTOIOMRRRJEV4D7567/action/replication_record"}},"created_at":"2026-05-18T01:02:31.092185+00:00","updated_at":"2026-05-18T01:02:31.092185+00:00"}