{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7KGPCW6YNPRQ3INW32Z4CMVH3Q","short_pith_number":"pith:7KGPCW6Y","schema_version":"1.0","canonical_sha256":"fa8cf15bd86be30da1b6deb3c132a7dc132a7b920353126f603d2fb365d5fe2a","source":{"kind":"arxiv","id":"1403.0146","version":3},"attestation_state":"computed","paper":{"title":"Triangulations of $\\mathbb{RP}^n$ with few vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Soumen Sarkar","submitted_at":"2014-03-02T01:14:33Z","abstract_excerpt":"P. Arnoux and A. Marin showed that any triangulation of $\\mathbb{RP}^n$ contains more than $\\frac{(n+1)(n+2)}{2}$ vertices if $n \\geq 3$. We construct some natural triangulation of $\\mathbb{RP}^n$ with $\\frac{n(n+5)}{2}-1$ vertices for all $n \\geq 3$. Previously, it was known that $\\mathbb{RP}^n$ has $\\mathbb{Z}_2^n$-equivariant triangulation with $n(n+1)$ vertices for $n \\geq 6$."},"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":"1403.0146","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-03-02T01:14:33Z","cross_cats_sorted":[],"title_canon_sha256":"7a8b6d88be6127c1a996b13ec81acdf3789deb1077e86ec37766866144f28725","abstract_canon_sha256":"514c3c92e5a7815e71eef9a40b079807f34df9fa2f8d6c5ad8969b179d3096d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:49.932611Z","signature_b64":"LTQcR3qSYl8EL/Bllxy9irIWxd5KiQA8Jc1vU88+qYA9tAZSOxVyioc+yLvW9dW/ZuUIc0ZXcClcF3O8knOeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa8cf15bd86be30da1b6deb3c132a7dc132a7b920353126f603d2fb365d5fe2a","last_reissued_at":"2026-05-18T02:18:49.932120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:49.932120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangulations of $\\mathbb{RP}^n$ with few vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Soumen Sarkar","submitted_at":"2014-03-02T01:14:33Z","abstract_excerpt":"P. Arnoux and A. Marin showed that any triangulation of $\\mathbb{RP}^n$ contains more than $\\frac{(n+1)(n+2)}{2}$ vertices if $n \\geq 3$. We construct some natural triangulation of $\\mathbb{RP}^n$ with $\\frac{n(n+5)}{2}-1$ vertices for all $n \\geq 3$. Previously, it was known that $\\mathbb{RP}^n$ has $\\mathbb{Z}_2^n$-equivariant triangulation with $n(n+1)$ vertices for $n \\geq 6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0146","kind":"arxiv","version":3},"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":"1403.0146","created_at":"2026-05-18T02:18:49.932186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0146v3","created_at":"2026-05-18T02:18:49.932186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0146","created_at":"2026-05-18T02:18:49.932186+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KGPCW6YNPRQ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KGPCW6YNPRQ3INW","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KGPCW6Y","created_at":"2026-05-18T12:28:19.803747+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/7KGPCW6YNPRQ3INW32Z4CMVH3Q","json":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q.json","graph_json":"https://pith.science/api/pith-number/7KGPCW6YNPRQ3INW32Z4CMVH3Q/graph.json","events_json":"https://pith.science/api/pith-number/7KGPCW6YNPRQ3INW32Z4CMVH3Q/events.json","paper":"https://pith.science/paper/7KGPCW6Y"},"agent_actions":{"view_html":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q","download_json":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q.json","view_paper":"https://pith.science/paper/7KGPCW6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0146&json=true","fetch_graph":"https://pith.science/api/pith-number/7KGPCW6YNPRQ3INW32Z4CMVH3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/7KGPCW6YNPRQ3INW32Z4CMVH3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q/action/storage_attestation","attest_author":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q/action/author_attestation","sign_citation":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q/action/citation_signature","submit_replication":"https://pith.science/pith/7KGPCW6YNPRQ3INW32Z4CMVH3Q/action/replication_record"}},"created_at":"2026-05-18T02:18:49.932186+00:00","updated_at":"2026-05-18T02:18:49.932186+00:00"}