{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IS7KAZXICU3SODJCRPTN6P6M5Y","short_pith_number":"pith:IS7KAZXI","canonical_record":{"source":{"id":"1610.09868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T11:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"2e8fac6f88548e1c8d836c09fdf20707de0124f00678b99fe1fd279f11bc1eea","abstract_canon_sha256":"d98d0c999d48c049fb2644c97f314d4a85e0ae70a1d93b5206fce9c14ab8601d"},"schema_version":"1.0"},"canonical_sha256":"44bea066e81537270d228be6df3fccee187f70161248172770bca09bdf1d98b1","source":{"kind":"arxiv","id":"1610.09868","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09868","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09868v2","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09868","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"IS7KAZXICU3S","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IS7KAZXICU3SODJC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IS7KAZXI","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IS7KAZXICU3SODJCRPTN6P6M5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T11:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"2e8fac6f88548e1c8d836c09fdf20707de0124f00678b99fe1fd279f11bc1eea","abstract_canon_sha256":"d98d0c999d48c049fb2644c97f314d4a85e0ae70a1d93b5206fce9c14ab8601d"},"schema_version":"1.0"},"canonical_sha256":"44bea066e81537270d228be6df3fccee187f70161248172770bca09bdf1d98b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:30.457191Z","signature_b64":"OBvTxHHGMT428KrgaDbzy9wEWsdVe5K0ihnC3t4Eq3zhblMbH91vQjd3Iyltz8dYkPUxZXiyTUBeFkj/9HTWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44bea066e81537270d228be6df3fccee187f70161248172770bca09bdf1d98b1","last_reissued_at":"2026-05-18T00:56:30.456410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:30.456410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09868","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:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5l/s+v/jN3VSWiSCdBTcQE4LcvlRup2YyBoB5xLpE/iVEuujFwTpmycRk2TkokExQGUzA+f+FjBILijinawbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:00:25.739535Z"},"content_sha256":"2b242f0b06f7ebdd2e208874a8ed6197faa56b259b0fe74e0790ce7a304a2048","schema_version":"1.0","event_id":"sha256:2b242f0b06f7ebdd2e208874a8ed6197faa56b259b0fe74e0790ce7a304a2048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IS7KAZXICU3SODJCRPTN6P6M5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On ranks of regular polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Pedro Goucha, Jo\\~ao Gouveia, Pedro M. Silva","submitted_at":"2016-10-31T11:11:57Z","abstract_excerpt":"In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the gap between the current bounds, we introduce a new upper bound for their boolean rank, deriving from it some new numerical results, and we study their complex semidefinite rank, uncovering the possibility of non monotonicity of the ranks of regular $n$-gons."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09868","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:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73xMR2KKjPxDRBc7LhtTX/H49aEtq1p302EAnrAuw2KVtCHCJBQDqOHPp9NU8TLkcxD/RgyuUInJQlWRTV2IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:00:25.739882Z"},"content_sha256":"291c5fcf229e7d73acbd90e9e91db8f46d03b9e716f16a1dbc78f407713c5d4e","schema_version":"1.0","event_id":"sha256:291c5fcf229e7d73acbd90e9e91db8f46d03b9e716f16a1dbc78f407713c5d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS7KAZXICU3SODJCRPTN6P6M5Y/bundle.json","state_url":"https://pith.science/pith/IS7KAZXICU3SODJCRPTN6P6M5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS7KAZXICU3SODJCRPTN6P6M5Y/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-02T03:00:25Z","links":{"resolver":"https://pith.science/pith/IS7KAZXICU3SODJCRPTN6P6M5Y","bundle":"https://pith.science/pith/IS7KAZXICU3SODJCRPTN6P6M5Y/bundle.json","state":"https://pith.science/pith/IS7KAZXICU3SODJCRPTN6P6M5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS7KAZXICU3SODJCRPTN6P6M5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IS7KAZXICU3SODJCRPTN6P6M5Y","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":"d98d0c999d48c049fb2644c97f314d4a85e0ae70a1d93b5206fce9c14ab8601d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T11:11:57Z","title_canon_sha256":"2e8fac6f88548e1c8d836c09fdf20707de0124f00678b99fe1fd279f11bc1eea"},"schema_version":"1.0","source":{"id":"1610.09868","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09868","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09868v2","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09868","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"IS7KAZXICU3S","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IS7KAZXICU3SODJC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IS7KAZXI","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:291c5fcf229e7d73acbd90e9e91db8f46d03b9e716f16a1dbc78f407713c5d4e","target":"graph","created_at":"2026-05-18T00:56:30Z","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 study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the gap between the current bounds, we introduce a new upper bound for their boolean rank, deriving from it some new numerical results, and we study their complex semidefinite rank, uncovering the possibility of non monotonicity of the ranks of regular $n$-gons.","authors_text":"Ant\\'onio Pedro Goucha, Jo\\~ao Gouveia, Pedro M. Silva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T11:11:57Z","title":"On ranks of regular polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09868","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:2b242f0b06f7ebdd2e208874a8ed6197faa56b259b0fe74e0790ce7a304a2048","target":"record","created_at":"2026-05-18T00:56:30Z","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":"d98d0c999d48c049fb2644c97f314d4a85e0ae70a1d93b5206fce9c14ab8601d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T11:11:57Z","title_canon_sha256":"2e8fac6f88548e1c8d836c09fdf20707de0124f00678b99fe1fd279f11bc1eea"},"schema_version":"1.0","source":{"id":"1610.09868","kind":"arxiv","version":2}},"canonical_sha256":"44bea066e81537270d228be6df3fccee187f70161248172770bca09bdf1d98b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44bea066e81537270d228be6df3fccee187f70161248172770bca09bdf1d98b1","first_computed_at":"2026-05-18T00:56:30.456410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:30.456410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OBvTxHHGMT428KrgaDbzy9wEWsdVe5K0ihnC3t4Eq3zhblMbH91vQjd3Iyltz8dYkPUxZXiyTUBeFkj/9HTWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:30.457191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09868","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b242f0b06f7ebdd2e208874a8ed6197faa56b259b0fe74e0790ce7a304a2048","sha256:291c5fcf229e7d73acbd90e9e91db8f46d03b9e716f16a1dbc78f407713c5d4e"],"state_sha256":"b2c205a6c79eb92ced670875a52c345c44deb8a4015058a2572f08acd82439b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nTjB3SGBH0OPDj4+YCk8PiDIL4aV9sdWbpSVxHjYCaXsMm5qBUsFMOgFZFkVW8N99ICxuKhNwTi3zbGFaUm8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:00:25.741846Z","bundle_sha256":"2223632509c966492807d8155f690bd8b315b54b533d7efe73228b68b71af4d8"}}