{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B3LAOQSHCAEYDU36HM6AORCNIK","short_pith_number":"pith:B3LAOQSH","canonical_record":{"source":{"id":"1707.04618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-14T19:46:13Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"2ad65dd2ff15699b1976db42411a1344577fe773a27ad80e58a5f9f55d982a40","abstract_canon_sha256":"a2fefb2389350cf9585a6b03144c756bde7e3cce0633b322829ca34fb1a7520d"},"schema_version":"1.0"},"canonical_sha256":"0ed6074247100981d37e3b3c07444d428f59315512f48115d853e19165a2f890","source":{"kind":"arxiv","id":"1707.04618","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04618","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04618v2","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04618","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"B3LAOQSHCAEY","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"pith_short_16","alias_value":"B3LAOQSHCAEYDU36","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"pith_short_8","alias_value":"B3LAOQSH","created_at":"2026-06-04T18:11:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B3LAOQSHCAEYDU36HM6AORCNIK","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-14T19:46:13Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"2ad65dd2ff15699b1976db42411a1344577fe773a27ad80e58a5f9f55d982a40","abstract_canon_sha256":"a2fefb2389350cf9585a6b03144c756bde7e3cce0633b322829ca34fb1a7520d"},"schema_version":"1.0"},"canonical_sha256":"0ed6074247100981d37e3b3c07444d428f59315512f48115d853e19165a2f890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T18:11:10.203128Z","signature_b64":"X8PlkKj49gU5U5FTJM8N5NzxNPiEvPgehucZP687USuGJ8mCUx7VRZgp0dpT+HIhSczhHA3NumvNk0PHrtAuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed6074247100981d37e3b3c07444d428f59315512f48115d853e19165a2f890","last_reissued_at":"2026-06-04T18:11:10.202633Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T18:11:10.202633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04618","source_version":2,"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-06-04T18:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxUVd4wm3statn/XgXkvQO7Lxf/gWU5c/J1VZ1FZbIxU+K20DBuBYGq7pGRQ+eNAlsknpjeQ5m/x4C6RQJ8VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:45:59.365074Z"},"content_sha256":"dac6e1428cce179beff7fd17c1b1ef6eee86704af1d36481b902a847d9ba993e","schema_version":"1.0","event_id":"sha256:dac6e1428cce179beff7fd17c1b1ef6eee86704af1d36481b902a847d9ba993e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B3LAOQSHCAEYDU36HM6AORCNIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, James Demmel, Torsten Hoefler","submitted_at":"2017-07-14T19:46:13Z","abstract_excerpt":"We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix multiplication, convolution, and symmetric tensor contractions. A bilinear algorithm is described by three matrices. Our communication lower bounds are based on quantifying the minimal matrix ranks of matching subsets of columns of these matrices. This infrastructure yields new communication lower bounds for symmetric tensor contraction algorithms, which provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04618","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1707.04618/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"},"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-06-04T18:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AoCgNbHXL9LaWpGPDp+cKIrmLzJGISxr0JRH/ANND9ojzgQl2gqcbRseLAwb4W+XPDkF8m5ieuzKrlJU8hmcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:45:59.365466Z"},"content_sha256":"63916a2d85b996be04296b2ddb5164be80c5d3d3deddbd3c0deb4d293450a42f","schema_version":"1.0","event_id":"sha256:63916a2d85b996be04296b2ddb5164be80c5d3d3deddbd3c0deb4d293450a42f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3LAOQSHCAEYDU36HM6AORCNIK/bundle.json","state_url":"https://pith.science/pith/B3LAOQSHCAEYDU36HM6AORCNIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3LAOQSHCAEYDU36HM6AORCNIK/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-11T09:45:59Z","links":{"resolver":"https://pith.science/pith/B3LAOQSHCAEYDU36HM6AORCNIK","bundle":"https://pith.science/pith/B3LAOQSHCAEYDU36HM6AORCNIK/bundle.json","state":"https://pith.science/pith/B3LAOQSHCAEYDU36HM6AORCNIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3LAOQSHCAEYDU36HM6AORCNIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B3LAOQSHCAEYDU36HM6AORCNIK","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":"a2fefb2389350cf9585a6b03144c756bde7e3cce0633b322829ca34fb1a7520d","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-14T19:46:13Z","title_canon_sha256":"2ad65dd2ff15699b1976db42411a1344577fe773a27ad80e58a5f9f55d982a40"},"schema_version":"1.0","source":{"id":"1707.04618","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04618","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04618v2","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04618","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"B3LAOQSHCAEY","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"pith_short_16","alias_value":"B3LAOQSHCAEYDU36","created_at":"2026-06-04T18:11:10Z"},{"alias_kind":"pith_short_8","alias_value":"B3LAOQSH","created_at":"2026-06-04T18:11:10Z"}],"graph_snapshots":[{"event_id":"sha256:63916a2d85b996be04296b2ddb5164be80c5d3d3deddbd3c0deb4d293450a42f","target":"graph","created_at":"2026-06-04T18:11:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1707.04618/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix multiplication, convolution, and symmetric tensor contractions. A bilinear algorithm is described by three matrices. Our communication lower bounds are based on quantifying the minimal matrix ranks of matching subsets of columns of these matrices. This infrastructure yields new communication lower bounds for symmetric tensor contraction algorithms, which provide","authors_text":"Edgar Solomonik, James Demmel, Torsten Hoefler","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-14T19:46:13Z","title":"Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04618","kind":"arxiv","version":2},"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:dac6e1428cce179beff7fd17c1b1ef6eee86704af1d36481b902a847d9ba993e","target":"record","created_at":"2026-06-04T18:11:10Z","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":"a2fefb2389350cf9585a6b03144c756bde7e3cce0633b322829ca34fb1a7520d","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-14T19:46:13Z","title_canon_sha256":"2ad65dd2ff15699b1976db42411a1344577fe773a27ad80e58a5f9f55d982a40"},"schema_version":"1.0","source":{"id":"1707.04618","kind":"arxiv","version":2}},"canonical_sha256":"0ed6074247100981d37e3b3c07444d428f59315512f48115d853e19165a2f890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed6074247100981d37e3b3c07444d428f59315512f48115d853e19165a2f890","first_computed_at":"2026-06-04T18:11:10.202633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T18:11:10.202633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8PlkKj49gU5U5FTJM8N5NzxNPiEvPgehucZP687USuGJ8mCUx7VRZgp0dpT+HIhSczhHA3NumvNk0PHrtAuDA==","signature_status":"signed_v1","signed_at":"2026-06-04T18:11:10.203128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04618","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dac6e1428cce179beff7fd17c1b1ef6eee86704af1d36481b902a847d9ba993e","sha256:63916a2d85b996be04296b2ddb5164be80c5d3d3deddbd3c0deb4d293450a42f"],"state_sha256":"dd2057f2f29660a26795725fdbc32e145f8b3a36545647552e5057e2307e1637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37PUWwaEJ7TVzmRdP/xPtzBuSk8pF410ZvTfF6rBcvq0Mvc9WqPdYV7RR9OD0uv9737DFGDSI/xt98HxusV6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:45:59.367391Z","bundle_sha256":"c4459244d19362f19ec9dbde5f55a45e9c44ae21653fa5fa108e4fd6f7e7af9f"}}