{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M454RTTEVTL57DBVB64B2Q77ON","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":"93464a5bf291ba316d8cfc10cf033a28c7d1ca0be7d818aa8fbaba3d3322af56","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-19T06:05:54Z","title_canon_sha256":"3a26b9ac4d036c7a1294f6bcee01aae213cc82f5ac3036d3c2c8e93eb4342807"},"schema_version":"1.0","source":{"id":"1811.07515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07515","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07515v1","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07515","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"M454RTTEVTL5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M454RTTEVTL57DBV","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M454RTTE","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:65fba3b445f4c29281d3d622fdf6a8ae2cb817b170143d83fe43519df414a14d","target":"graph","created_at":"2026-05-18T00:00:24Z","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 polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, STOC 2017], almost all applications of the polynomial method in algorithm design ultimately rely on certain low-rank decompositions of the computation matrices corresponding to key subroutines. They suggest that making use of low-rank decompositions directly could lead to more powerful algorithms, as the polynomial method is just one way to derive such a decomposition. Inspired by their observation, in this paper, we ","authors_text":"Lijie Chen, Ruosong Wang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-19T06:05:54Z","title":"Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07515","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:2a255d468a8b6d723bec814edc5db5426983d1eb267e791700058b8dc6ae46e1","target":"record","created_at":"2026-05-18T00:00:24Z","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":"93464a5bf291ba316d8cfc10cf033a28c7d1ca0be7d818aa8fbaba3d3322af56","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-19T06:05:54Z","title_canon_sha256":"3a26b9ac4d036c7a1294f6bcee01aae213cc82f5ac3036d3c2c8e93eb4342807"},"schema_version":"1.0","source":{"id":"1811.07515","kind":"arxiv","version":1}},"canonical_sha256":"673bc8ce64acd7df8c350fb81d43ff735969bbb7b53edcedc00f67abd61c02b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"673bc8ce64acd7df8c350fb81d43ff735969bbb7b53edcedc00f67abd61c02b8","first_computed_at":"2026-05-18T00:00:24.249596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:24.249596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nhQfkPsmp+SkqJFLiDFbiJOsT0jXOIpmu6LbPE9v2kDosqo3MtPdgnrdNkK9hXs2HSNA+Zj3L1g9G0ercM1UAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:24.250205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a255d468a8b6d723bec814edc5db5426983d1eb267e791700058b8dc6ae46e1","sha256:65fba3b445f4c29281d3d622fdf6a8ae2cb817b170143d83fe43519df414a14d"],"state_sha256":"ae5861a63e0c5042b804428d02cfe22fa38f83963565a63dd9cf29da53ae046b"}