{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VE4HWBM6DCP55BBHCK6LXZXVE5","short_pith_number":"pith:VE4HWBM6","schema_version":"1.0","canonical_sha256":"a9387b059e189fde842712bcbbe6f52773ca788f106e42b0842dd4498a4e4876","source":{"kind":"arxiv","id":"2605.01304","version":2},"attestation_state":"computed","paper":{"title":"SR-CGCNN: Shared Recurrent Convolution in Crystal Graph Neural Networks for Materials Property Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Tying convolutional weights across recurrent steps in crystal graph networks lets a three-step model nearly match a three-layer model's accuracy on formation energy and band gap while using only 34.5 percent of the parameters.","cross_cats":[],"primary_cat":"cond-mat.mtrl-sci","authors_text":"Satadeep Bhattacharjee","submitted_at":"2026-05-02T07:26:36Z","abstract_excerpt":"Crystal graph neural networks predict materials properties by propagating information through local atomic environments. In conventional crystal graph convolutional neural networks (CGCNNs), this propagation depth is increased by stacking independently parameterized convolutional layers. This coupling between message-passing depth and parameter count raises a simple question: can repeated application of the same learned local update recover most of the benefit of a deeper CGCNN? We address this question by introducing a shared-recurrent CGCNN (SR-CGCNN), in which the main crystal-graph convolu"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.01304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2026-05-02T07:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"888dadf38172ea909e86c89007aa81eb047a6f01863393f185e113b641f8081a","abstract_canon_sha256":"7bdcd6534478818903c4b49227bed2ab4b4aa8f5d7e95eadcc6e87c58fdf1fe5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:40.215413Z","signature_b64":"+C0yxKUFma7Sx9DLnT2fHZO7QmWPjV5CFRRe0YPWH3+RrWGX6aChJzwtW8qTTuaMVfxe4CdSLA1n6GAO0VNVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9387b059e189fde842712bcbbe6f52773ca788f106e42b0842dd4498a4e4876","last_reissued_at":"2026-05-20T00:00:40.214795Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:40.214795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SR-CGCNN: Shared Recurrent Convolution in Crystal Graph Neural Networks for Materials Property Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Tying convolutional weights across recurrent steps in crystal graph networks lets a three-step model nearly match a three-layer model's accuracy on formation energy and band gap while using only 34.5 percent of the parameters.","cross_cats":[],"primary_cat":"cond-mat.mtrl-sci","authors_text":"Satadeep Bhattacharjee","submitted_at":"2026-05-02T07:26:36Z","abstract_excerpt":"Crystal graph neural networks predict materials properties by propagating information through local atomic environments. In conventional crystal graph convolutional neural networks (CGCNNs), this propagation depth is increased by stacking independently parameterized convolutional layers. This coupling between message-passing depth and parameter count raises a simple question: can repeated application of the same learned local update recover most of the benefit of a deeper CGCNN? We address this question by introducing a shared-recurrent CGCNN (SR-CGCNN), in which the main crystal-graph convolu"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"A three-step SR-CGCNN approaches the accuracy of a standard three-layer CGCNN while using only 34.5% of its trainable convolutional parameters, with formation-energy MAE changing from 0.0945 to 0.0986 eV atom^{-1} and band-gap MAE from 0.4346 to 0.4503 eV.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that keeping graph construction, pooling, and prediction head identical produces a fair head-to-head comparison between stacked and recurrent message passing; any difference in optimization dynamics or effective receptive field could still favor one architecture.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SR-CGCNN applies shared weights across recurrent steps in crystal graph convolutions, matching three-layer CGCNN accuracy on Materials Project data with 34.5% of the parameters.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Tying convolutional weights across recurrent steps in crystal graph networks lets a three-step model nearly match a three-layer model's accuracy on formation energy and band gap while using only 34.5 percent of the parameters.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d745b9eabf3ac29568d076d28abcbfc2b5813806864ce3b90e119014343fba62"},"source":{"id":"2605.01304","kind":"arxiv","version":2},"verdict":{"id":"ef65bb97-5257-4c69-a5b6-d2dc68d97bd7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T17:44:47.750643Z","strongest_claim":"A three-step SR-CGCNN approaches the accuracy of a standard three-layer CGCNN while using only 34.5% of its trainable convolutional parameters, with formation-energy MAE changing from 0.0945 to 0.0986 eV atom^{-1} and band-gap MAE from 0.4346 to 0.4503 eV.","one_line_summary":"SR-CGCNN applies shared weights across recurrent steps in crystal graph convolutions, matching three-layer CGCNN accuracy on Materials Project data with 34.5% of the parameters.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that keeping graph construction, pooling, and prediction head identical produces a fair head-to-head comparison between stacked and recurrent message passing; any difference in optimization dynamics or effective receptive field could still favor one architecture.","pith_extraction_headline":"Tying convolutional weights across recurrent steps in crystal graph networks lets a three-step model nearly match a three-layer model's accuracy on formation energy and band gap while using only 34.5 percent of the parameters."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01304/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T17:22:17.260570Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ddbb8cded0db67af8df293981b50fc0e8a9c57bfb2f28ddf5f6efd3b7ee0b47c"},"references":{"count":19,"sample":[{"doi":"","year":2022,"title":"P. Reiser, M. Neubert, A. Eberhard, L. Torresi, C. Zhou, C. Shao, H. Metni, C. van Hoesel, H. Schopmans, T. Sommer,et al., Communications Materials3, 93 (2022)","work_id":"a0051caf-3ef7-492a-a512-9f69ef4727ba","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"V. Fung, J. Zhang, E. Juarez, and B. G. Sumpter, npj Computational Materials7, 84 (2021)","work_id":"e9adc29b-9167-4325-b8dd-be1dd09af188","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"T. Xie and J. C. Grossman, Physical review letters120, 145301 (2018)","work_id":"47f3c48c-2f5e-4c4a-b50c-e10c9baa3ce8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"C. J. Bartel, A. Trewartha, Q. Wang, A. Dunn, A. Jain, and G. Ceder, npj computational materials6, 97 (2020)","work_id":"ce0e1cee-f82a-4c92-8c4f-a4015123ae17","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"G. Xu, Y. Xue, X. Geng, X. Hou, and J. Xu, Materials Genome Engineering Advances2, e38 (2024)","work_id":"2dae89a6-0729-4c19-b60d-754dea9ea477","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":19,"snapshot_sha256":"109761a65f3c7b0e7c536d27f99609be81682e4ceab8e3c09174aaa8dab5faea","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":"2605.01304","created_at":"2026-05-20T00:00:40.214900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.01304v2","created_at":"2026-05-20T00:00:40.214900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01304","created_at":"2026-05-20T00:00:40.214900+00:00"},{"alias_kind":"pith_short_12","alias_value":"VE4HWBM6DCP5","created_at":"2026-05-20T00:00:40.214900+00:00"},{"alias_kind":"pith_short_16","alias_value":"VE4HWBM6DCP55BBH","created_at":"2026-05-20T00:00:40.214900+00:00"},{"alias_kind":"pith_short_8","alias_value":"VE4HWBM6","created_at":"2026-05-20T00:00:40.214900+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/VE4HWBM6DCP55BBHCK6LXZXVE5","json":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5.json","graph_json":"https://pith.science/api/pith-number/VE4HWBM6DCP55BBHCK6LXZXVE5/graph.json","events_json":"https://pith.science/api/pith-number/VE4HWBM6DCP55BBHCK6LXZXVE5/events.json","paper":"https://pith.science/paper/VE4HWBM6"},"agent_actions":{"view_html":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5","download_json":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5.json","view_paper":"https://pith.science/paper/VE4HWBM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.01304&json=true","fetch_graph":"https://pith.science/api/pith-number/VE4HWBM6DCP55BBHCK6LXZXVE5/graph.json","fetch_events":"https://pith.science/api/pith-number/VE4HWBM6DCP55BBHCK6LXZXVE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5/action/storage_attestation","attest_author":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5/action/author_attestation","sign_citation":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5/action/citation_signature","submit_replication":"https://pith.science/pith/VE4HWBM6DCP55BBHCK6LXZXVE5/action/replication_record"}},"created_at":"2026-05-20T00:00:40.214900+00:00","updated_at":"2026-05-20T00:00:40.214900+00:00"}