{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OGNEXS32YC6AYIRHJSYKGSTQYT","short_pith_number":"pith:OGNEXS32","schema_version":"1.0","canonical_sha256":"719a4bcb7ac0bc0c22274cb0a34a70c4e7ee22c5ddd9712662ac45f64eb18221","source":{"kind":"arxiv","id":"1512.02737","version":1},"attestation_state":"computed","paper":{"title":"Using Symmetry to Schedule Classical Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Harsha Vardhan Simhadri","submitted_at":"2015-12-09T03:34:55Z","abstract_excerpt":"Presented with a new machine with a specific interconnect topology, algorithm designers use intuition about the symmetry of the algorithm to design time and communication-efficient schedules that map the algorithm to the machine. Is there a systematic procedure for designing schedules? We present a new technique to design schedules for algorithms with no non-trivial dependencies, focusing on the classical matrix multiplication algorithm.\n  We model the symmetry of algorithm with the set of instructions $X$ as the action of the group formed by the compositions of bijections from the set $X$ to "},"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":"1512.02737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-09T03:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"6729419a19fce2ec974aae6860f4aaae81c23f8d2923993595e8789554b9a780","abstract_canon_sha256":"3512baed43ef3576225f589cceb17d08359ebf4f9ed9cec594c3ed2137b5159a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:43.214243Z","signature_b64":"8vWmov7br8NA49euGIQYVSTm8MCcGrLq3v1BDMwyYZlJSbebm0gdn4Ka3Yba8WAuq8huZTV+PUWToyvxWkSvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"719a4bcb7ac0bc0c22274cb0a34a70c4e7ee22c5ddd9712662ac45f64eb18221","last_reissued_at":"2026-05-18T01:24:43.213775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:43.213775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Symmetry to Schedule Classical Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Harsha Vardhan Simhadri","submitted_at":"2015-12-09T03:34:55Z","abstract_excerpt":"Presented with a new machine with a specific interconnect topology, algorithm designers use intuition about the symmetry of the algorithm to design time and communication-efficient schedules that map the algorithm to the machine. Is there a systematic procedure for designing schedules? We present a new technique to design schedules for algorithms with no non-trivial dependencies, focusing on the classical matrix multiplication algorithm.\n  We model the symmetry of algorithm with the set of instructions $X$ as the action of the group formed by the compositions of bijections from the set $X$ to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02737","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":"1512.02737","created_at":"2026-05-18T01:24:43.213853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02737v1","created_at":"2026-05-18T01:24:43.213853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02737","created_at":"2026-05-18T01:24:43.213853+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGNEXS32YC6A","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGNEXS32YC6AYIRH","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGNEXS32","created_at":"2026-05-18T12:29:34.919912+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/OGNEXS32YC6AYIRHJSYKGSTQYT","json":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT.json","graph_json":"https://pith.science/api/pith-number/OGNEXS32YC6AYIRHJSYKGSTQYT/graph.json","events_json":"https://pith.science/api/pith-number/OGNEXS32YC6AYIRHJSYKGSTQYT/events.json","paper":"https://pith.science/paper/OGNEXS32"},"agent_actions":{"view_html":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT","download_json":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT.json","view_paper":"https://pith.science/paper/OGNEXS32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02737&json=true","fetch_graph":"https://pith.science/api/pith-number/OGNEXS32YC6AYIRHJSYKGSTQYT/graph.json","fetch_events":"https://pith.science/api/pith-number/OGNEXS32YC6AYIRHJSYKGSTQYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/action/storage_attestation","attest_author":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/action/author_attestation","sign_citation":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/action/citation_signature","submit_replication":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/action/replication_record"}},"created_at":"2026-05-18T01:24:43.213853+00:00","updated_at":"2026-05-18T01:24:43.213853+00:00"}