{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B24V2HCG46Z4VFOFRPFLZZALHN","short_pith_number":"pith:B24V2HCG","canonical_record":{"source":{"id":"1907.11669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-26T16:34:00Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"f998d6e25099c42c1283f72cd865fe86c425fd6837d75a17a14fd23266d787b0","abstract_canon_sha256":"55ab62c3f7eda73fe88ac37e96131f751e16fba1854a1c1b80af2dbe5622081f"},"schema_version":"1.0"},"canonical_sha256":"0eb95d1c46e7b3ca95c58bcabce40b3b623a8f09651ca94096ccbe676fae1468","source":{"kind":"arxiv","id":"1907.11669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11669","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11669v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11669","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"B24V2HCG46Z4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B24V2HCG46Z4VFOF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B24V2HCG","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B24V2HCG46Z4VFOFRPFLZZALHN","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-26T16:34:00Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"f998d6e25099c42c1283f72cd865fe86c425fd6837d75a17a14fd23266d787b0","abstract_canon_sha256":"55ab62c3f7eda73fe88ac37e96131f751e16fba1854a1c1b80af2dbe5622081f"},"schema_version":"1.0"},"canonical_sha256":"0eb95d1c46e7b3ca95c58bcabce40b3b623a8f09651ca94096ccbe676fae1468","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:28.299949Z","signature_b64":"fX/Jmc2Aj5Xvips4u9vQDu5RfT+MRVFxExX53o+fIcig5upTSY2RU8N78lHj2So14CM0b7tVLfiqyLnm5qeYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb95d1c46e7b3ca95c58bcabce40b3b623a8f09651ca94096ccbe676fae1468","last_reissued_at":"2026-05-17T23:39:28.299338Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:28.299338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11669","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:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWPtNIuv0HFHYjQo/GJCDv31uX+b4dOhZJP4QEWe7EeKfnOdaxoF4sB+xnHi+N7NOQvrbOrmbqlrvgnKl0YoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:58:05.072538Z"},"content_sha256":"f62704d3c438e21f4ef578b583562a950be91b3fbfc260d6cb2973dba33838cc","schema_version":"1.0","event_id":"sha256:f62704d3c438e21f4ef578b583562a950be91b3fbfc260d6cb2973dba33838cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B24V2HCG46Z4VFOFRPFLZZALHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.DM","authors_text":"David P. Williamson, Samuel C. Gutekunst","submitted_at":"2019-07-26T16:34:00Z","abstract_excerpt":"De Klerk, Pasechnik, and Sotirov give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree Theorem. This constraint says that the aggregate weight of all spanning trees in a solution to a TSP relaxation is at least that of a cycle graph. In this note, we show that the semidefinite constraint holds for any weighted 2-edge-connected graph and, in particular, is implied by the subtour elimination constraints of the subtour elimination linear program. Hence, this semidefinite constraint is implied by a finite set of linear inequality constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11669","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:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgPUOIjr/NOcy31uJFJbhkMyOX6OR6YB4CCh6+y3A/L4rC2fIluHW/3/iQ32UW+TtxvBzEDjpat4C5PA0csbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:58:05.073194Z"},"content_sha256":"e80d293f01e112f8439956e8604e625779fbb6f868763faac42a891f61ff70d6","schema_version":"1.0","event_id":"sha256:e80d293f01e112f8439956e8604e625779fbb6f868763faac42a891f61ff70d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B24V2HCG46Z4VFOFRPFLZZALHN/bundle.json","state_url":"https://pith.science/pith/B24V2HCG46Z4VFOFRPFLZZALHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B24V2HCG46Z4VFOFRPFLZZALHN/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-02T14:58:05Z","links":{"resolver":"https://pith.science/pith/B24V2HCG46Z4VFOFRPFLZZALHN","bundle":"https://pith.science/pith/B24V2HCG46Z4VFOFRPFLZZALHN/bundle.json","state":"https://pith.science/pith/B24V2HCG46Z4VFOFRPFLZZALHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B24V2HCG46Z4VFOFRPFLZZALHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B24V2HCG46Z4VFOFRPFLZZALHN","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":"55ab62c3f7eda73fe88ac37e96131f751e16fba1854a1c1b80af2dbe5622081f","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-26T16:34:00Z","title_canon_sha256":"f998d6e25099c42c1283f72cd865fe86c425fd6837d75a17a14fd23266d787b0"},"schema_version":"1.0","source":{"id":"1907.11669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11669","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11669v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11669","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"B24V2HCG46Z4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B24V2HCG46Z4VFOF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B24V2HCG","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:e80d293f01e112f8439956e8604e625779fbb6f868763faac42a891f61ff70d6","target":"graph","created_at":"2026-05-17T23:39:28Z","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":"De Klerk, Pasechnik, and Sotirov give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree Theorem. This constraint says that the aggregate weight of all spanning trees in a solution to a TSP relaxation is at least that of a cycle graph. In this note, we show that the semidefinite constraint holds for any weighted 2-edge-connected graph and, in particular, is implied by the subtour elimination constraints of the subtour elimination linear program. Hence, this semidefinite constraint is implied by a finite set of linear inequality constraints.","authors_text":"David P. Williamson, Samuel C. Gutekunst","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-26T16:34:00Z","title":"Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11669","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:f62704d3c438e21f4ef578b583562a950be91b3fbfc260d6cb2973dba33838cc","target":"record","created_at":"2026-05-17T23:39:28Z","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":"55ab62c3f7eda73fe88ac37e96131f751e16fba1854a1c1b80af2dbe5622081f","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-26T16:34:00Z","title_canon_sha256":"f998d6e25099c42c1283f72cd865fe86c425fd6837d75a17a14fd23266d787b0"},"schema_version":"1.0","source":{"id":"1907.11669","kind":"arxiv","version":1}},"canonical_sha256":"0eb95d1c46e7b3ca95c58bcabce40b3b623a8f09651ca94096ccbe676fae1468","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eb95d1c46e7b3ca95c58bcabce40b3b623a8f09651ca94096ccbe676fae1468","first_computed_at":"2026-05-17T23:39:28.299338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:28.299338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fX/Jmc2Aj5Xvips4u9vQDu5RfT+MRVFxExX53o+fIcig5upTSY2RU8N78lHj2So14CM0b7tVLfiqyLnm5qeYDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:28.299949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f62704d3c438e21f4ef578b583562a950be91b3fbfc260d6cb2973dba33838cc","sha256:e80d293f01e112f8439956e8604e625779fbb6f868763faac42a891f61ff70d6"],"state_sha256":"5e9303080797eb1f11b16c1958bc07146b2868b4c7852cf6940f63325a49a79a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ly0vIWGBUd4wlRxrVeWGouJj/ZoL2wd96tQC5xbnlhFKmC4/27+Ui/VdTGtDPqGOx56wZaFjCMpRFiqILcrQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:58:05.076449Z","bundle_sha256":"5e398e2d6b3ce8c37df3816f6fa73549b3e7367aa0058dec1dc095e1e155aa5b"}}