{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D2RV4KWRWE3IV6VNEBP27UECIA","short_pith_number":"pith:D2RV4KWR","canonical_record":{"source":{"id":"1505.08031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T13:11:57Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"9903818eeff4b5ad1ab96edd5523418a53284618bc903bb67c2bd4dfe1ab6e76","abstract_canon_sha256":"45b770e532793a0499098aa5e5a01616ee29d1c1873cc16063d75525c41f615c"},"schema_version":"1.0"},"canonical_sha256":"1ea35e2ad1b1368afaad205fafd082402c266761e219cac2f92347d39f38212d","source":{"kind":"arxiv","id":"1505.08031","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08031","created_at":"2026-05-18T00:45:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08031v2","created_at":"2026-05-18T00:45:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08031","created_at":"2026-05-18T00:45:26Z"},{"alias_kind":"pith_short_12","alias_value":"D2RV4KWRWE3I","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D2RV4KWRWE3IV6VN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D2RV4KWR","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D2RV4KWRWE3IV6VNEBP27UECIA","target":"record","payload":{"canonical_record":{"source":{"id":"1505.08031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T13:11:57Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"9903818eeff4b5ad1ab96edd5523418a53284618bc903bb67c2bd4dfe1ab6e76","abstract_canon_sha256":"45b770e532793a0499098aa5e5a01616ee29d1c1873cc16063d75525c41f615c"},"schema_version":"1.0"},"canonical_sha256":"1ea35e2ad1b1368afaad205fafd082402c266761e219cac2f92347d39f38212d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:26.289147Z","signature_b64":"sYWPVSSRRRZJDycgZ0a0kkGDFvILbGdE13LvamVm2EMd0zTaruT26TjLseZiwbC+XAmvxeZkBy2tFuOR1ad/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea35e2ad1b1368afaad205fafd082402c266761e219cac2f92347d39f38212d","last_reissued_at":"2026-05-18T00:45:26.288644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:26.288644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.08031","source_version":2,"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-18T00:45:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/KRdECreYWkLgCzn+rqzNDrowwjSC6rzrk4SQjLspdCvtPYG5pvGR2tAt3RCILav6v89grzsU/beBAX1xWgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:12:35.513862Z"},"content_sha256":"4a742905ac06ab47ecb6cdc1aa561ab66f1e5c438e4bb80d281aa5d90c86c31f","schema_version":"1.0","event_id":"sha256:4a742905ac06ab47ecb6cdc1aa561ab66f1e5c438e4bb80d281aa5d90c86c31f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D2RV4KWRWE3IV6VNEBP27UECIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Linear Extension Complexity of Regular n-gons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Arnaud Vandaele, Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2015-05-29T13:11:57Z","abstract_excerpt":"In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and (ii) a rank-$r$ nonnegative factorization of a slack matrix of the polytope $P$. The lower bound is based on an improved bound for the rectangle covering number (also known as the boolean rank) of the slack matrix of the $n$-gons. The upper bound is a slight improvement of the result of Fiorini, Rothvoss and Tiwary [Extended Formulations for Polygons, Discret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08031","kind":"arxiv","version":2},"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-18T00:45:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1GRfJ1evNEZ56vG5ZcCC2JeQ71uZ3unj8PALN3EVLTUYP4ClstbLQCO//hLagQ7CEBPVqvS2wIMNIlAOehlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:12:35.514520Z"},"content_sha256":"44b43a4b7807474d56bd5018bff557a27904ffda820d15fac1136ef26b4752cd","schema_version":"1.0","event_id":"sha256:44b43a4b7807474d56bd5018bff557a27904ffda820d15fac1136ef26b4752cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2RV4KWRWE3IV6VNEBP27UECIA/bundle.json","state_url":"https://pith.science/pith/D2RV4KWRWE3IV6VNEBP27UECIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2RV4KWRWE3IV6VNEBP27UECIA/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-05-27T01:12:35Z","links":{"resolver":"https://pith.science/pith/D2RV4KWRWE3IV6VNEBP27UECIA","bundle":"https://pith.science/pith/D2RV4KWRWE3IV6VNEBP27UECIA/bundle.json","state":"https://pith.science/pith/D2RV4KWRWE3IV6VNEBP27UECIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2RV4KWRWE3IV6VNEBP27UECIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D2RV4KWRWE3IV6VNEBP27UECIA","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":"45b770e532793a0499098aa5e5a01616ee29d1c1873cc16063d75525c41f615c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T13:11:57Z","title_canon_sha256":"9903818eeff4b5ad1ab96edd5523418a53284618bc903bb67c2bd4dfe1ab6e76"},"schema_version":"1.0","source":{"id":"1505.08031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08031","created_at":"2026-05-18T00:45:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08031v2","created_at":"2026-05-18T00:45:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08031","created_at":"2026-05-18T00:45:26Z"},{"alias_kind":"pith_short_12","alias_value":"D2RV4KWRWE3I","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D2RV4KWRWE3IV6VN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D2RV4KWR","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:44b43a4b7807474d56bd5018bff557a27904ffda820d15fac1136ef26b4752cd","target":"graph","created_at":"2026-05-18T00:45:26Z","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 this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and (ii) a rank-$r$ nonnegative factorization of a slack matrix of the polytope $P$. The lower bound is based on an improved bound for the rectangle covering number (also known as the boolean rank) of the slack matrix of the $n$-gons. The upper bound is a slight improvement of the result of Fiorini, Rothvoss and Tiwary [Extended Formulations for Polygons, Discret","authors_text":"Arnaud Vandaele, Fran\\c{c}ois Glineur, Nicolas Gillis","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T13:11:57Z","title":"On the Linear Extension Complexity of Regular n-gons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08031","kind":"arxiv","version":2},"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:4a742905ac06ab47ecb6cdc1aa561ab66f1e5c438e4bb80d281aa5d90c86c31f","target":"record","created_at":"2026-05-18T00:45:26Z","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":"45b770e532793a0499098aa5e5a01616ee29d1c1873cc16063d75525c41f615c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T13:11:57Z","title_canon_sha256":"9903818eeff4b5ad1ab96edd5523418a53284618bc903bb67c2bd4dfe1ab6e76"},"schema_version":"1.0","source":{"id":"1505.08031","kind":"arxiv","version":2}},"canonical_sha256":"1ea35e2ad1b1368afaad205fafd082402c266761e219cac2f92347d39f38212d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ea35e2ad1b1368afaad205fafd082402c266761e219cac2f92347d39f38212d","first_computed_at":"2026-05-18T00:45:26.288644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:26.288644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYWPVSSRRRZJDycgZ0a0kkGDFvILbGdE13LvamVm2EMd0zTaruT26TjLseZiwbC+XAmvxeZkBy2tFuOR1ad/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:26.289147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a742905ac06ab47ecb6cdc1aa561ab66f1e5c438e4bb80d281aa5d90c86c31f","sha256:44b43a4b7807474d56bd5018bff557a27904ffda820d15fac1136ef26b4752cd"],"state_sha256":"89af04397009ca5ad3c984c836b931538cab1edc0b5577c1d6511553bbc43bea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuQqIixUmZRPsm2Zq1nWPXfCs32nHwfg3roI5VBVl0LNabYkeU53srh9rtxFZUqw1BxdELIfFtkiSYwj/chpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:12:35.517983Z","bundle_sha256":"940c7dfc1b09ff91b277e5e7c01926d32646fe83544eb079820f78af2523ff04"}}