{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JKD7F6VS6TXM254EF6ZBF2RRR4","short_pith_number":"pith:JKD7F6VS","schema_version":"1.0","canonical_sha256":"4a87f2fab2f4eecd77842fb212ea318f3942879bfc537181fc9e9c370f5367c0","source":{"kind":"arxiv","id":"2407.13726","version":1},"attestation_state":"computed","paper":{"title":"Compressing Structured Tensor Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MS"],"primary_cat":"cs.PL","authors_text":"Amir Shaikhha, Emilien Bauer, Mahdi Ghorbani, Tobias Grosser","submitted_at":"2024-07-18T17:25:17Z","abstract_excerpt":"Tensor algebra is a crucial component for data-intensive workloads such as machine learning and scientific computing. As the complexity of data grows, scientists often encounter a dilemma between the highly specialized dense tensor algebra and efficient structure-aware algorithms provided by sparse tensor algebra. In this paper, we introduce DASTAC, a framework to propagate the tensors's captured high-level structure down to low-level code generation by incorporating techniques such as automatic data layout compression, polyhedral analysis, and affine code generation. Our methodology reduces m"},"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":"2407.13726","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-07-18T17:25:17Z","cross_cats_sorted":["cs.LG","cs.MS"],"title_canon_sha256":"3ac8d384fb10b6f63a2f011efb30b10cf54e004d9dc8be8a50fd45d884ba31fb","abstract_canon_sha256":"f1a7a845cde5b95e442ceb0e64e43ac85ab93379eaaebebe8a2858c971af95a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:42.981983Z","signature_b64":"49p8bJmNfgQ9ymZDFqMJ5FkiGURp/x96x+gK+kle1wkXQXsBg/QlsVp54P/MtThfSvJ14rWMhv4MuYcxE4MgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a87f2fab2f4eecd77842fb212ea318f3942879bfc537181fc9e9c370f5367c0","last_reissued_at":"2026-07-05T08:45:42.981480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:42.981480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressing Structured Tensor Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MS"],"primary_cat":"cs.PL","authors_text":"Amir Shaikhha, Emilien Bauer, Mahdi Ghorbani, Tobias Grosser","submitted_at":"2024-07-18T17:25:17Z","abstract_excerpt":"Tensor algebra is a crucial component for data-intensive workloads such as machine learning and scientific computing. As the complexity of data grows, scientists often encounter a dilemma between the highly specialized dense tensor algebra and efficient structure-aware algorithms provided by sparse tensor algebra. In this paper, we introduce DASTAC, a framework to propagate the tensors's captured high-level structure down to low-level code generation by incorporating techniques such as automatic data layout compression, polyhedral analysis, and affine code generation. Our methodology reduces m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.13726","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/2407.13726/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":"2407.13726","created_at":"2026-07-05T08:45:42.981543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.13726v1","created_at":"2026-07-05T08:45:42.981543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.13726","created_at":"2026-07-05T08:45:42.981543+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKD7F6VS6TXM","created_at":"2026-07-05T08:45:42.981543+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKD7F6VS6TXM254E","created_at":"2026-07-05T08:45:42.981543+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKD7F6VS","created_at":"2026-07-05T08:45:42.981543+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/JKD7F6VS6TXM254EF6ZBF2RRR4","json":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4.json","graph_json":"https://pith.science/api/pith-number/JKD7F6VS6TXM254EF6ZBF2RRR4/graph.json","events_json":"https://pith.science/api/pith-number/JKD7F6VS6TXM254EF6ZBF2RRR4/events.json","paper":"https://pith.science/paper/JKD7F6VS"},"agent_actions":{"view_html":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4","download_json":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4.json","view_paper":"https://pith.science/paper/JKD7F6VS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.13726&json=true","fetch_graph":"https://pith.science/api/pith-number/JKD7F6VS6TXM254EF6ZBF2RRR4/graph.json","fetch_events":"https://pith.science/api/pith-number/JKD7F6VS6TXM254EF6ZBF2RRR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4/action/storage_attestation","attest_author":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4/action/author_attestation","sign_citation":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4/action/citation_signature","submit_replication":"https://pith.science/pith/JKD7F6VS6TXM254EF6ZBF2RRR4/action/replication_record"}},"created_at":"2026-07-05T08:45:42.981543+00:00","updated_at":"2026-07-05T08:45:42.981543+00:00"}