{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:A6LFNWB67RNRS3MJ3UGLIG2SBR","short_pith_number":"pith:A6LFNWB6","canonical_record":{"source":{"id":"2311.16342","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-11-27T22:02:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"55a67e8f230a8a925a62951ebc3a2e55d03fe6948623ca5532d0594d3048c3a9","abstract_canon_sha256":"22fe432bfe3ed7f1677ad94c75f76dfa5bf9ee2523bacf74e0ef2f62d45616ac"},"schema_version":"1.0"},"canonical_sha256":"079656d83efc5b196d89dd0cb41b520c542f37b111db1a4f1fdb4934826857f0","source":{"kind":"arxiv","id":"2311.16342","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.16342","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2311.16342v2","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16342","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"A6LFNWB67RNR","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"A6LFNWB67RNRS3MJ","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"A6LFNWB6","created_at":"2026-07-05T07:23:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:A6LFNWB67RNRS3MJ3UGLIG2SBR","target":"record","payload":{"canonical_record":{"source":{"id":"2311.16342","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-11-27T22:02:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"55a67e8f230a8a925a62951ebc3a2e55d03fe6948623ca5532d0594d3048c3a9","abstract_canon_sha256":"22fe432bfe3ed7f1677ad94c75f76dfa5bf9ee2523bacf74e0ef2f62d45616ac"},"schema_version":"1.0"},"canonical_sha256":"079656d83efc5b196d89dd0cb41b520c542f37b111db1a4f1fdb4934826857f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:31.545308Z","signature_b64":"kDDAV7VllNWyD1ecQDXo+Qs+b/HTX09WR6HvkRfs5vMtEwAa0RfbzWLCtV5XE7OpGKgIPtLJvcuSqZ00lzC6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079656d83efc5b196d89dd0cb41b520c542f37b111db1a4f1fdb4934826857f0","last_reissued_at":"2026-07-05T07:23:31.544861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:31.544861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.16342","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-07-05T07:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGE/mwZI+CmPp3SKSGJWeeDdRaXnr+SJOLYOvfyzuSnPE5Z9FyLr7exZNtf451Yzln0pD4h/skoBtOQGs9SWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:32:08.887451Z"},"content_sha256":"dd42c69500511885f271e1004f895d7a94fab78e293a0c318affa70a4b11083f","schema_version":"1.0","event_id":"sha256:dd42c69500511885f271e1004f895d7a94fab78e293a0c318affa70a4b11083f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:A6LFNWB67RNRS3MJ3UGLIG2SBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Gregory Valiant","submitted_at":"2023-11-27T22:02:21Z","abstract_excerpt":"We describe two algorithms for multiplying n x n matrices using time and energy n^2 polylog(n) under basic models of classical physics. The first algorithm is for multiplying integer-valued matrices, and the second, quite different algorithm, is for Boolean matrix multiplication. We hope this work inspires a deeper consideration of physically plausible/realizable models of computing that might allow for algorithms which improve upon the runtimes and energy usages suggested by the parallel RAM model in which each operation requires one unit of time and one unit of energy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16342","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/2311.16342/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-07-05T07:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mN5vddcYErq9k1Cr+0mEBrfy3h9s2mDedou9fIJIYaq1s1KYcVbyFfEjZvde2KYmhUu8f5TvgK1TNhAcrl3wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:32:08.898383Z"},"content_sha256":"d7066be73b5a848a9a965389e54b383ad218afaad4d1008a9a8db79b1ce4b65f","schema_version":"1.0","event_id":"sha256:d7066be73b5a848a9a965389e54b383ad218afaad4d1008a9a8db79b1ce4b65f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR/bundle.json","state_url":"https://pith.science/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR/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-08-07T10:32:08Z","links":{"resolver":"https://pith.science/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR","bundle":"https://pith.science/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR/bundle.json","state":"https://pith.science/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6LFNWB67RNRS3MJ3UGLIG2SBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:A6LFNWB67RNRS3MJ3UGLIG2SBR","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":"22fe432bfe3ed7f1677ad94c75f76dfa5bf9ee2523bacf74e0ef2f62d45616ac","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-11-27T22:02:21Z","title_canon_sha256":"55a67e8f230a8a925a62951ebc3a2e55d03fe6948623ca5532d0594d3048c3a9"},"schema_version":"1.0","source":{"id":"2311.16342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.16342","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2311.16342v2","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16342","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"A6LFNWB67RNR","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"A6LFNWB67RNRS3MJ","created_at":"2026-07-05T07:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"A6LFNWB6","created_at":"2026-07-05T07:23:31Z"}],"graph_snapshots":[{"event_id":"sha256:d7066be73b5a848a9a965389e54b383ad218afaad4d1008a9a8db79b1ce4b65f","target":"graph","created_at":"2026-07-05T07:23:31Z","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/2311.16342/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe two algorithms for multiplying n x n matrices using time and energy n^2 polylog(n) under basic models of classical physics. The first algorithm is for multiplying integer-valued matrices, and the second, quite different algorithm, is for Boolean matrix multiplication. We hope this work inspires a deeper consideration of physically plausible/realizable models of computing that might allow for algorithms which improve upon the runtimes and energy usages suggested by the parallel RAM model in which each operation requires one unit of time and one unit of energy.","authors_text":"Gregory Valiant","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-11-27T22:02:21Z","title":"Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16342","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:dd42c69500511885f271e1004f895d7a94fab78e293a0c318affa70a4b11083f","target":"record","created_at":"2026-07-05T07:23:31Z","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":"22fe432bfe3ed7f1677ad94c75f76dfa5bf9ee2523bacf74e0ef2f62d45616ac","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-11-27T22:02:21Z","title_canon_sha256":"55a67e8f230a8a925a62951ebc3a2e55d03fe6948623ca5532d0594d3048c3a9"},"schema_version":"1.0","source":{"id":"2311.16342","kind":"arxiv","version":2}},"canonical_sha256":"079656d83efc5b196d89dd0cb41b520c542f37b111db1a4f1fdb4934826857f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079656d83efc5b196d89dd0cb41b520c542f37b111db1a4f1fdb4934826857f0","first_computed_at":"2026-07-05T07:23:31.544861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:31.544861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDDAV7VllNWyD1ecQDXo+Qs+b/HTX09WR6HvkRfs5vMtEwAa0RfbzWLCtV5XE7OpGKgIPtLJvcuSqZ00lzC6CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:31.545308Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.16342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd42c69500511885f271e1004f895d7a94fab78e293a0c318affa70a4b11083f","sha256:d7066be73b5a848a9a965389e54b383ad218afaad4d1008a9a8db79b1ce4b65f"],"state_sha256":"5170ce709cf3f16e6514905162d53a88c67bfb0b81cc9b5017110d3fd0568dd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GGPEpBXamEuLIAOqOI68qehjYGOftMKAIh3H6Oaq0zgv5NCAmQaO/YS3r2dhkI0rHbxPTYRIQBapyBjHyEPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:32:08.909400Z","bundle_sha256":"1828ac105ee257600736513c020358bef811b83e75fb9ab6fdaa9c504265ee62"}}