{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CLPQ752G2FY6VGXTGVASPB6NFI","short_pith_number":"pith:CLPQ752G","schema_version":"1.0","canonical_sha256":"12df0ff746d171ea9af335412787cd2a2da783d53bc23c81d5053a3dd8ca6980","source":{"kind":"arxiv","id":"2501.02379","version":2},"attestation_state":"computed","paper":{"title":"TensorGRaD: Tensor Gradient Robust Decomposition for Memory-Efficient Neural Operator Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anima Anandkumar, Cheng Luo, David Pitt, Jean Kossaifi, Jiawei Zhao, Robert Joseph George, Sebastian Loeschcke, Yuandong Tian","submitted_at":"2025-01-04T20:51:51Z","abstract_excerpt":"Scientific problems require resolving multi-scale phenomena across different resolutions and learning solution operators in infinite-dimensional function spaces. Neural operators provide a powerful framework for this, using tensor-parameterized layers to capture complex, multi-dimensional relationships. However, scaling neural operators to high-resolution problems leads to significant computational demands, making the training of industrial-scale models prohibitive. In this work, we introduce \\textbf{TensorGRaD}, a novel method that directly addresses the memory challenges associated with opti"},"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":"2501.02379","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-04T20:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"108099736472827262c9c164d8d1848ca6b0f29a5ecf9ad27785b0455b58b536","abstract_canon_sha256":"3ae285b94084bc3da4509c21fe3e1c8e2c1bc384911718304b2e7eb75c3362b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:18.167397Z","signature_b64":"8sJ3NFOPOma3OHI3XT2C3nS7m3jXr8Z0uZ1KahN4eYNpg7aSCYqMcgZKQmwXQ8zDaVyuNrW1VfkIHKackoRNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12df0ff746d171ea9af335412787cd2a2da783d53bc23c81d5053a3dd8ca6980","last_reissued_at":"2026-07-05T11:13:18.166910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:18.166910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TensorGRaD: Tensor Gradient Robust Decomposition for Memory-Efficient Neural Operator Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anima Anandkumar, Cheng Luo, David Pitt, Jean Kossaifi, Jiawei Zhao, Robert Joseph George, Sebastian Loeschcke, Yuandong Tian","submitted_at":"2025-01-04T20:51:51Z","abstract_excerpt":"Scientific problems require resolving multi-scale phenomena across different resolutions and learning solution operators in infinite-dimensional function spaces. Neural operators provide a powerful framework for this, using tensor-parameterized layers to capture complex, multi-dimensional relationships. However, scaling neural operators to high-resolution problems leads to significant computational demands, making the training of industrial-scale models prohibitive. In this work, we introduce \\textbf{TensorGRaD}, a novel method that directly addresses the memory challenges associated with opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02379","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/2501.02379/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":"2501.02379","created_at":"2026-07-05T11:13:18.166968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.02379v2","created_at":"2026-07-05T11:13:18.166968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02379","created_at":"2026-07-05T11:13:18.166968+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLPQ752G2FY6","created_at":"2026-07-05T11:13:18.166968+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLPQ752G2FY6VGXT","created_at":"2026-07-05T11:13:18.166968+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLPQ752G","created_at":"2026-07-05T11:13:18.166968+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/CLPQ752G2FY6VGXTGVASPB6NFI","json":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI.json","graph_json":"https://pith.science/api/pith-number/CLPQ752G2FY6VGXTGVASPB6NFI/graph.json","events_json":"https://pith.science/api/pith-number/CLPQ752G2FY6VGXTGVASPB6NFI/events.json","paper":"https://pith.science/paper/CLPQ752G"},"agent_actions":{"view_html":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI","download_json":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI.json","view_paper":"https://pith.science/paper/CLPQ752G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.02379&json=true","fetch_graph":"https://pith.science/api/pith-number/CLPQ752G2FY6VGXTGVASPB6NFI/graph.json","fetch_events":"https://pith.science/api/pith-number/CLPQ752G2FY6VGXTGVASPB6NFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI/action/storage_attestation","attest_author":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI/action/author_attestation","sign_citation":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI/action/citation_signature","submit_replication":"https://pith.science/pith/CLPQ752G2FY6VGXTGVASPB6NFI/action/replication_record"}},"created_at":"2026-07-05T11:13:18.166968+00:00","updated_at":"2026-07-05T11:13:18.166968+00:00"}