{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4XDBSR5BFJ4E7R3LZFILL3RWQO","short_pith_number":"pith:4XDBSR5B","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"},"canonical_sha256":"e5c61947a12a784fc76bc950b5ee3683a5d8d3e098a9b6815984ffd8fd22a103","source":{"kind":"arxiv","id":"2507.08478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08478","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08478v1","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08478","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"4XDBSR5BFJ4E","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"pith_short_16","alias_value":"4XDBSR5BFJ4E7R3L","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"pith_short_8","alias_value":"4XDBSR5B","created_at":"2026-07-05T11:35:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4XDBSR5BFJ4E7R3LZFILL3RWQO","target":"record","payload":{"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"},"canonical_sha256":"e5c61947a12a784fc76bc950b5ee3683a5d8d3e098a9b6815984ffd8fd22a103","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"},"source_kind":"arxiv","source_id":"2507.08478","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:35:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmSegbuJhTfR28KJXSdINfZLoGxW03hXb9E8WfmIUOZGskYR6Uk3S/jP8/1xVKoSYsEIA7jwRIC+jcD0R7qTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:57:40.348213Z"},"content_sha256":"f756bed6cd846cc8dab348514dbd848508e04bbd6d579dcc35128a6972ca7576","schema_version":"1.0","event_id":"sha256:f756bed6cd846cc8dab348514dbd848508e04bbd6d579dcc35128a6972ca7576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4XDBSR5BFJ4E7R3LZFILL3RWQO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:35:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkiAD2i0Q48/hVLxM+PeIphpF3uddGckbGUxv7XZC0cxouNUW66uJxNpf2//VxfNRtVMBRP1Q8mxrqdVr5MlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:57:40.348932Z"},"content_sha256":"fc9659a8fc8a3ab04396909fcbc52c288ed1bb8890b39f309ae3e780b9aa101b","schema_version":"1.0","event_id":"sha256:fc9659a8fc8a3ab04396909fcbc52c288ed1bb8890b39f309ae3e780b9aa101b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/bundle.json","state_url":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T21:57:40Z","links":{"resolver":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO","bundle":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/bundle.json","state":"https://pith.science/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XDBSR5BFJ4E7R3LZFILL3RWQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4XDBSR5BFJ4E7R3LZFILL3RWQO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"623d83ebe70e0f4210d639b125629936b88a91e27b6bd7c66166dabde7060622","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-11T10:40:16Z","title_canon_sha256":"d39071df1e857e2f9ee8c80e07fcb705d1cfa8f7858cf06c1a349c7d65a05696"},"schema_version":"1.0","source":{"id":"2507.08478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08478","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08478v1","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08478","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"4XDBSR5BFJ4E","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"pith_short_16","alias_value":"4XDBSR5BFJ4E7R3L","created_at":"2026-07-05T11:35:40Z"},{"alias_kind":"pith_short_8","alias_value":"4XDBSR5B","created_at":"2026-07-05T11:35:40Z"}],"graph_snapshots":[{"event_id":"sha256:fc9659a8fc8a3ab04396909fcbc52c288ed1bb8890b39f309ae3e780b9aa101b","target":"graph","created_at":"2026-07-05T11:35:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.08478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gianmarco Cherchi, Luca Garau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-11T10:40:16Z","title":"A Robust Approach to Detect Intersections between Triangles with Different Numerical Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08478","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f756bed6cd846cc8dab348514dbd848508e04bbd6d579dcc35128a6972ca7576","target":"record","created_at":"2026-07-05T11:35:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"623d83ebe70e0f4210d639b125629936b88a91e27b6bd7c66166dabde7060622","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-11T10:40:16Z","title_canon_sha256":"d39071df1e857e2f9ee8c80e07fcb705d1cfa8f7858cf06c1a349c7d65a05696"},"schema_version":"1.0","source":{"id":"2507.08478","kind":"arxiv","version":1}},"canonical_sha256":"e5c61947a12a784fc76bc950b5ee3683a5d8d3e098a9b6815984ffd8fd22a103","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5c61947a12a784fc76bc950b5ee3683a5d8d3e098a9b6815984ffd8fd22a103","first_computed_at":"2026-07-05T11:35:40.665725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:40.665725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"15FHjgBBBiKNhNXrjmZJETlN45aKQqtckLbK0zgJ2k9vRs9s+32AouHvzMxY4erFW6xGs9w5FBHKL28IeCPYCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:40.666328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.08478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f756bed6cd846cc8dab348514dbd848508e04bbd6d579dcc35128a6972ca7576","sha256:fc9659a8fc8a3ab04396909fcbc52c288ed1bb8890b39f309ae3e780b9aa101b"],"state_sha256":"d6173115891391926e40bbb563e2bc806a1cce9a12485826f2d6fbca151e6839"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIVI/MPh1wdPdVW1ECm59uicBWdO3OdYp/9geOEr0cVYuLinKlfq8PbK2ibcyV8CEWGZoSVsZFcvSAamBl+jDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:57:40.354346Z","bundle_sha256":"b8df2a2b2810af7acd36b0a7d5ab15c7b1c0086e4740a6f809cf660c57890218"}}