{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2LTZORFNS3E4ZIVXGTWAV5XJJC","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":"c36ca2d44f733af5e46f651ce972a605170f266c9ef06012f82428e665d3a7ac","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GR","submitted_at":"2026-02-12T15:59:06Z","title_canon_sha256":"199e668725bce90b68e74d7aac9d8568ec898277d44a166e1f6a962bf6b2c989"},"schema_version":"1.0","source":{"id":"2602.12105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.12105","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2602.12105v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.12105","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"2LTZORFNS3E4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2LTZORFNS3E4ZIVX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2LTZORFN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3eabb47f706b7453eb5058249ef5c2721c733538f22cfe74e1a27075b7506600","target":"graph","created_at":"2026-05-17T23:39:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our system differentiates a broad class of geometric algorithms, exploiting existing fast problem-specific schemes common to geometry processing, including local-global and ADMM solvers."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the adjoint method applied to user-specified imperative code will generate an efficient and accurate backward pass for the targeted geometry processing algorithms without requiring reformulation or introducing significant overhead."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Iskra provides a differentiable interface to common geometry processing algorithms by marrying scatter-gather mesh operations with tensor workflows and adjoint differentiation, enabling inverse applications."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code."}],"snapshot_sha256":"a4db964500774fa1258081b80f2cfc91d66bce5881bd4b7c59e4c80a99f5cb18"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a system for differentiating through solutions to geometry processing problems. Our system differentiates a broad class of geometric algorithms, exploiting existing fast problem-specific schemes common to geometry processing, including local-global and ADMM solvers. It is compatible with machine learning frameworks, opening doors to new classes of inverse geometry processing applications. We marry the scatter-gather approach to mesh processing with tensor-based workflows and rely on the adjoint method applied to user-specified imperative code to generate an efficient backward pass b","authors_text":"Ahmed H. Mahmoud, Ana Dodik, Justin Solomon","cross_cats":["cs.CV","cs.LG"],"headline":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GR","submitted_at":"2026-02-12T15:59:06Z","title":"Iskra: A System for Inverse Geometry Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.12105","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T05:35:43.512699Z","id":"df34bcae-7da4-4510-8aa4-d063e9e5792c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Iskra provides a differentiable interface to common geometry processing algorithms by marrying scatter-gather mesh operations with tensor workflows and adjoint differentiation, enabling inverse applications.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code.","strongest_claim":"Our system differentiates a broad class of geometric algorithms, exploiting existing fast problem-specific schemes common to geometry processing, including local-global and ADMM solvers.","weakest_assumption":"That the adjoint method applied to user-specified imperative code will generate an efficient and accurate backward pass for the targeted geometry processing algorithms without requiring reformulation or introducing significant overhead."}},"verdict_id":"df34bcae-7da4-4510-8aa4-d063e9e5792c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:283a26018fe9fa8e4a16c1480fdef193c1acc6eb345261f3c1ee5430e38aa631","target":"record","created_at":"2026-05-17T23:39:16Z","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":"c36ca2d44f733af5e46f651ce972a605170f266c9ef06012f82428e665d3a7ac","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GR","submitted_at":"2026-02-12T15:59:06Z","title_canon_sha256":"199e668725bce90b68e74d7aac9d8568ec898277d44a166e1f6a962bf6b2c989"},"schema_version":"1.0","source":{"id":"2602.12105","kind":"arxiv","version":2}},"canonical_sha256":"d2e79744ad96c9cca2b734ec0af6e9489c60ca4ad03d8ce5bba5007625774c22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2e79744ad96c9cca2b734ec0af6e9489c60ca4ad03d8ce5bba5007625774c22","first_computed_at":"2026-05-17T23:39:16.194884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.194884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+KU2AfpJf+5w5iz2Ceg0WpXoUpl5hhCfAO8B92/Lvffpo6Mu/qnmKYWTg0F+TubVEdjoPTS62WZXClB3nlUKCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.195470Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.12105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:283a26018fe9fa8e4a16c1480fdef193c1acc6eb345261f3c1ee5430e38aa631","sha256:3eabb47f706b7453eb5058249ef5c2721c733538f22cfe74e1a27075b7506600"],"state_sha256":"559d113483b784421e55db42d887638983666d43d0dfefde08dc8c208b70c586"}