{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AWIKCGIIEHLKAAVDFMDCDU7PBV","short_pith_number":"pith:AWIKCGII","schema_version":"1.0","canonical_sha256":"0590a1190821d6a002a32b0621d3ef0d61d64cc5f71718dffad722ca70880bda","source":{"kind":"arxiv","id":"1601.05208","version":2},"attestation_state":"computed","paper":{"title":"Unimodular triangulations of simplicial cones by short vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael von Thaden, Winfried Bruns","submitted_at":"2016-01-20T09:20:52Z","abstract_excerpt":"We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is based on a successive reduction of the highest prime divisor of the multiplicity and uses the prime number theorem to control the length of the subdividing vectors."},"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":"1601.05208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T09:20:52Z","cross_cats_sorted":[],"title_canon_sha256":"ccc9afe1da8e2fd67e987bf121ca594e7ec80b8ca3e7320ac4712c6cf565504c","abstract_canon_sha256":"26e29227b1522fa1d33f85f85e03e5d4a8a0c378f141d6fe85f1ef705e54236b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:35.813306Z","signature_b64":"rOgKixmHtebqwWWySbvh//HYiywvEtbSxZ5fWmHQESvHzOwvSfbcREgKy8gTO0w2E7sAWyJ3lEOCuI1rRlrPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0590a1190821d6a002a32b0621d3ef0d61d64cc5f71718dffad722ca70880bda","last_reissued_at":"2026-05-18T00:50:35.812585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:35.812585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unimodular triangulations of simplicial cones by short vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael von Thaden, Winfried Bruns","submitted_at":"2016-01-20T09:20:52Z","abstract_excerpt":"We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is based on a successive reduction of the highest prime divisor of the multiplicity and uses the prime number theorem to control the length of the subdividing vectors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05208","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":"1601.05208","created_at":"2026-05-18T00:50:35.812698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05208v2","created_at":"2026-05-18T00:50:35.812698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05208","created_at":"2026-05-18T00:50:35.812698+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWIKCGIIEHLK","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWIKCGIIEHLKAAVD","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWIKCGII","created_at":"2026-05-18T12:30:07.202191+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/AWIKCGIIEHLKAAVDFMDCDU7PBV","json":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV.json","graph_json":"https://pith.science/api/pith-number/AWIKCGIIEHLKAAVDFMDCDU7PBV/graph.json","events_json":"https://pith.science/api/pith-number/AWIKCGIIEHLKAAVDFMDCDU7PBV/events.json","paper":"https://pith.science/paper/AWIKCGII"},"agent_actions":{"view_html":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV","download_json":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV.json","view_paper":"https://pith.science/paper/AWIKCGII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05208&json=true","fetch_graph":"https://pith.science/api/pith-number/AWIKCGIIEHLKAAVDFMDCDU7PBV/graph.json","fetch_events":"https://pith.science/api/pith-number/AWIKCGIIEHLKAAVDFMDCDU7PBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV/action/storage_attestation","attest_author":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV/action/author_attestation","sign_citation":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV/action/citation_signature","submit_replication":"https://pith.science/pith/AWIKCGIIEHLKAAVDFMDCDU7PBV/action/replication_record"}},"created_at":"2026-05-18T00:50:35.812698+00:00","updated_at":"2026-05-18T00:50:35.812698+00:00"}