{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5FSUXSLURGKZSSKDHNFBENJ4W4","short_pith_number":"pith:5FSUXSLU","schema_version":"1.0","canonical_sha256":"e9654bc97489959949433b4a12353cb71ac8caafd422ae95171fcc1675f70414","source":{"kind":"arxiv","id":"2410.19927","version":1},"attestation_state":"computed","paper":{"title":"Scheduling Languages: A Past, Present, and Future Taxonomy","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.PL","authors_text":"Amir Mohammad Tavakkoli, Anne C. Elster, Ari Rasch, Cosmin Oancea, Mary Hall, Richard Schulze, Sameeran Joshi","submitted_at":"2024-10-25T18:52:57Z","abstract_excerpt":"Scheduling languages express to a compiler a sequence of optimizations to apply. Compilers that support a scheduling language interface allow exploration of compiler optimizations, i.e., exploratory compilers. While scheduling languages have become a common feature of tools for expert users, the proliferation of these languages without unifying common features may be confusing to users. Moreover, we recognize a need to organize the compiler developer community around common exploratory compiler infrastructure, and future advances to address, for example, data layout and data movement. To suppo"},"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":"2410.19927","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-10-25T18:52:57Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"8062a4ffc245c61105594830d2a48086676ff1715552105aa530d21d80a08034","abstract_canon_sha256":"1feda5f50a5f6008d4d715de72430758d2115aae86def8366861e2d841ebef52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:35.814080Z","signature_b64":"GyaM6uSYETgoAe/lBz4F9KdiqhVGzUbkvtkPAeG4ndWHMURPxC/hWBlteIvdSPJ+d+ixGI85ALQbYh1OFXQJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9654bc97489959949433b4a12353cb71ac8caafd422ae95171fcc1675f70414","last_reissued_at":"2026-07-05T09:26:35.813592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:35.813592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Languages: A Past, Present, and Future Taxonomy","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.PL","authors_text":"Amir Mohammad Tavakkoli, Anne C. Elster, Ari Rasch, Cosmin Oancea, Mary Hall, Richard Schulze, Sameeran Joshi","submitted_at":"2024-10-25T18:52:57Z","abstract_excerpt":"Scheduling languages express to a compiler a sequence of optimizations to apply. Compilers that support a scheduling language interface allow exploration of compiler optimizations, i.e., exploratory compilers. While scheduling languages have become a common feature of tools for expert users, the proliferation of these languages without unifying common features may be confusing to users. Moreover, we recognize a need to organize the compiler developer community around common exploratory compiler infrastructure, and future advances to address, for example, data layout and data movement. To suppo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19927","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/2410.19927/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":"2410.19927","created_at":"2026-07-05T09:26:35.813651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.19927v1","created_at":"2026-07-05T09:26:35.813651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19927","created_at":"2026-07-05T09:26:35.813651+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FSUXSLURGKZ","created_at":"2026-07-05T09:26:35.813651+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FSUXSLURGKZSSKD","created_at":"2026-07-05T09:26:35.813651+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FSUXSLU","created_at":"2026-07-05T09:26:35.813651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.08906","citing_title":"Comparing Parallel Functional Array Languages: Programming and Performance","ref_index":84,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4","json":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4.json","graph_json":"https://pith.science/api/pith-number/5FSUXSLURGKZSSKDHNFBENJ4W4/graph.json","events_json":"https://pith.science/api/pith-number/5FSUXSLURGKZSSKDHNFBENJ4W4/events.json","paper":"https://pith.science/paper/5FSUXSLU"},"agent_actions":{"view_html":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4","download_json":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4.json","view_paper":"https://pith.science/paper/5FSUXSLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.19927&json=true","fetch_graph":"https://pith.science/api/pith-number/5FSUXSLURGKZSSKDHNFBENJ4W4/graph.json","fetch_events":"https://pith.science/api/pith-number/5FSUXSLURGKZSSKDHNFBENJ4W4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4/action/storage_attestation","attest_author":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4/action/author_attestation","sign_citation":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4/action/citation_signature","submit_replication":"https://pith.science/pith/5FSUXSLURGKZSSKDHNFBENJ4W4/action/replication_record"}},"created_at":"2026-07-05T09:26:35.813651+00:00","updated_at":"2026-07-05T09:26:35.813651+00:00"}