{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IXVQUNHHX6ILG4YB3LZEDCM5VG","short_pith_number":"pith:IXVQUNHH","schema_version":"1.0","canonical_sha256":"45eb0a34e7bf90b37301daf241899da9b2bf9449ace2c2f757a488530a25931b","source":{"kind":"arxiv","id":"1601.05400","version":2},"attestation_state":"computed","paper":{"title":"Fusion of Array Operations at Runtime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"James Avery, Mads R. B. Kristensen, Simon A. F. Lund, Troels Blum","submitted_at":"2016-01-20T20:21:01Z","abstract_excerpt":"We address the problem of fusing array operations based on criteria such as shape compatibility, data reusability, and communication. We formulate the problem as a graph partition problem that is general enough to handle loop fusion, combinator fusion, and other types of subroutines."},"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":"1601.05400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-20T20:21:01Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"061fb1428ccbc364aa800fac35550ff91dc70458d99991f65ffb67da73f600b9","abstract_canon_sha256":"ed6c2b81dae4c19f141c22a00095654675c16cbe0a4ea91d0f91da8fe86de37d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:44.136936Z","signature_b64":"c4hFNZ45fmdSInz12uSRea+iqjelyujC5Y51VxwCwSIMQ8aPVJ22JI9ecrvSXZvuyDWPJYqaFoTsmpmN87DuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45eb0a34e7bf90b37301daf241899da9b2bf9449ace2c2f757a488530a25931b","last_reissued_at":"2026-05-18T01:05:44.136305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:44.136305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fusion of Array Operations at Runtime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"James Avery, Mads R. B. Kristensen, Simon A. F. Lund, Troels Blum","submitted_at":"2016-01-20T20:21:01Z","abstract_excerpt":"We address the problem of fusing array operations based on criteria such as shape compatibility, data reusability, and communication. We formulate the problem as a graph partition problem that is general enough to handle loop fusion, combinator fusion, and other types of subroutines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05400","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":""},"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":"1601.05400","created_at":"2026-05-18T01:05:44.136434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05400v2","created_at":"2026-05-18T01:05:44.136434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05400","created_at":"2026-05-18T01:05:44.136434+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXVQUNHHX6IL","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXVQUNHHX6ILG4YB","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXVQUNHH","created_at":"2026-05-18T12:30:22.444734+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/IXVQUNHHX6ILG4YB3LZEDCM5VG","json":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG.json","graph_json":"https://pith.science/api/pith-number/IXVQUNHHX6ILG4YB3LZEDCM5VG/graph.json","events_json":"https://pith.science/api/pith-number/IXVQUNHHX6ILG4YB3LZEDCM5VG/events.json","paper":"https://pith.science/paper/IXVQUNHH"},"agent_actions":{"view_html":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG","download_json":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG.json","view_paper":"https://pith.science/paper/IXVQUNHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05400&json=true","fetch_graph":"https://pith.science/api/pith-number/IXVQUNHHX6ILG4YB3LZEDCM5VG/graph.json","fetch_events":"https://pith.science/api/pith-number/IXVQUNHHX6ILG4YB3LZEDCM5VG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG/action/storage_attestation","attest_author":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG/action/author_attestation","sign_citation":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG/action/citation_signature","submit_replication":"https://pith.science/pith/IXVQUNHHX6ILG4YB3LZEDCM5VG/action/replication_record"}},"created_at":"2026-05-18T01:05:44.136434+00:00","updated_at":"2026-05-18T01:05:44.136434+00:00"}