{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YQRJJTGLO5JE2NJZ3GY7FWO2PZ","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":"b6599dd0a37913f8cf3bb1d2853722632e4dd0800dc11cd026bba63862f5f382","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-05T16:22:19Z","title_canon_sha256":"1287a2cdbc3a60c2976552b7b1ab0cee72cd2fdbda7b7db2e8dcb8365372d563"},"schema_version":"1.0","source":{"id":"1702.01424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01424","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01424v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01424","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"YQRJJTGLO5JE","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQRJJTGLO5JE2NJZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQRJJTGL","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:ffc41e76b4d001552196a94e0d482e45b1dcd4441ddebeec409e82355c3a1805","target":"graph","created_at":"2026-05-18T00:51:23Z","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":"In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The best known lower bound is the trival (dimension) bound, $\\Omega(n^2)$, the best known upper bound is the extended formulation by Wong (1980) of size $O(n^3)$ (also Martin, 1991).\n  In this note we give a nondeterministic communication protocol with cost $\\log_2(n^2\\log n)+O(1)$ for the support of the spanning tree slack matrix.\n  This means that the combina","authors_text":"Dirk Oliver Theis, Kaveh Khoshkhah","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-05T16:22:19Z","title":"On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01424","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:8b52001c1916879812e629b2af3b7567ca30be108df48fe0456c28d04d730d76","target":"record","created_at":"2026-05-18T00:51:23Z","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":"b6599dd0a37913f8cf3bb1d2853722632e4dd0800dc11cd026bba63862f5f382","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-05T16:22:19Z","title_canon_sha256":"1287a2cdbc3a60c2976552b7b1ab0cee72cd2fdbda7b7db2e8dcb8365372d563"},"schema_version":"1.0","source":{"id":"1702.01424","kind":"arxiv","version":1}},"canonical_sha256":"c42294cccb77524d3539d9b1f2d9da7e52c087015eb0289d3aec340e4a6746b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c42294cccb77524d3539d9b1f2d9da7e52c087015eb0289d3aec340e4a6746b1","first_computed_at":"2026-05-18T00:51:23.481229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:23.481229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"asBPEWQbIf+oFjodiGtkfJZwqLniea6WG8KLlMhJ3ATu0ITSpgeSygq5g+JV9q/NPgDQOazKvqKwRwXYXnfsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:23.481879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b52001c1916879812e629b2af3b7567ca30be108df48fe0456c28d04d730d76","sha256:ffc41e76b4d001552196a94e0d482e45b1dcd4441ddebeec409e82355c3a1805"],"state_sha256":"c1f7c1f0308c0d2baacd93ee6b265e0bc41ec0c3192fa44bac8a97bf1bf48c8b"}