{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VDSNTVJO35KUBFLFCFJBIAX6ZA","short_pith_number":"pith:VDSNTVJO","canonical_record":{"source":{"id":"1401.4931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-20T15:07:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"55a6d5aeb42495c2ca06b535d2032104a85848fb18b669f02967bf1964605522","abstract_canon_sha256":"7e30c9e5e83c3f9db202f5a6e79c68b695297a8f647b127c5b462b43cdbf3bf5"},"schema_version":"1.0"},"canonical_sha256":"a8e4d9d52edf5540956511521402fec83cfe06fe376ed06912364c6a3793aba7","source":{"kind":"arxiv","id":"1401.4931","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4931","created_at":"2026-05-18T02:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4931v2","created_at":"2026-05-18T02:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4931","created_at":"2026-05-18T02:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"VDSNTVJO35KU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VDSNTVJO35KUBFLF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VDSNTVJO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VDSNTVJO35KUBFLFCFJBIAX6ZA","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-20T15:07:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"55a6d5aeb42495c2ca06b535d2032104a85848fb18b669f02967bf1964605522","abstract_canon_sha256":"7e30c9e5e83c3f9db202f5a6e79c68b695297a8f647b127c5b462b43cdbf3bf5"},"schema_version":"1.0"},"canonical_sha256":"a8e4d9d52edf5540956511521402fec83cfe06fe376ed06912364c6a3793aba7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:37.895774Z","signature_b64":"fBuCNf1nWq698UhwNKA3VugnawY2C4DjfivHMvdRi3UcX/XOSmaXr6S+JNo5VmtOPcQsjcrUZM0KcOomx4VDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e4d9d52edf5540956511521402fec83cfe06fe376ed06912364c6a3793aba7","last_reissued_at":"2026-05-18T02:03:37.895253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:37.895253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4931","source_version":2,"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:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUJZeEiEmUhxWmsDgkUIA7Au23quVmwAzyqCkwzuD3oFa7Ch8h1iF5sqmrsGp66saNiaYKMNhfsRLqO2VXBKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:15.277309Z"},"content_sha256":"a44c61af279961e2b5dbd12ed9bafe3b6f397fb34de3c6222309fda3eb3481b9","schema_version":"1.0","event_id":"sha256:a44c61af279961e2b5dbd12ed9bafe3b6f397fb34de3c6222309fda3eb3481b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VDSNTVJO35KUBFLFCFJBIAX6ZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A domination algorithm for $\\{0,1\\}$-instances of the travelling salesman problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Viresh Patel","submitted_at":"2014-01-20T15:07:35Z","abstract_excerpt":"We present an approximation algorithm for $\\{0,1\\}$-instances of the travelling salesman problem which performs well with respect to combinatorial dominance. More precisely, we give a polynomial-time algorithm which has domination ratio $1-n^{-1/29}$. In other words, given a $\\{0,1\\}$-edge-weighting of the complete graph $K_n$ on $n$ vertices, our algorithm outputs a Hamilton cycle $H^*$ of $K_n$ with the following property: the proportion of Hamilton cycles of $K_n$ whose weight is smaller than that of $H^*$ is at most $n^{-1/29}$. Our analysis is based on a martingale approach. Previously, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4931","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"},"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:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P14HrDQZ/szuNB8CrD5o01j5IwePt0D8j9g83JDFV+8noy8fftHkuL3FnZvx7ErTsJaIdn+xJ6aC+QD2RGL9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:15.277999Z"},"content_sha256":"22fb5a73b3d3b3cf254f59790d1fff270fc8a4c967e1a846d68cec70010343c0","schema_version":"1.0","event_id":"sha256:22fb5a73b3d3b3cf254f59790d1fff270fc8a4c967e1a846d68cec70010343c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA/bundle.json","state_url":"https://pith.science/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA/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-05-30T08:43:15Z","links":{"resolver":"https://pith.science/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA","bundle":"https://pith.science/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA/bundle.json","state":"https://pith.science/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDSNTVJO35KUBFLFCFJBIAX6ZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VDSNTVJO35KUBFLFCFJBIAX6ZA","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":"7e30c9e5e83c3f9db202f5a6e79c68b695297a8f647b127c5b462b43cdbf3bf5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-20T15:07:35Z","title_canon_sha256":"55a6d5aeb42495c2ca06b535d2032104a85848fb18b669f02967bf1964605522"},"schema_version":"1.0","source":{"id":"1401.4931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4931","created_at":"2026-05-18T02:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4931v2","created_at":"2026-05-18T02:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4931","created_at":"2026-05-18T02:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"VDSNTVJO35KU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VDSNTVJO35KUBFLF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VDSNTVJO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:22fb5a73b3d3b3cf254f59790d1fff270fc8a4c967e1a846d68cec70010343c0","target":"graph","created_at":"2026-05-18T02:03:37Z","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":"We present an approximation algorithm for $\\{0,1\\}$-instances of the travelling salesman problem which performs well with respect to combinatorial dominance. More precisely, we give a polynomial-time algorithm which has domination ratio $1-n^{-1/29}$. In other words, given a $\\{0,1\\}$-edge-weighting of the complete graph $K_n$ on $n$ vertices, our algorithm outputs a Hamilton cycle $H^*$ of $K_n$ with the following property: the proportion of Hamilton cycles of $K_n$ whose weight is smaller than that of $H^*$ is at most $n^{-1/29}$. Our analysis is based on a martingale approach. Previously, t","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Viresh Patel","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-20T15:07:35Z","title":"A domination algorithm for $\\{0,1\\}$-instances of the travelling salesman problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4931","kind":"arxiv","version":2},"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:a44c61af279961e2b5dbd12ed9bafe3b6f397fb34de3c6222309fda3eb3481b9","target":"record","created_at":"2026-05-18T02:03:37Z","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":"7e30c9e5e83c3f9db202f5a6e79c68b695297a8f647b127c5b462b43cdbf3bf5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-20T15:07:35Z","title_canon_sha256":"55a6d5aeb42495c2ca06b535d2032104a85848fb18b669f02967bf1964605522"},"schema_version":"1.0","source":{"id":"1401.4931","kind":"arxiv","version":2}},"canonical_sha256":"a8e4d9d52edf5540956511521402fec83cfe06fe376ed06912364c6a3793aba7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8e4d9d52edf5540956511521402fec83cfe06fe376ed06912364c6a3793aba7","first_computed_at":"2026-05-18T02:03:37.895253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:37.895253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fBuCNf1nWq698UhwNKA3VugnawY2C4DjfivHMvdRi3UcX/XOSmaXr6S+JNo5VmtOPcQsjcrUZM0KcOomx4VDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:37.895774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a44c61af279961e2b5dbd12ed9bafe3b6f397fb34de3c6222309fda3eb3481b9","sha256:22fb5a73b3d3b3cf254f59790d1fff270fc8a4c967e1a846d68cec70010343c0"],"state_sha256":"eeb26a6a67410903c327cced402f44d62df40f25772f48b7ce1f3cbbcde061ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+/yio/hh49mJjATE/v0NUIKMvGpGBvbUieoo/rGee2SDG8zLqPNo0ljY7/eQVH8vvIaQH0El7fJe2M2gJOdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:43:15.281176Z","bundle_sha256":"d8c6468cb46d0e120883425e6f4c980cc933b2fbf569fab8fdc588c5fe0dd76a"}}