{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RADHIN7GLL5Z6VVUBIKRLX2TAL","short_pith_number":"pith:RADHIN7G","schema_version":"1.0","canonical_sha256":"88067437e65afb9f56b40a1515df5302cd8f182586226726ea8d60929138cfb7","source":{"kind":"arxiv","id":"1807.10852","version":1},"attestation_state":"computed","paper":{"title":"Sparse Matrix Code Dependence Analysis Simplification at Compile Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Anand Venkat, Ganesh Gopalakrishnan, Kazem Cheshmi, Mahdi Soltan Mohammadi, Maryam Mehri Dehnavi, Mary Hall, Michelle Mills Strout, Tomofumi Yuki","submitted_at":"2018-07-27T23:08:46Z","abstract_excerpt":"Analyzing array-based computations to determine data dependences is useful for many applications including automatic parallelization, race detection, computation and communication overlap, verification, and shape analysis. For sparse matrix codes, array data dependence analysis is made more difficult by the use of index arrays that make it possible to store only the nonzero entries of the matrix (e.g., in A[B[i]], B is an index array). Here, dependence analysis is often stymied by such indirect array accesses due to the values of the index array not being available at compile time. Consequentl"},"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":"1807.10852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-27T23:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"83cbf0a54aa8dd81079efaa3ec33a8cc392c08fa8f56d34b25df2896347588a6","abstract_canon_sha256":"a34e00a92b9fcd16695b3c05c1580ac6f3f7ae3a8faf7916067b1083e5ce7503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:37.226398Z","signature_b64":"u4OhFTvocVaO4NPLNrdJ3B8w0+m9sd3B3owFDqxAHxd9JzPA+MtJotOD1k0j4uWixRbp6ghYyKAF11XJlxRYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88067437e65afb9f56b40a1515df5302cd8f182586226726ea8d60929138cfb7","last_reissued_at":"2026-05-18T00:09:37.225918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:37.225918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Matrix Code Dependence Analysis Simplification at Compile Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Anand Venkat, Ganesh Gopalakrishnan, Kazem Cheshmi, Mahdi Soltan Mohammadi, Maryam Mehri Dehnavi, Mary Hall, Michelle Mills Strout, Tomofumi Yuki","submitted_at":"2018-07-27T23:08:46Z","abstract_excerpt":"Analyzing array-based computations to determine data dependences is useful for many applications including automatic parallelization, race detection, computation and communication overlap, verification, and shape analysis. For sparse matrix codes, array data dependence analysis is made more difficult by the use of index arrays that make it possible to store only the nonzero entries of the matrix (e.g., in A[B[i]], B is an index array). Here, dependence analysis is often stymied by such indirect array accesses due to the values of the index array not being available at compile time. Consequentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10852","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":""},"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":"1807.10852","created_at":"2026-05-18T00:09:37.225988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10852v1","created_at":"2026-05-18T00:09:37.225988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10852","created_at":"2026-05-18T00:09:37.225988+00:00"},{"alias_kind":"pith_short_12","alias_value":"RADHIN7GLL5Z","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RADHIN7GLL5Z6VVU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RADHIN7G","created_at":"2026-05-18T12:32:50.500415+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/RADHIN7GLL5Z6VVUBIKRLX2TAL","json":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL.json","graph_json":"https://pith.science/api/pith-number/RADHIN7GLL5Z6VVUBIKRLX2TAL/graph.json","events_json":"https://pith.science/api/pith-number/RADHIN7GLL5Z6VVUBIKRLX2TAL/events.json","paper":"https://pith.science/paper/RADHIN7G"},"agent_actions":{"view_html":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL","download_json":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL.json","view_paper":"https://pith.science/paper/RADHIN7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10852&json=true","fetch_graph":"https://pith.science/api/pith-number/RADHIN7GLL5Z6VVUBIKRLX2TAL/graph.json","fetch_events":"https://pith.science/api/pith-number/RADHIN7GLL5Z6VVUBIKRLX2TAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL/action/storage_attestation","attest_author":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL/action/author_attestation","sign_citation":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL/action/citation_signature","submit_replication":"https://pith.science/pith/RADHIN7GLL5Z6VVUBIKRLX2TAL/action/replication_record"}},"created_at":"2026-05-18T00:09:37.225988+00:00","updated_at":"2026-05-18T00:09:37.225988+00:00"}