{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WA2O74LISWLORVTXQ3ZTZPYSTH","short_pith_number":"pith:WA2O74LI","schema_version":"1.0","canonical_sha256":"b034eff1689596e8d67786f33cbf1299e8f40b9fafb83f576f4e6754b8512d81","source":{"kind":"arxiv","id":"2503.02852","version":2},"attestation_state":"computed","paper":{"title":"Large-Angle Convergent-Beam Electron Diffraction Patterns via Conditional Generative Adversarial Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.mtrl-sci","authors_text":"Joseph J. Webb, Richard Beanland, Rudolf A. R\\\"omer","submitted_at":"2025-03-04T18:28:31Z","abstract_excerpt":"We show how generative machine learning can be used for the rapid computation of strongly dynamical electron diffraction directly from crystal structures, specifically in large-angle convergent-beam electron diffraction (LACBED) patterns. We find that a conditional generative adversarial network can learn the connection between the projected potential from a cubic crystal's unit cell and the corresponding LACBED pattern. Our model can generate diffraction patterns on a GPU many orders of magnitude faster than existing direct simulation methods. Furthermore, our approach can accurately retrieve"},"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":"2503.02852","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2025-03-04T18:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"40e6330997125ac3a15d22b67afb02b0374d2ba94c6cb68e9b2a4ef6d985cb19","abstract_canon_sha256":"962e81c93559656ca7752033dc0687555a91e98d8390837599aea75cc87078bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:32.143473Z","signature_b64":"RcDgNK7wrmAiEWrGWaZN5XlYR1ZFN+Dzf/dBHdF8BPRBZ02VDLOqz1AGDOs34GRtVfr1Tls2HvkDMr41PKnMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b034eff1689596e8d67786f33cbf1299e8f40b9fafb83f576f4e6754b8512d81","last_reissued_at":"2026-07-05T11:45:32.142974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:32.142974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-Angle Convergent-Beam Electron Diffraction Patterns via Conditional Generative Adversarial Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.mtrl-sci","authors_text":"Joseph J. Webb, Richard Beanland, Rudolf A. R\\\"omer","submitted_at":"2025-03-04T18:28:31Z","abstract_excerpt":"We show how generative machine learning can be used for the rapid computation of strongly dynamical electron diffraction directly from crystal structures, specifically in large-angle convergent-beam electron diffraction (LACBED) patterns. We find that a conditional generative adversarial network can learn the connection between the projected potential from a cubic crystal's unit cell and the corresponding LACBED pattern. Our model can generate diffraction patterns on a GPU many orders of magnitude faster than existing direct simulation methods. Furthermore, our approach can accurately retrieve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02852","kind":"arxiv","version":2},"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/2503.02852/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":"2503.02852","created_at":"2026-07-05T11:45:32.143033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.02852v2","created_at":"2026-07-05T11:45:32.143033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02852","created_at":"2026-07-05T11:45:32.143033+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA2O74LISWLO","created_at":"2026-07-05T11:45:32.143033+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA2O74LISWLORVTX","created_at":"2026-07-05T11:45:32.143033+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA2O74LI","created_at":"2026-07-05T11:45:32.143033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13210","citing_title":"Backsolution: A Framework for Solving Inverse Problems via Automatic Differentiation","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH","json":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH.json","graph_json":"https://pith.science/api/pith-number/WA2O74LISWLORVTXQ3ZTZPYSTH/graph.json","events_json":"https://pith.science/api/pith-number/WA2O74LISWLORVTXQ3ZTZPYSTH/events.json","paper":"https://pith.science/paper/WA2O74LI"},"agent_actions":{"view_html":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH","download_json":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH.json","view_paper":"https://pith.science/paper/WA2O74LI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.02852&json=true","fetch_graph":"https://pith.science/api/pith-number/WA2O74LISWLORVTXQ3ZTZPYSTH/graph.json","fetch_events":"https://pith.science/api/pith-number/WA2O74LISWLORVTXQ3ZTZPYSTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH/action/storage_attestation","attest_author":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH/action/author_attestation","sign_citation":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH/action/citation_signature","submit_replication":"https://pith.science/pith/WA2O74LISWLORVTXQ3ZTZPYSTH/action/replication_record"}},"created_at":"2026-07-05T11:45:32.143033+00:00","updated_at":"2026-07-05T11:45:32.143033+00:00"}