{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OGNEXS32YC6AYIRHJSYKGSTQYT","short_pith_number":"pith:OGNEXS32","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"},"canonical_sha256":"719a4bcb7ac0bc0c22274cb0a34a70c4e7ee22c5ddd9712662ac45f64eb18221","source":{"kind":"arxiv","id":"1512.02737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02737","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02737v1","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02737","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"OGNEXS32YC6A","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OGNEXS32YC6AYIRH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OGNEXS32","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OGNEXS32YC6AYIRHJSYKGSTQYT","target":"record","payload":{"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"},"canonical_sha256":"719a4bcb7ac0bc0c22274cb0a34a70c4e7ee22c5ddd9712662ac45f64eb18221","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"},"source_kind":"arxiv","source_id":"1512.02737","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvynvFAqTUj6bui75Nu39BDUyZXAt5R2lCfCEwh++5GWOxKcqU1Fo0FnDFdsG6GnWadR8gZK3RONkAyW3ux5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:30:46.340812Z"},"content_sha256":"8c40880b0619bcf4815bb42d25794b94162bcfc7d8227017ca618d00caa0a63a","schema_version":"1.0","event_id":"sha256:8c40880b0619bcf4815bb42d25794b94162bcfc7d8227017ca618d00caa0a63a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OGNEXS32YC6AYIRHJSYKGSTQYT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ny9tfj/Q0IrSp3sgr4NVIzTu1PP17wbPpziQo7KYXB8QJ47i8JWGvtA04l31B6uu5SCUFBPhWFQU0BYyrV+WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:30:46.341168Z"},"content_sha256":"3b53b664064afcacbcbacc4970e84a96ccdd91522c92fe00fb36b2fa38b522e3","schema_version":"1.0","event_id":"sha256:3b53b664064afcacbcbacc4970e84a96ccdd91522c92fe00fb36b2fa38b522e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/bundle.json","state_url":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T13:30:46Z","links":{"resolver":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT","bundle":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/bundle.json","state":"https://pith.science/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGNEXS32YC6AYIRHJSYKGSTQYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OGNEXS32YC6AYIRHJSYKGSTQYT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3512baed43ef3576225f589cceb17d08359ebf4f9ed9cec594c3ed2137b5159a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-09T03:34:55Z","title_canon_sha256":"6729419a19fce2ec974aae6860f4aaae81c23f8d2923993595e8789554b9a780"},"schema_version":"1.0","source":{"id":"1512.02737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02737","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02737v1","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02737","created_at":"2026-05-18T01:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"OGNEXS32YC6A","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OGNEXS32YC6AYIRH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OGNEXS32","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:3b53b664064afcacbcbacc4970e84a96ccdd91522c92fe00fb36b2fa38b522e3","target":"graph","created_at":"2026-05-18T01:24:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Harsha Vardhan Simhadri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-09T03:34:55Z","title":"Using Symmetry to Schedule Classical Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02737","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c40880b0619bcf4815bb42d25794b94162bcfc7d8227017ca618d00caa0a63a","target":"record","created_at":"2026-05-18T01:24:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3512baed43ef3576225f589cceb17d08359ebf4f9ed9cec594c3ed2137b5159a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-09T03:34:55Z","title_canon_sha256":"6729419a19fce2ec974aae6860f4aaae81c23f8d2923993595e8789554b9a780"},"schema_version":"1.0","source":{"id":"1512.02737","kind":"arxiv","version":1}},"canonical_sha256":"719a4bcb7ac0bc0c22274cb0a34a70c4e7ee22c5ddd9712662ac45f64eb18221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"719a4bcb7ac0bc0c22274cb0a34a70c4e7ee22c5ddd9712662ac45f64eb18221","first_computed_at":"2026-05-18T01:24:43.213775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:43.213775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8vWmov7br8NA49euGIQYVSTm8MCcGrLq3v1BDMwyYZlJSbebm0gdn4Ka3Yba8WAuq8huZTV+PUWToyvxWkSvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:43.214243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c40880b0619bcf4815bb42d25794b94162bcfc7d8227017ca618d00caa0a63a","sha256:3b53b664064afcacbcbacc4970e84a96ccdd91522c92fe00fb36b2fa38b522e3"],"state_sha256":"480ad1d5edd7b4976a817c7421c3360a3de4ac570f8f0b0303856428d50b21b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StC+BgZYiDhi5iRbfCR2Nikqm9tp5XKZUIRsXm6/SF8jfw0MJntlaU4pKeULViurZuUGRHCP8nMiRX6urVLFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:30:46.343174Z","bundle_sha256":"1b9498c0532e3c823bdc419b59dc10b3ee3fff24114cb1139e77164681448303"}}