{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6HTB7DZE464V2MNEASFMYC6HY2","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":"850dce480d1f973f6cc9c04c89ab3533e92e30fdd79c84e90e0868fb232017fc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-02T10:02:03Z","title_canon_sha256":"3e12e53b77bc53cf88bbb2eac8195901a57f813fe04cc5c3cc2d7c7a1b206b01"},"schema_version":"1.0","source":{"id":"1701.00350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00350","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00350v1","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00350","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"6HTB7DZE464V","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HTB7DZE464V2MNE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HTB7DZE","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:e7e6430d328a53ca5b1133cb560a82bb771c1be1ee95be73b3ab34a4b27f6027","target":"graph","created_at":"2026-05-18T00:53:35Z","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 $\\Omega(n^2)$, the best known upper bound is $O(n^3)$.\n  In this note we show that the venerable fooling set method cannot be used to improve the lower bound: every fooling set for the Spanning Tree polytope has size $O(n^2)$.","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-01-02T10:02:03Z","title":"Fooling Sets and the Spanning Tree Polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00350","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:f03665fde92d6729d4e0f160cac0838324e453567c699c23adc679d1028f93bf","target":"record","created_at":"2026-05-18T00:53:35Z","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":"850dce480d1f973f6cc9c04c89ab3533e92e30fdd79c84e90e0868fb232017fc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-02T10:02:03Z","title_canon_sha256":"3e12e53b77bc53cf88bbb2eac8195901a57f813fe04cc5c3cc2d7c7a1b206b01"},"schema_version":"1.0","source":{"id":"1701.00350","kind":"arxiv","version":1}},"canonical_sha256":"f1e61f8f24e7b95d31a4048acc0bc7c69f149ee381b9c523c45c06d4289944fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1e61f8f24e7b95d31a4048acc0bc7c69f149ee381b9c523c45c06d4289944fd","first_computed_at":"2026-05-18T00:53:35.792001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:35.792001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"57eGFZZK1gvSiwOieg3JdGdfEXBSHwq/0QRl71hL/+zX9B7F6FyNOCJA9ePhUHx1ey+jib8BlAfDbh5z3VaJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:35.792668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f03665fde92d6729d4e0f160cac0838324e453567c699c23adc679d1028f93bf","sha256:e7e6430d328a53ca5b1133cb560a82bb771c1be1ee95be73b3ab34a4b27f6027"],"state_sha256":"a875ad5a565364d89115a678d6a48606111f78919313363d94322febcd91b924"}