{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SUBRTHXPAWYSLDDFZT2GVBJQFO","short_pith_number":"pith:SUBRTHXP","schema_version":"1.0","canonical_sha256":"9503199eef05b1258c65ccf46a85302ba9fb853d4384b675b3564121d7a0f558","source":{"kind":"arxiv","id":"0910.4200","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for the simplexity of the n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexey Glazyrin","submitted_at":"2009-10-21T23:29:11Z","abstract_excerpt":"In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional vertices is at least $(n+1)^{\\frac {n-1} 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":"0910.4200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2009-10-21T23:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"df4fa57bd4ff09fc88e0b5d8c4c2db11ea61137ef4c6a1ff85b7b97b4b9e2934","abstract_canon_sha256":"60a5951a3386bbadae72943003d7a6ff77b84688047a19cba59e6bfded39f60c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:53.543297Z","signature_b64":"7JQ7fJAHo318Pq5xM/T2oJ67Oiv4y9onU8XSUqdle0HfwAIFdbTReoDb/trhL9lIKpL/dkAMUfDTGY8qWKX7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9503199eef05b1258c65ccf46a85302ba9fb853d4384b675b3564121d7a0f558","last_reissued_at":"2026-05-18T03:37:53.542506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:53.542506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for the simplexity of the n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexey Glazyrin","submitted_at":"2009-10-21T23:29:11Z","abstract_excerpt":"In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional vertices is at least $(n+1)^{\\frac {n-1} 2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.4200","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.4200","created_at":"2026-05-18T03:37:53.542645+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.4200v2","created_at":"2026-05-18T03:37:53.542645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.4200","created_at":"2026-05-18T03:37:53.542645+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUBRTHXPAWYS","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUBRTHXPAWYSLDDF","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUBRTHXP","created_at":"2026-05-18T12:26:01.383474+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/SUBRTHXPAWYSLDDFZT2GVBJQFO","json":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO.json","graph_json":"https://pith.science/api/pith-number/SUBRTHXPAWYSLDDFZT2GVBJQFO/graph.json","events_json":"https://pith.science/api/pith-number/SUBRTHXPAWYSLDDFZT2GVBJQFO/events.json","paper":"https://pith.science/paper/SUBRTHXP"},"agent_actions":{"view_html":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO","download_json":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO.json","view_paper":"https://pith.science/paper/SUBRTHXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.4200&json=true","fetch_graph":"https://pith.science/api/pith-number/SUBRTHXPAWYSLDDFZT2GVBJQFO/graph.json","fetch_events":"https://pith.science/api/pith-number/SUBRTHXPAWYSLDDFZT2GVBJQFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO/action/storage_attestation","attest_author":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO/action/author_attestation","sign_citation":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO/action/citation_signature","submit_replication":"https://pith.science/pith/SUBRTHXPAWYSLDDFZT2GVBJQFO/action/replication_record"}},"created_at":"2026-05-18T03:37:53.542645+00:00","updated_at":"2026-05-18T03:37:53.542645+00:00"}