{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JUJFFJHQYWBFGRXEVFXJMAR73N","short_pith_number":"pith:JUJFFJHQ","schema_version":"1.0","canonical_sha256":"4d1252a4f0c5825346e4a96e96023fdb68d77060f075b2cdb9f12ba7a4f3c4a4","source":{"kind":"arxiv","id":"2509.00280","version":1},"attestation_state":"computed","paper":{"title":"ReLATE: Learning Efficient Sparse Encoding for High-Performance Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.LG","authors_text":"Ahmed E. Helal, Fabio Checconi, Fabrizio Petrini, Jan Laukemann, Jee Choi, Jesmin Jahan Tithi, Yongseok Soh","submitted_at":"2025-08-29T23:45:09Z","abstract_excerpt":"Tensor decomposition (TD) is essential for analyzing high-dimensional sparse data, yet its irregular computations and memory-access patterns pose major performance challenges on modern parallel processors. Prior works rely on expert-designed sparse tensor formats that fail to adapt to irregular tensor shapes and/or highly variable data distributions. We present the reinforcement-learned adaptive tensor encoding (ReLATE) framework, a novel learning-augmented method that automatically constructs efficient sparse tensor representations without labeled training samples. ReLATE employs an autonomou"},"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":"2509.00280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-29T23:45:09Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"9dcad6d924954b74d34ffc1190849f06ca4e8a6ef412eda413137b02e6b66fde","abstract_canon_sha256":"2c660f2c1db814b7347bf845470e44ce3a4c3486d5d743d437ebaed695e88468"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:12.753143Z","signature_b64":"pNEy6BlI1LAeWzG7zMovn67st03kU2ffnkwaobhEY2eTxyPhpaLfW1ri+5S9Fq9Cp7I7ExfOLUFwc42D9AwJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d1252a4f0c5825346e4a96e96023fdb68d77060f075b2cdb9f12ba7a4f3c4a4","last_reissued_at":"2026-07-05T12:02:12.752655Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:12.752655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReLATE: Learning Efficient Sparse Encoding for High-Performance Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.LG","authors_text":"Ahmed E. Helal, Fabio Checconi, Fabrizio Petrini, Jan Laukemann, Jee Choi, Jesmin Jahan Tithi, Yongseok Soh","submitted_at":"2025-08-29T23:45:09Z","abstract_excerpt":"Tensor decomposition (TD) is essential for analyzing high-dimensional sparse data, yet its irregular computations and memory-access patterns pose major performance challenges on modern parallel processors. Prior works rely on expert-designed sparse tensor formats that fail to adapt to irregular tensor shapes and/or highly variable data distributions. We present the reinforcement-learned adaptive tensor encoding (ReLATE) framework, a novel learning-augmented method that automatically constructs efficient sparse tensor representations without labeled training samples. ReLATE employs an autonomou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00280","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/2509.00280/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":"2509.00280","created_at":"2026-07-05T12:02:12.752712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.00280v1","created_at":"2026-07-05T12:02:12.752712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00280","created_at":"2026-07-05T12:02:12.752712+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUJFFJHQYWBF","created_at":"2026-07-05T12:02:12.752712+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUJFFJHQYWBFGRXE","created_at":"2026-07-05T12:02:12.752712+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUJFFJHQ","created_at":"2026-07-05T12:02:12.752712+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/JUJFFJHQYWBFGRXEVFXJMAR73N","json":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N.json","graph_json":"https://pith.science/api/pith-number/JUJFFJHQYWBFGRXEVFXJMAR73N/graph.json","events_json":"https://pith.science/api/pith-number/JUJFFJHQYWBFGRXEVFXJMAR73N/events.json","paper":"https://pith.science/paper/JUJFFJHQ"},"agent_actions":{"view_html":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N","download_json":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N.json","view_paper":"https://pith.science/paper/JUJFFJHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.00280&json=true","fetch_graph":"https://pith.science/api/pith-number/JUJFFJHQYWBFGRXEVFXJMAR73N/graph.json","fetch_events":"https://pith.science/api/pith-number/JUJFFJHQYWBFGRXEVFXJMAR73N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N/action/storage_attestation","attest_author":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N/action/author_attestation","sign_citation":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N/action/citation_signature","submit_replication":"https://pith.science/pith/JUJFFJHQYWBFGRXEVFXJMAR73N/action/replication_record"}},"created_at":"2026-07-05T12:02:12.752712+00:00","updated_at":"2026-07-05T12:02:12.752712+00:00"}