{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7WRUSRMIBNVYT5QD7Y2DESK3ZM","short_pith_number":"pith:7WRUSRMI","canonical_record":{"source":{"id":"1312.2502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T16:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"8b23e3505dc83b3bc37fe6c1607547fd925ac28ebb33ea10603f053a531067c9","abstract_canon_sha256":"2006c471ad784bd86000e4d48da7afdc4aed13f0cc8ea908386e81777524013f"},"schema_version":"1.0"},"canonical_sha256":"fda34945880b6b89f603fe3432495bcb069f7237af4935be24be52bd5720706a","source":{"kind":"arxiv","id":"1312.2502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2502","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2502v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2502","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"7WRUSRMIBNVY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WRUSRMIBNVYT5QD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WRUSRMI","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7WRUSRMIBNVYT5QD7Y2DESK3ZM","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T16:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"8b23e3505dc83b3bc37fe6c1607547fd925ac28ebb33ea10603f053a531067c9","abstract_canon_sha256":"2006c471ad784bd86000e4d48da7afdc4aed13f0cc8ea908386e81777524013f"},"schema_version":"1.0"},"canonical_sha256":"fda34945880b6b89f603fe3432495bcb069f7237af4935be24be52bd5720706a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:20.005776Z","signature_b64":"Wytay83Vag6yfusL1KfPDDShx1uYgR3IXKk4ixhaLNHS1CN/oRjrcAkXwCp+tW3KgsYZPSxZhK56IgL1ktloBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda34945880b6b89f603fe3432495bcb069f7237af4935be24be52bd5720706a","last_reissued_at":"2026-05-18T02:20:20.005239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:20.005239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2502","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:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7JgVDjRcvG91SFO5pEA7/6UWqczRTFxaQKyjj83ojr+g7FLicX0XtA0wyAy/0oD4yL4wiZga8r3WqHywEg5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:13:46.145731Z"},"content_sha256":"8bf48d2afd8718ccb3b55494b66f59047f7b9862ffd00c1339858f17ea1d7da2","schema_version":"1.0","event_id":"sha256:8bf48d2afd8718ccb3b55494b66f59047f7b9862ffd00c1339858f17ea1d7da2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7WRUSRMIBNVYT5QD7Y2DESK3ZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved integrality gap upper bounds for TSP with distances one and two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matthias Mnich, Tobias M\\\"omke","submitted_at":"2013-12-09T16:30:44Z","abstract_excerpt":"We study the structure of solutions to linear programming formulations for the traveling salesperson problem (TSP).\n  We perform a detailed analysis of the support of the subtour elimination linear programming relaxation, which leads to algorithms that find 2-matchings with few components in polynomial time. The number of components directly leads to integrality gap upper bounds for the TSP with distances one and two, for both undirected and directed graphs.\n  Our main results concern the subtour elimination relaxation with one additional cutting plane inequality:\n  - For undirected instances "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2502","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:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDmLK5NtthTm7obFB2kgvTPZyV8DcTiwfvwywodW7u26SoyhwyvPrK8UoG23IEPTQcD7Ac9vMxy2o5ACrLeUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:13:46.146082Z"},"content_sha256":"bf82d5300d7b044cf8184fb5fa4e30e2a82d7ee8ab58de48277ac92475576d86","schema_version":"1.0","event_id":"sha256:bf82d5300d7b044cf8184fb5fa4e30e2a82d7ee8ab58de48277ac92475576d86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM/bundle.json","state_url":"https://pith.science/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM/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-28T15:13:46Z","links":{"resolver":"https://pith.science/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM","bundle":"https://pith.science/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM/bundle.json","state":"https://pith.science/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WRUSRMIBNVYT5QD7Y2DESK3ZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7WRUSRMIBNVYT5QD7Y2DESK3ZM","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":"2006c471ad784bd86000e4d48da7afdc4aed13f0cc8ea908386e81777524013f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T16:30:44Z","title_canon_sha256":"8b23e3505dc83b3bc37fe6c1607547fd925ac28ebb33ea10603f053a531067c9"},"schema_version":"1.0","source":{"id":"1312.2502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2502","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2502v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2502","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"7WRUSRMIBNVY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WRUSRMIBNVYT5QD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WRUSRMI","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:bf82d5300d7b044cf8184fb5fa4e30e2a82d7ee8ab58de48277ac92475576d86","target":"graph","created_at":"2026-05-18T02:20:20Z","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 study the structure of solutions to linear programming formulations for the traveling salesperson problem (TSP).\n  We perform a detailed analysis of the support of the subtour elimination linear programming relaxation, which leads to algorithms that find 2-matchings with few components in polynomial time. The number of components directly leads to integrality gap upper bounds for the TSP with distances one and two, for both undirected and directed graphs.\n  Our main results concern the subtour elimination relaxation with one additional cutting plane inequality:\n  - For undirected instances ","authors_text":"Matthias Mnich, Tobias M\\\"omke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T16:30:44Z","title":"Improved integrality gap upper bounds for TSP with distances one and two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2502","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:8bf48d2afd8718ccb3b55494b66f59047f7b9862ffd00c1339858f17ea1d7da2","target":"record","created_at":"2026-05-18T02:20:20Z","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":"2006c471ad784bd86000e4d48da7afdc4aed13f0cc8ea908386e81777524013f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T16:30:44Z","title_canon_sha256":"8b23e3505dc83b3bc37fe6c1607547fd925ac28ebb33ea10603f053a531067c9"},"schema_version":"1.0","source":{"id":"1312.2502","kind":"arxiv","version":2}},"canonical_sha256":"fda34945880b6b89f603fe3432495bcb069f7237af4935be24be52bd5720706a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fda34945880b6b89f603fe3432495bcb069f7237af4935be24be52bd5720706a","first_computed_at":"2026-05-18T02:20:20.005239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:20.005239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wytay83Vag6yfusL1KfPDDShx1uYgR3IXKk4ixhaLNHS1CN/oRjrcAkXwCp+tW3KgsYZPSxZhK56IgL1ktloBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:20.005776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bf48d2afd8718ccb3b55494b66f59047f7b9862ffd00c1339858f17ea1d7da2","sha256:bf82d5300d7b044cf8184fb5fa4e30e2a82d7ee8ab58de48277ac92475576d86"],"state_sha256":"e46519dfdcc1b15f73ec7b30bf396165f7aac6727a1acfcf57285d44e8419fb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmqNBwvIkNLTZnN4YfQJv5EfLL5AiWnHfAKfXwbbr+D7g6PjeFvPiWQ6BH+1QjrQVC9iton/R9s3qYMj2Nv9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:13:46.148148Z","bundle_sha256":"23e8fb944df9f6c471df0bb661ce49897721e68f295475d5bf2cecd30aedc53a"}}