{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4NTLLZYM7K2DJMSEQKFW7OJQDT","short_pith_number":"pith:4NTLLZYM","schema_version":"1.0","canonical_sha256":"e366b5e70cfab434b244828b6fb9301cf16ff8e390d80a449b3dc98343b324b6","source":{"kind":"arxiv","id":"2506.21788","version":1},"attestation_state":"computed","paper":{"title":"Multi-task parallelism for robust pre-training of graph foundation models on multi-source, multi-fidelity atomistic modeling data","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","cs.AI","physics.atm-clus"],"primary_cat":"cs.LG","authors_text":"Ashwin M. Aji, Jong Youl Choi, Jorda Polo, Karl W. Schulz, Kshitij Mehta, Massimiliano Lupo Pasini, Pei Zhang, Prasanna Balaprakash, Rylie Weaver","submitted_at":"2025-06-26T22:04:05Z","abstract_excerpt":"Graph foundation models using graph neural networks promise sustainable, efficient atomistic modeling. To tackle challenges of processing multi-source, multi-fidelity data during pre-training, recent studies employ multi-task learning, in which shared message passing layers initially process input atomistic structures regardless of source, then route them to multiple decoding heads that predict data-specific outputs. This approach stabilizes pre-training and enhances a model's transferability to unexplored chemical regions. Preliminary results on approximately four million structures are encou"},"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":"2506.21788","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-26T22:04:05Z","cross_cats_sorted":["cond-mat.mtrl-sci","cs.AI","physics.atm-clus"],"title_canon_sha256":"999f95c16d14fe263cd1c06c30fb25eb5959984155c56eb88a1fd5055433960f","abstract_canon_sha256":"193e62b7bcfa67f2cb98d11b5025486bc9c3675ac2616159a91b6a0dd74397bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:01.122332Z","signature_b64":"398i3mTYvbaZy4GlSwxMwwwGiTJB7d5uhRoZRmKDLS0/blaIAO75UdAnQZaCVZYcaigGK5Jvd6cpBcWC/TqUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e366b5e70cfab434b244828b6fb9301cf16ff8e390d80a449b3dc98343b324b6","last_reissued_at":"2026-07-05T11:28:01.121835Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:01.121835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-task parallelism for robust pre-training of graph foundation models on multi-source, multi-fidelity atomistic modeling data","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","cs.AI","physics.atm-clus"],"primary_cat":"cs.LG","authors_text":"Ashwin M. Aji, Jong Youl Choi, Jorda Polo, Karl W. Schulz, Kshitij Mehta, Massimiliano Lupo Pasini, Pei Zhang, Prasanna Balaprakash, Rylie Weaver","submitted_at":"2025-06-26T22:04:05Z","abstract_excerpt":"Graph foundation models using graph neural networks promise sustainable, efficient atomistic modeling. To tackle challenges of processing multi-source, multi-fidelity data during pre-training, recent studies employ multi-task learning, in which shared message passing layers initially process input atomistic structures regardless of source, then route them to multiple decoding heads that predict data-specific outputs. This approach stabilizes pre-training and enhances a model's transferability to unexplored chemical regions. Preliminary results on approximately four million structures are encou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21788","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/2506.21788/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":"2506.21788","created_at":"2026-07-05T11:28:01.121900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21788v1","created_at":"2026-07-05T11:28:01.121900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21788","created_at":"2026-07-05T11:28:01.121900+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NTLLZYM7K2D","created_at":"2026-07-05T11:28:01.121900+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NTLLZYM7K2DJMSE","created_at":"2026-07-05T11:28:01.121900+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NTLLZYM","created_at":"2026-07-05T11:28:01.121900+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/4NTLLZYM7K2DJMSEQKFW7OJQDT","json":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT.json","graph_json":"https://pith.science/api/pith-number/4NTLLZYM7K2DJMSEQKFW7OJQDT/graph.json","events_json":"https://pith.science/api/pith-number/4NTLLZYM7K2DJMSEQKFW7OJQDT/events.json","paper":"https://pith.science/paper/4NTLLZYM"},"agent_actions":{"view_html":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT","download_json":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT.json","view_paper":"https://pith.science/paper/4NTLLZYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21788&json=true","fetch_graph":"https://pith.science/api/pith-number/4NTLLZYM7K2DJMSEQKFW7OJQDT/graph.json","fetch_events":"https://pith.science/api/pith-number/4NTLLZYM7K2DJMSEQKFW7OJQDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT/action/storage_attestation","attest_author":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT/action/author_attestation","sign_citation":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT/action/citation_signature","submit_replication":"https://pith.science/pith/4NTLLZYM7K2DJMSEQKFW7OJQDT/action/replication_record"}},"created_at":"2026-07-05T11:28:01.121900+00:00","updated_at":"2026-07-05T11:28:01.121900+00:00"}