{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G56UNELU6JAZXGUNJAM67A7Q6E","short_pith_number":"pith:G56UNELU","schema_version":"1.0","canonical_sha256":"377d469174f2419b9a8d4819ef83f0f127a15129734b02b8571180730543f254","source":{"kind":"arxiv","id":"2403.11686","version":1},"attestation_state":"computed","paper":{"title":"Crystalformer: Infinitely Connected Attention for Periodic Structure Encoding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","physics.comp-ph"],"primary_cat":"cs.LG","authors_text":"Kanta Ono, Kotaro Saito, Naoya Chiba, Ryo Igarashi, Tatsunori Taniai, Yoshitaka Ushiku, Yuta Suzuki","submitted_at":"2024-03-18T11:37:42Z","abstract_excerpt":"Predicting physical properties of materials from their crystal structures is a fundamental problem in materials science. In peripheral areas such as the prediction of molecular properties, fully connected attention networks have been shown to be successful. However, unlike these finite atom arrangements, crystal structures are infinitely repeating, periodic arrangements of atoms, whose fully connected attention results in infinitely connected attention. In this work, we show that this infinitely connected attention can lead to a computationally tractable formulation, interpreted as neural pote"},"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":"2403.11686","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-18T11:37:42Z","cross_cats_sorted":["cond-mat.mtrl-sci","physics.comp-ph"],"title_canon_sha256":"d278b1f7da4b6bf19c7e122c0c83fe382a9c86e16fbb674e08758f1521212bfb","abstract_canon_sha256":"367357eff3cb7fe9defc504b91c0ba56bc16a0c20683c0971841970cb4d16346"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:20.032022Z","signature_b64":"lEtYlpOSoNu3hJ7WdY000dDNhlPenxZ+1C+ts5OASi/E8rVTG/WDHQpjw08fO4aVmC7k1ToVYJDnejBoFE8yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"377d469174f2419b9a8d4819ef83f0f127a15129734b02b8571180730543f254","last_reissued_at":"2026-07-05T07:57:20.031521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:20.031521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crystalformer: Infinitely Connected Attention for Periodic Structure Encoding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","physics.comp-ph"],"primary_cat":"cs.LG","authors_text":"Kanta Ono, Kotaro Saito, Naoya Chiba, Ryo Igarashi, Tatsunori Taniai, Yoshitaka Ushiku, Yuta Suzuki","submitted_at":"2024-03-18T11:37:42Z","abstract_excerpt":"Predicting physical properties of materials from their crystal structures is a fundamental problem in materials science. In peripheral areas such as the prediction of molecular properties, fully connected attention networks have been shown to be successful. However, unlike these finite atom arrangements, crystal structures are infinitely repeating, periodic arrangements of atoms, whose fully connected attention results in infinitely connected attention. In this work, we show that this infinitely connected attention can lead to a computationally tractable formulation, interpreted as neural pote"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11686","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/2403.11686/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":"2403.11686","created_at":"2026-07-05T07:57:20.031581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.11686v1","created_at":"2026-07-05T07:57:20.031581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11686","created_at":"2026-07-05T07:57:20.031581+00:00"},{"alias_kind":"pith_short_12","alias_value":"G56UNELU6JAZ","created_at":"2026-07-05T07:57:20.031581+00:00"},{"alias_kind":"pith_short_16","alias_value":"G56UNELU6JAZXGUN","created_at":"2026-07-05T07:57:20.031581+00:00"},{"alias_kind":"pith_short_8","alias_value":"G56UNELU","created_at":"2026-07-05T07:57:20.031581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02748","citing_title":"ReciNet: Reciprocal Space-Aware Long-Range Modeling for Crystalline Property Prediction","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E","json":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E.json","graph_json":"https://pith.science/api/pith-number/G56UNELU6JAZXGUNJAM67A7Q6E/graph.json","events_json":"https://pith.science/api/pith-number/G56UNELU6JAZXGUNJAM67A7Q6E/events.json","paper":"https://pith.science/paper/G56UNELU"},"agent_actions":{"view_html":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E","download_json":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E.json","view_paper":"https://pith.science/paper/G56UNELU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.11686&json=true","fetch_graph":"https://pith.science/api/pith-number/G56UNELU6JAZXGUNJAM67A7Q6E/graph.json","fetch_events":"https://pith.science/api/pith-number/G56UNELU6JAZXGUNJAM67A7Q6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E/action/storage_attestation","attest_author":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E/action/author_attestation","sign_citation":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E/action/citation_signature","submit_replication":"https://pith.science/pith/G56UNELU6JAZXGUNJAM67A7Q6E/action/replication_record"}},"created_at":"2026-07-05T07:57:20.031581+00:00","updated_at":"2026-07-05T07:57:20.031581+00:00"}