{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:TKH77GA7BJ7XWWR2TUO4JBQ4QA","short_pith_number":"pith:TKH77GA7","schema_version":"1.0","canonical_sha256":"9a8fff981f0a7f7b5a3a9d1dc4861c802b611a3e1c7f48a0f1784991de4c4a4c","source":{"kind":"arxiv","id":"0910.1134","version":2},"attestation_state":"computed","paper":{"title":"A lower bound technique for triangulations of simplotopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Francis Edward Su, Tyler Seacrest","submitted_at":"2009-10-06T23:35:47Z","abstract_excerpt":"Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and triangulations of simplotopes, including those with interior vertices. We establish that a minimal triangulation of a product of two simplices is given by a vertex triangulation, i.e., one without interior vertices. For products of more than two simplices, we produce bounds for products of segments and triangles. Aside from cubes, these are the first known lower bounds "},"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.1134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-06T23:35:47Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"7c20708d204f048241a213a4765e1ae817794c231050b04f7014c1ecb6878e57","abstract_canon_sha256":"22f946da193a41657e53b4fc15f606da8e286003755ce31d24accf85f09929f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:08.893733Z","signature_b64":"3XhgF5G02OioLaPdSzPKGmvxLs/o8QDL56akAT111LSkg2LuIIug+I79GRjE+zgkrUbyGmB7aaMcgI6okY1LDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8fff981f0a7f7b5a3a9d1dc4861c802b611a3e1c7f48a0f1784991de4c4a4c","last_reissued_at":"2026-05-18T00:40:08.893089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:08.893089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound technique for triangulations of simplotopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Francis Edward Su, Tyler Seacrest","submitted_at":"2009-10-06T23:35:47Z","abstract_excerpt":"Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and triangulations of simplotopes, including those with interior vertices. We establish that a minimal triangulation of a product of two simplices is given by a vertex triangulation, i.e., one without interior vertices. For products of more than two simplices, we produce bounds for products of segments and triangles. Aside from cubes, these are the first known lower bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1134","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.1134","created_at":"2026-05-18T00:40:08.893192+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1134v2","created_at":"2026-05-18T00:40:08.893192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1134","created_at":"2026-05-18T00:40:08.893192+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKH77GA7BJ7X","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKH77GA7BJ7XWWR2","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKH77GA7","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/TKH77GA7BJ7XWWR2TUO4JBQ4QA","json":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA.json","graph_json":"https://pith.science/api/pith-number/TKH77GA7BJ7XWWR2TUO4JBQ4QA/graph.json","events_json":"https://pith.science/api/pith-number/TKH77GA7BJ7XWWR2TUO4JBQ4QA/events.json","paper":"https://pith.science/paper/TKH77GA7"},"agent_actions":{"view_html":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA","download_json":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA.json","view_paper":"https://pith.science/paper/TKH77GA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1134&json=true","fetch_graph":"https://pith.science/api/pith-number/TKH77GA7BJ7XWWR2TUO4JBQ4QA/graph.json","fetch_events":"https://pith.science/api/pith-number/TKH77GA7BJ7XWWR2TUO4JBQ4QA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA/action/storage_attestation","attest_author":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA/action/author_attestation","sign_citation":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA/action/citation_signature","submit_replication":"https://pith.science/pith/TKH77GA7BJ7XWWR2TUO4JBQ4QA/action/replication_record"}},"created_at":"2026-05-18T00:40:08.893192+00:00","updated_at":"2026-05-18T00:40:08.893192+00:00"}