{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CFRVS7DL7YZ3JSLZU5IPFMM3RU","short_pith_number":"pith:CFRVS7DL","canonical_record":{"source":{"id":"1308.0068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-08-01T00:15:42Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"44f17f2e1850914cab10761d1d2644d1733ffc583cb9a5dfd1b57d568a032db8","abstract_canon_sha256":"f1c6c01d20cc30142fbc547d89d72b8643b8b311b3cdc6cc6fea578d358f1a60"},"schema_version":"1.0"},"canonical_sha256":"1163597c6bfe33b4c979a750f2b19b8d2717f7a67de39856d735cd53ea59c72b","source":{"kind":"arxiv","id":"1308.0068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0068","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0068v1","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0068","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"CFRVS7DL7YZ3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CFRVS7DL7YZ3JSLZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CFRVS7DL","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CFRVS7DL7YZ3JSLZU5IPFMM3RU","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-08-01T00:15:42Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"44f17f2e1850914cab10761d1d2644d1733ffc583cb9a5dfd1b57d568a032db8","abstract_canon_sha256":"f1c6c01d20cc30142fbc547d89d72b8643b8b311b3cdc6cc6fea578d358f1a60"},"schema_version":"1.0"},"canonical_sha256":"1163597c6bfe33b4c979a750f2b19b8d2717f7a67de39856d735cd53ea59c72b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:59.302928Z","signature_b64":"Kln4rp8nxKfd7+ciSDksuXPtWY+puw/BexWFeDaAgR0Ozbpn52CzqX4B+Bg2AnfWPz8eTM28UCIvbv6IhF1QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1163597c6bfe33b4c979a750f2b19b8d2717f7a67de39856d735cd53ea59c72b","last_reissued_at":"2026-05-18T03:16:59.302365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:59.302365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0068","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-18T03:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oK6ignxeqPYubrPFJBKG9s5qFDzOgswH77mbY9uQH/HB1TzUOkAdLd+Q3IHxBQPz70jZe/jAG5UC5QF7nVU2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:28:12.726982Z"},"content_sha256":"ea0748ef4542dcfc129fa5237f0db1da515b5d90f63947fbda349fb5bdfabe2c","schema_version":"1.0","event_id":"sha256:ea0748ef4542dcfc129fa5237f0db1da515b5d90f63947fbda349fb5bdfabe2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CFRVS7DL7YZ3JSLZU5IPFMM3RU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication lower bounds and optimal algorithms for programs that reference arrays -- Part 1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.CA","authors_text":"James Demmel, Katherine Yelick, Michael Christ, Nicholas Knight, Thomas Scanlon","submitted_at":"2013-08-01T00:15:42Z","abstract_excerpt":"The movement of data (communication) between levels of a memory hierarchy, or between parallel processors on a network, can greatly dominate the cost of computation, so algorithms that minimize communication are of interest. Motivated by this, attainable lower bounds for the amount of communication required by algorithms were established by several groups for a variety of algorithms, including matrix computations. Prior work of Ballard-Demmel-Holtz-Schwartz relied on a geometric inequality of Loomis and Whitney for this purpose. In this paper the general theory of discrete multilinear Holder-B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0068","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-18T03:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHlZbPmCk4yNwh2qajdd/p0eLXYTIG/hIhzfGM7MnIT1r15nLmBgtLXRtAFpgBpOHLhJQqlOFrMyn/YSmTO+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:28:12.727759Z"},"content_sha256":"46e507861790292f311536641768718e8dfae641fa096f953fe908d7170049d1","schema_version":"1.0","event_id":"sha256:46e507861790292f311536641768718e8dfae641fa096f953fe908d7170049d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU/bundle.json","state_url":"https://pith.science/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU/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-06-09T18:28:12Z","links":{"resolver":"https://pith.science/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU","bundle":"https://pith.science/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU/bundle.json","state":"https://pith.science/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFRVS7DL7YZ3JSLZU5IPFMM3RU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CFRVS7DL7YZ3JSLZU5IPFMM3RU","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":"f1c6c01d20cc30142fbc547d89d72b8643b8b311b3cdc6cc6fea578d358f1a60","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-08-01T00:15:42Z","title_canon_sha256":"44f17f2e1850914cab10761d1d2644d1733ffc583cb9a5dfd1b57d568a032db8"},"schema_version":"1.0","source":{"id":"1308.0068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0068","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0068v1","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0068","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"CFRVS7DL7YZ3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CFRVS7DL7YZ3JSLZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CFRVS7DL","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:46e507861790292f311536641768718e8dfae641fa096f953fe908d7170049d1","target":"graph","created_at":"2026-05-18T03:16:59Z","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":"The movement of data (communication) between levels of a memory hierarchy, or between parallel processors on a network, can greatly dominate the cost of computation, so algorithms that minimize communication are of interest. Motivated by this, attainable lower bounds for the amount of communication required by algorithms were established by several groups for a variety of algorithms, including matrix computations. Prior work of Ballard-Demmel-Holtz-Schwartz relied on a geometric inequality of Loomis and Whitney for this purpose. In this paper the general theory of discrete multilinear Holder-B","authors_text":"James Demmel, Katherine Yelick, Michael Christ, Nicholas Knight, Thomas Scanlon","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-08-01T00:15:42Z","title":"Communication lower bounds and optimal algorithms for programs that reference arrays -- Part 1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0068","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:ea0748ef4542dcfc129fa5237f0db1da515b5d90f63947fbda349fb5bdfabe2c","target":"record","created_at":"2026-05-18T03:16:59Z","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":"f1c6c01d20cc30142fbc547d89d72b8643b8b311b3cdc6cc6fea578d358f1a60","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-08-01T00:15:42Z","title_canon_sha256":"44f17f2e1850914cab10761d1d2644d1733ffc583cb9a5dfd1b57d568a032db8"},"schema_version":"1.0","source":{"id":"1308.0068","kind":"arxiv","version":1}},"canonical_sha256":"1163597c6bfe33b4c979a750f2b19b8d2717f7a67de39856d735cd53ea59c72b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1163597c6bfe33b4c979a750f2b19b8d2717f7a67de39856d735cd53ea59c72b","first_computed_at":"2026-05-18T03:16:59.302365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:59.302365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kln4rp8nxKfd7+ciSDksuXPtWY+puw/BexWFeDaAgR0Ozbpn52CzqX4B+Bg2AnfWPz8eTM28UCIvbv6IhF1QBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:59.302928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea0748ef4542dcfc129fa5237f0db1da515b5d90f63947fbda349fb5bdfabe2c","sha256:46e507861790292f311536641768718e8dfae641fa096f953fe908d7170049d1"],"state_sha256":"67e2a80bcd56a1220450f5dcf8e4b68a0b979ff03b90380915d9430cb0301c24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Tbyld2Fue5MUqytC178YY8J2CaIYfWa6E8vvV+8eDP0HTu1KqG4rev688OnXNvRkc4x6tx+oee2QcrpxEluAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:28:12.732252Z","bundle_sha256":"66080ce7f738bcc6a68532c5b7182c807706571f3a7d86ff1fd2479c7b4ffbfe"}}