{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2LTZORFNS3E4ZIVXGTWAV5XJJC","short_pith_number":"pith:2LTZORFN","schema_version":"1.0","canonical_sha256":"d2e79744ad96c9cca2b734ec0af6e9489c60ca4ad03d8ce5bba5007625774c22","source":{"kind":"arxiv","id":"2602.12105","version":2},"attestation_state":"computed","paper":{"title":"Iskra: A System for Inverse Geometry Processing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code.","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.GR","authors_text":"Ahmed H. Mahmoud, Ana Dodik, Justin Solomon","submitted_at":"2026-02-12T15:59:06Z","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"},"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":"2602.12105","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GR","submitted_at":"2026-02-12T15:59:06Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"199e668725bce90b68e74d7aac9d8568ec898277d44a166e1f6a962bf6b2c989","abstract_canon_sha256":"c36ca2d44f733af5e46f651ce972a605170f266c9ef06012f82428e665d3a7ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.195470Z","signature_b64":"+KU2AfpJf+5w5iz2Ceg0WpXoUpl5hhCfAO8B92/Lvffpo6Mu/qnmKYWTg0F+TubVEdjoPTS62WZXClB3nlUKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e79744ad96c9cca2b734ec0af6e9489c60ca4ad03d8ce5bba5007625774c22","last_reissued_at":"2026-05-17T23:39:16.194884Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.194884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iskra: A System for Inverse Geometry Processing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code.","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.GR","authors_text":"Ahmed H. Mahmoud, Ana Dodik, Justin Solomon","submitted_at":"2026-02-12T15:59:06Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a4db964500774fa1258081b80f2cfc91d66bce5881bd4b7c59e4c80a99f5cb18"},"source":{"id":"2602.12105","kind":"arxiv","version":2},"verdict":{"id":"df34bcae-7da4-4510-8aa4-d063e9e5792c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T05:35:43.512699Z","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.","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","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.","pith_extraction_headline":"Iskra differentiates existing geometry processing algorithms by applying the adjoint method directly to user-written imperative code."},"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":"2602.12105","created_at":"2026-05-17T23:39:16.194983+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.12105v2","created_at":"2026-05-17T23:39:16.194983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.12105","created_at":"2026-05-17T23:39:16.194983+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LTZORFNS3E4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LTZORFNS3E4ZIVX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LTZORFN","created_at":"2026-05-18T12:33:37.589309+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/2LTZORFNS3E4ZIVXGTWAV5XJJC","json":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC.json","graph_json":"https://pith.science/api/pith-number/2LTZORFNS3E4ZIVXGTWAV5XJJC/graph.json","events_json":"https://pith.science/api/pith-number/2LTZORFNS3E4ZIVXGTWAV5XJJC/events.json","paper":"https://pith.science/paper/2LTZORFN"},"agent_actions":{"view_html":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC","download_json":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC.json","view_paper":"https://pith.science/paper/2LTZORFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.12105&json=true","fetch_graph":"https://pith.science/api/pith-number/2LTZORFNS3E4ZIVXGTWAV5XJJC/graph.json","fetch_events":"https://pith.science/api/pith-number/2LTZORFNS3E4ZIVXGTWAV5XJJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC/action/storage_attestation","attest_author":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC/action/author_attestation","sign_citation":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC/action/citation_signature","submit_replication":"https://pith.science/pith/2LTZORFNS3E4ZIVXGTWAV5XJJC/action/replication_record"}},"created_at":"2026-05-17T23:39:16.194983+00:00","updated_at":"2026-05-17T23:39:16.194983+00:00"}