{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SUMWVIJZHS2T2JH6JC4UF3ATB2","short_pith_number":"pith:SUMWVIJZ","canonical_record":{"source":{"id":"1907.09054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-21T23:46:32Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"a6b0894ec4b3c4c5d992ca20d0a8156a9a3485509bcb5dbb2d4a5b7615ea6b63","abstract_canon_sha256":"e1f156ee1b0391f8c445f487ca34a51632711059af7f89166e261ceaf49b49f7"},"schema_version":"1.0"},"canonical_sha256":"95196aa1393cb53d24fe48b942ec130ea3147b0a3fdd8ef954b5e624f3abe71c","source":{"kind":"arxiv","id":"1907.09054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09054","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09054v1","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09054","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"SUMWVIJZHS2T","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SUMWVIJZHS2T2JH6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SUMWVIJZ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SUMWVIJZHS2T2JH6JC4UF3ATB2","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-21T23:46:32Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"a6b0894ec4b3c4c5d992ca20d0a8156a9a3485509bcb5dbb2d4a5b7615ea6b63","abstract_canon_sha256":"e1f156ee1b0391f8c445f487ca34a51632711059af7f89166e261ceaf49b49f7"},"schema_version":"1.0"},"canonical_sha256":"95196aa1393cb53d24fe48b942ec130ea3147b0a3fdd8ef954b5e624f3abe71c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:02.275376Z","signature_b64":"qxWzZpI0i4W2PwrFne3FGv4lYgMwy6x2NWzTqmfHn0OQr158CHAQJW6BgcukdYYwM2tKaKZuvBikoOrNOLT0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95196aa1393cb53d24fe48b942ec130ea3147b0a3fdd8ef954b5e624f3abe71c","last_reissued_at":"2026-05-17T23:40:02.274867Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:02.274867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09054","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-17T23:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qZ/gQvSrd1iByMaJHSg7exdzftT82gVqCjpcSHYj8ZQOJLlQNJgREggxB+UA9FfsgHZTJ85e+4SYNkhm+kYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:54:14.282717Z"},"content_sha256":"538ee835ac920aa29ef60afdd8538a2e220946fd20f3d4dae828dcd302397f60","schema_version":"1.0","event_id":"sha256:538ee835ac920aa29ef60afdd8538a2e220946fd20f3d4dae828dcd302397f60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SUMWVIJZHS2T2JH6JC4UF3ATB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"David P. Williamson, Samuel C. Gutekunst","submitted_at":"2019-07-21T23:46:32Z","abstract_excerpt":"The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, e.g., algebraic connectivity, permutation matrices, and association schemes. The main results of this paper are twofold. First, de Klerk and Sotirov [9] present an SDP based on permutation matrices and symmetry reduction; they show that it is incomparable to the subtour elimination linear program, but generally dominates it on small instances. We provide a family of \\emp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09054","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-17T23:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZG/yDSsLmJpY505qNYJAKYo1+Z6ckel4YrMa/6atYwrcYD0BHDIes9xouYZ6DkNF07L97uKl+KmwBj9XzEjFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:54:14.283137Z"},"content_sha256":"e559f28136242ee2f7c305bf452e831051894c7ad5ab5aaaaf4d98ff5979cd8b","schema_version":"1.0","event_id":"sha256:e559f28136242ee2f7c305bf452e831051894c7ad5ab5aaaaf4d98ff5979cd8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2/bundle.json","state_url":"https://pith.science/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2/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-02T15:54:14Z","links":{"resolver":"https://pith.science/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2","bundle":"https://pith.science/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2/bundle.json","state":"https://pith.science/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUMWVIJZHS2T2JH6JC4UF3ATB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SUMWVIJZHS2T2JH6JC4UF3ATB2","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":"e1f156ee1b0391f8c445f487ca34a51632711059af7f89166e261ceaf49b49f7","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-21T23:46:32Z","title_canon_sha256":"a6b0894ec4b3c4c5d992ca20d0a8156a9a3485509bcb5dbb2d4a5b7615ea6b63"},"schema_version":"1.0","source":{"id":"1907.09054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09054","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09054v1","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09054","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"SUMWVIJZHS2T","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SUMWVIJZHS2T2JH6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SUMWVIJZ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:e559f28136242ee2f7c305bf452e831051894c7ad5ab5aaaaf4d98ff5979cd8b","target":"graph","created_at":"2026-05-17T23:40:02Z","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":"The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, e.g., algebraic connectivity, permutation matrices, and association schemes. The main results of this paper are twofold. First, de Klerk and Sotirov [9] present an SDP based on permutation matrices and symmetry reduction; they show that it is incomparable to the subtour elimination linear program, but generally dominates it on small instances. We provide a family of \\emp","authors_text":"David P. Williamson, Samuel C. Gutekunst","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-21T23:46:32Z","title":"Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09054","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:538ee835ac920aa29ef60afdd8538a2e220946fd20f3d4dae828dcd302397f60","target":"record","created_at":"2026-05-17T23:40:02Z","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":"e1f156ee1b0391f8c445f487ca34a51632711059af7f89166e261ceaf49b49f7","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-21T23:46:32Z","title_canon_sha256":"a6b0894ec4b3c4c5d992ca20d0a8156a9a3485509bcb5dbb2d4a5b7615ea6b63"},"schema_version":"1.0","source":{"id":"1907.09054","kind":"arxiv","version":1}},"canonical_sha256":"95196aa1393cb53d24fe48b942ec130ea3147b0a3fdd8ef954b5e624f3abe71c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95196aa1393cb53d24fe48b942ec130ea3147b0a3fdd8ef954b5e624f3abe71c","first_computed_at":"2026-05-17T23:40:02.274867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:02.274867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qxWzZpI0i4W2PwrFne3FGv4lYgMwy6x2NWzTqmfHn0OQr158CHAQJW6BgcukdYYwM2tKaKZuvBikoOrNOLT0BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:02.275376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:538ee835ac920aa29ef60afdd8538a2e220946fd20f3d4dae828dcd302397f60","sha256:e559f28136242ee2f7c305bf452e831051894c7ad5ab5aaaaf4d98ff5979cd8b"],"state_sha256":"908c1e11a2d1ce93da8ae5fd5e1833f866931be578c4e8e506aa0bcc0982913a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCs6MOfBmilNZmNYrCKaMYUCLu91jVhLwrB+vzWYlETjW0zsXnM9PKhDIMLP4l4K4ttpngJ+ClqBNQYiPhclAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:54:14.285460Z","bundle_sha256":"9c0b6f61b3d4f350c306e3ceeb0c0170dde1ed3a1f228c37a3125dcfbe734b82"}}