{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4XDBSR5BFJ4E7R3LZFILL3RWQO","short_pith_number":"pith:4XDBSR5B","schema_version":"1.0","canonical_sha256":"e5c61947a12a784fc76bc950b5ee3683a5d8d3e098a9b6815984ffd8fd22a103","source":{"kind":"arxiv","id":"2507.08478","version":1},"attestation_state":"computed","paper":{"title":"A Robust Approach to Detect Intersections between Triangles with Different Numerical Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Gianmarco Cherchi, Luca Garau","submitted_at":"2025-07-11T10:40:16Z","abstract_excerpt":"The detection and classification of intersections between triangles are crucial tasks in a wide range of applications within Computer Graphics and Geometry Processing, including mesh Arrangements, mesh Booleans, and generic mesh processing and fixing tasks. Existing methods are hard-coded and deeply integrated into specific algorithms, and significant efforts are usually required to integrate them into new pipelines or to extend them to different numerical representations. This paper presents a versatile and exhaustive algorithm to identify and classify intersections between triangles with eit"},"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":"2507.08478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-11T10:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"d39071df1e857e2f9ee8c80e07fcb705d1cfa8f7858cf06c1a349c7d65a05696","abstract_canon_sha256":"623d83ebe70e0f4210d639b125629936b88a91e27b6bd7c66166dabde7060622"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:40.666328Z","signature_b64":"15FHjgBBBiKNhNXrjmZJETlN45aKQqtckLbK0zgJ2k9vRs9s+32AouHvzMxY4erFW6xGs9w5FBHKL28IeCPYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5c61947a12a784fc76bc950b5ee3683a5d8d3e098a9b6815984ffd8fd22a103","last_reissued_at":"2026-07-05T11:35:40.665725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:40.665725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Robust Approach to Detect Intersections between Triangles with Different Numerical Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Gianmarco Cherchi, Luca Garau","submitted_at":"2025-07-11T10:40:16Z","abstract_excerpt":"The detection and classification of intersections between triangles are crucial tasks in a wide range of applications within Computer Graphics and Geometry Processing, including mesh Arrangements, mesh Booleans, and generic mesh processing and fixing tasks. Existing methods are hard-coded and deeply integrated into specific algorithms, and significant efforts are usually required to integrate them into new pipelines or to extend them to different numerical representations. This paper presents a versatile and exhaustive algorithm to identify and classify intersections between triangles with eit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08478","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.08478/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.08478","created_at":"2026-07-05T11:35:40.665797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.08478v1","created_at":"2026-07-05T11:35:40.665797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08478","created_at":"2026-07-05T11:35:40.665797+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XDBSR5BFJ4E","created_at":"2026-07-05T11:35:40.665797+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XDBSR5BFJ4E7R3L","created_at":"2026-07-05T11:35:40.665797+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XDBSR5B","created_at":"2026-07-05T11:35:40.665797+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/4XDBSR5BFJ4E7R3LZFILL3RWQO","json":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO.json","graph_json":"https://pith.science/api/pith-number/4XDBSR5BFJ4E7R3LZFILL3RWQO/graph.json","events_json":"https://pith.science/api/pith-number/4XDBSR5BFJ4E7R3LZFILL3RWQO/events.json","paper":"https://pith.science/paper/4XDBSR5B"},"agent_actions":{"view_html":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO","download_json":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO.json","view_paper":"https://pith.science/paper/4XDBSR5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.08478&json=true","fetch_graph":"https://pith.science/api/pith-number/4XDBSR5BFJ4E7R3LZFILL3RWQO/graph.json","fetch_events":"https://pith.science/api/pith-number/4XDBSR5BFJ4E7R3LZFILL3RWQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/action/storage_attestation","attest_author":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/action/author_attestation","sign_citation":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/action/citation_signature","submit_replication":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/action/replication_record"}},"created_at":"2026-07-05T11:35:40.665797+00:00","updated_at":"2026-07-05T11:35:40.665797+00:00"}