{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M454RTTEVTL57DBVB64B2Q77ON","short_pith_number":"pith:M454RTTE","schema_version":"1.0","canonical_sha256":"673bc8ce64acd7df8c350fb81d43ff735969bbb7b53edcedc00f67abd61c02b8","source":{"kind":"arxiv","id":"1811.07515","version":1},"attestation_state":"computed","paper":{"title":"Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Lijie Chen, Ruosong Wang","submitted_at":"2018-11-19T06:05:54Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.07515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-19T06:05:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3a26b9ac4d036c7a1294f6bcee01aae213cc82f5ac3036d3c2c8e93eb4342807","abstract_canon_sha256":"93464a5bf291ba316d8cfc10cf033a28c7d1ca0be7d818aa8fbaba3d3322af56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:24.250205Z","signature_b64":"nhQfkPsmp+SkqJFLiDFbiJOsT0jXOIpmu6LbPE9v2kDosqo3MtPdgnrdNkK9hXs2HSNA+Zj3L1g9G0ercM1UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"673bc8ce64acd7df8c350fb81d43ff735969bbb7b53edcedc00f67abd61c02b8","last_reissued_at":"2026-05-18T00:00:24.249596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:24.249596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Lijie Chen, Ruosong Wang","submitted_at":"2018-11-19T06:05:54Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07515","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.07515","created_at":"2026-05-18T00:00:24.249693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07515v1","created_at":"2026-05-18T00:00:24.249693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07515","created_at":"2026-05-18T00:00:24.249693+00:00"},{"alias_kind":"pith_short_12","alias_value":"M454RTTEVTL5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M454RTTEVTL57DBV","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M454RTTE","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON","json":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON.json","graph_json":"https://pith.science/api/pith-number/M454RTTEVTL57DBVB64B2Q77ON/graph.json","events_json":"https://pith.science/api/pith-number/M454RTTEVTL57DBVB64B2Q77ON/events.json","paper":"https://pith.science/paper/M454RTTE"},"agent_actions":{"view_html":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON","download_json":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON.json","view_paper":"https://pith.science/paper/M454RTTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07515&json=true","fetch_graph":"https://pith.science/api/pith-number/M454RTTEVTL57DBVB64B2Q77ON/graph.json","fetch_events":"https://pith.science/api/pith-number/M454RTTEVTL57DBVB64B2Q77ON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON/action/storage_attestation","attest_author":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON/action/author_attestation","sign_citation":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON/action/citation_signature","submit_replication":"https://pith.science/pith/M454RTTEVTL57DBVB64B2Q77ON/action/replication_record"}},"created_at":"2026-05-18T00:00:24.249693+00:00","updated_at":"2026-05-18T00:00:24.249693+00:00"}