{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K7FM6DYJEEADPXQU7DLLPPY7ZW","short_pith_number":"pith:K7FM6DYJ","schema_version":"1.0","canonical_sha256":"57cacf0f09210037de14f8d6b7bf1fcd858327e4ea4e272174496c12fee13ad3","source":{"kind":"arxiv","id":"2505.05542","version":1},"attestation_state":"computed","paper":{"title":"A Common Interface for Automatic Differentiation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Adrian Hill, Guillaume Dalle","submitted_at":"2025-05-08T16:55:14Z","abstract_excerpt":"For scientific machine learning tasks with a lot of custom code, picking the right Automatic Differentiation (AD) system matters. Our Julia package DifferentiationInterface$.$jl provides a common frontend to a dozen AD backends, unlocking easy comparison and modular development. In particular, its built-in preparation mechanism leverages the strengths of each backend by amortizing one-time computations. This is key to enabling sophisticated features like sparsity handling without putting additional burdens on the user."},"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":"2505.05542","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MS","submitted_at":"2025-05-08T16:55:14Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"08b5797a258fe1637af540e707be64872eb7d90eaae469b9a1b9b9e6dfd2681a","abstract_canon_sha256":"3395a02eb2a295b4aaf2f42386fb11219f0a9736486dbf018b23a164a8dde695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:00.168289Z","signature_b64":"jzWo4YpZY7gkqRCcObtMRHYxK6NICH7QwLUxlgHsSvQEnxPySg27GMfpooshn0lYzHNLTXXPERDwDRfmY+ATAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57cacf0f09210037de14f8d6b7bf1fcd858327e4ea4e272174496c12fee13ad3","last_reissued_at":"2026-07-05T11:04:00.167803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:00.167803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Common Interface for Automatic Differentiation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Adrian Hill, Guillaume Dalle","submitted_at":"2025-05-08T16:55:14Z","abstract_excerpt":"For scientific machine learning tasks with a lot of custom code, picking the right Automatic Differentiation (AD) system matters. Our Julia package DifferentiationInterface$.$jl provides a common frontend to a dozen AD backends, unlocking easy comparison and modular development. In particular, its built-in preparation mechanism leverages the strengths of each backend by amortizing one-time computations. This is key to enabling sophisticated features like sparsity handling without putting additional burdens on the user."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05542","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/2505.05542/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":"2505.05542","created_at":"2026-07-05T11:04:00.167860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05542v1","created_at":"2026-07-05T11:04:00.167860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05542","created_at":"2026-07-05T11:04:00.167860+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7FM6DYJEEAD","created_at":"2026-07-05T11:04:00.167860+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7FM6DYJEEADPXQU","created_at":"2026-07-05T11:04:00.167860+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7FM6DYJ","created_at":"2026-07-05T11:04:00.167860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05601","citing_title":"Station-Keeping Approach for Extremely Low Lunar Orbits with Solar Sailing","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19621","citing_title":"Efficient optimisation of multi-parameter quantum control protocols for strongly-coupled systems","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW","json":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW.json","graph_json":"https://pith.science/api/pith-number/K7FM6DYJEEADPXQU7DLLPPY7ZW/graph.json","events_json":"https://pith.science/api/pith-number/K7FM6DYJEEADPXQU7DLLPPY7ZW/events.json","paper":"https://pith.science/paper/K7FM6DYJ"},"agent_actions":{"view_html":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW","download_json":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW.json","view_paper":"https://pith.science/paper/K7FM6DYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05542&json=true","fetch_graph":"https://pith.science/api/pith-number/K7FM6DYJEEADPXQU7DLLPPY7ZW/graph.json","fetch_events":"https://pith.science/api/pith-number/K7FM6DYJEEADPXQU7DLLPPY7ZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW/action/storage_attestation","attest_author":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW/action/author_attestation","sign_citation":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW/action/citation_signature","submit_replication":"https://pith.science/pith/K7FM6DYJEEADPXQU7DLLPPY7ZW/action/replication_record"}},"created_at":"2026-07-05T11:04:00.167860+00:00","updated_at":"2026-07-05T11:04:00.167860+00:00"}