{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:INJY2JC3GLZEJI4VHL5MAV2DEJ","short_pith_number":"pith:INJY2JC3","schema_version":"1.0","canonical_sha256":"43538d245b32f244a3953afac057432277fd23db2907259b3395bf9ad557d3b4","source":{"kind":"arxiv","id":"1709.04746","version":2},"attestation_state":"computed","paper":{"title":"Parallel Enumeration of Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.MG"],"primary_cat":"math.CO","authors_text":"Charles Jordan, Lars Kastner, Michael Joswig","submitted_at":"2017-09-14T12:59:42Z","abstract_excerpt":"We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing full triangulations only; this case is particularly relevant for tropical geometry. Most importantly, down-flip reverse search allows for massive parallelization, i.e., it scales well even for many cores. Our implementation allows to compute the triangulations of much larger point sets than before."},"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":"1709.04746","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T12:59:42Z","cross_cats_sorted":["cs.CG","math.MG"],"title_canon_sha256":"95d825db74084eab90531fcb350827b1d3f5700503a7cc5bb440a7237b3f9125","abstract_canon_sha256":"8e55fa74ee92b6ea5cfd6a702d09cbf79a91d03d50a28425f2bbc0b06a292dc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.333257Z","signature_b64":"hDJNvir6lMErOjJ+ozgy4Ck5qbSl4ujYJroWHTdgjlGH8miOo/nrTP/vYJ6fX7LMGDLVJmdu89ksW5/KyXCRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43538d245b32f244a3953afac057432277fd23db2907259b3395bf9ad557d3b4","last_reissued_at":"2026-05-18T00:02:13.332664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.332664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Enumeration of Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.MG"],"primary_cat":"math.CO","authors_text":"Charles Jordan, Lars Kastner, Michael Joswig","submitted_at":"2017-09-14T12:59:42Z","abstract_excerpt":"We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing full triangulations only; this case is particularly relevant for tropical geometry. Most importantly, down-flip reverse search allows for massive parallelization, i.e., it scales well even for many cores. Our implementation allows to compute the triangulations of much larger point sets than before."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04746","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":"1709.04746","created_at":"2026-05-18T00:02:13.332772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04746v2","created_at":"2026-05-18T00:02:13.332772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04746","created_at":"2026-05-18T00:02:13.332772+00:00"},{"alias_kind":"pith_short_12","alias_value":"INJY2JC3GLZE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"INJY2JC3GLZEJI4V","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"INJY2JC3","created_at":"2026-05-18T12:31:21.493067+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/INJY2JC3GLZEJI4VHL5MAV2DEJ","json":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ.json","graph_json":"https://pith.science/api/pith-number/INJY2JC3GLZEJI4VHL5MAV2DEJ/graph.json","events_json":"https://pith.science/api/pith-number/INJY2JC3GLZEJI4VHL5MAV2DEJ/events.json","paper":"https://pith.science/paper/INJY2JC3"},"agent_actions":{"view_html":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ","download_json":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ.json","view_paper":"https://pith.science/paper/INJY2JC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04746&json=true","fetch_graph":"https://pith.science/api/pith-number/INJY2JC3GLZEJI4VHL5MAV2DEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/INJY2JC3GLZEJI4VHL5MAV2DEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ/action/storage_attestation","attest_author":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ/action/author_attestation","sign_citation":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ/action/citation_signature","submit_replication":"https://pith.science/pith/INJY2JC3GLZEJI4VHL5MAV2DEJ/action/replication_record"}},"created_at":"2026-05-18T00:02:13.332772+00:00","updated_at":"2026-05-18T00:02:13.332772+00:00"}