{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6HTB7DZE464V2MNEASFMYC6HY2","short_pith_number":"pith:6HTB7DZE","schema_version":"1.0","canonical_sha256":"f1e61f8f24e7b95d31a4048acc0bc7c69f149ee381b9c523c45c06d4289944fd","source":{"kind":"arxiv","id":"1701.00350","version":1},"attestation_state":"computed","paper":{"title":"Fooling Sets and the Spanning Tree Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Dirk Oliver Theis, Kaveh Khoshkhah","submitted_at":"2017-01-02T10:02:03Z","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)$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.00350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-02T10:02:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3e12e53b77bc53cf88bbb2eac8195901a57f813fe04cc5c3cc2d7c7a1b206b01","abstract_canon_sha256":"850dce480d1f973f6cc9c04c89ab3533e92e30fdd79c84e90e0868fb232017fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:35.792668Z","signature_b64":"57eGFZZK1gvSiwOieg3JdGdfEXBSHwq/0QRl71hL/+zX9B7F6FyNOCJA9ePhUHx1ey+jib8BlAfDbh5z3VaJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1e61f8f24e7b95d31a4048acc0bc7c69f149ee381b9c523c45c06d4289944fd","last_reissued_at":"2026-05-18T00:53:35.792001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:35.792001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fooling Sets and the Spanning Tree Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Dirk Oliver Theis, Kaveh Khoshkhah","submitted_at":"2017-01-02T10:02:03Z","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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00350","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.00350","created_at":"2026-05-18T00:53:35.792118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00350v1","created_at":"2026-05-18T00:53:35.792118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00350","created_at":"2026-05-18T00:53:35.792118+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HTB7DZE464V","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HTB7DZE464V2MNE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HTB7DZE","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2","json":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2.json","graph_json":"https://pith.science/api/pith-number/6HTB7DZE464V2MNEASFMYC6HY2/graph.json","events_json":"https://pith.science/api/pith-number/6HTB7DZE464V2MNEASFMYC6HY2/events.json","paper":"https://pith.science/paper/6HTB7DZE"},"agent_actions":{"view_html":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2","download_json":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2.json","view_paper":"https://pith.science/paper/6HTB7DZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00350&json=true","fetch_graph":"https://pith.science/api/pith-number/6HTB7DZE464V2MNEASFMYC6HY2/graph.json","fetch_events":"https://pith.science/api/pith-number/6HTB7DZE464V2MNEASFMYC6HY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2/action/storage_attestation","attest_author":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2/action/author_attestation","sign_citation":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2/action/citation_signature","submit_replication":"https://pith.science/pith/6HTB7DZE464V2MNEASFMYC6HY2/action/replication_record"}},"created_at":"2026-05-18T00:53:35.792118+00:00","updated_at":"2026-05-18T00:53:35.792118+00:00"}