{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ADX7OMSJ2OKNE3MYECL4RBTF6G","short_pith_number":"pith:ADX7OMSJ","schema_version":"1.0","canonical_sha256":"00eff73249d394d26d982097c88665f19658474ac9d81b9170cd66ab68049aa9","source":{"kind":"arxiv","id":"1709.02034","version":4},"attestation_state":"computed","paper":{"title":"String Matching: Communication, Circuits, and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Golovnev, Daniel Reichman, Igor Shinkar, Mika G\\\"o\\\"os","submitted_at":"2017-09-07T00:52:20Z","abstract_excerpt":"String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings.\n  Communication complexity. For small $k$, we provide near-optimal upper and lower bounds on the communication complexity of string matching. For large $k$, our bounds leave open an exponential gap; we exhibit some evidence for the existence of a better protocol.\n  Circuit complexity. We present several upper and lower bounds on the size of circuits with threshold and DeMorgan gates solving the string matching problem. Similarly "},"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":"1709.02034","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T00:52:20Z","cross_cats_sorted":[],"title_canon_sha256":"76f554cfdd535115999792fb815bc5b162ff918ba320bbb423518b42d799e738","abstract_canon_sha256":"3703408461a83ba212890b2e8168af21ec0dc10fc5eae2d8f6d7c36ff42d7006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:12.000342Z","signature_b64":"Yae8qpVx6Pkmjl1T3JaB/8MsWVZtfo0/kSiF0XcB+nJxR8D9itRET5tMekG41tH/xea0qoEOwoEJbEqMch2KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00eff73249d394d26d982097c88665f19658474ac9d81b9170cd66ab68049aa9","last_reissued_at":"2026-05-17T23:53:11.999619Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:11.999619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String Matching: Communication, Circuits, and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Golovnev, Daniel Reichman, Igor Shinkar, Mika G\\\"o\\\"os","submitted_at":"2017-09-07T00:52:20Z","abstract_excerpt":"String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings.\n  Communication complexity. For small $k$, we provide near-optimal upper and lower bounds on the communication complexity of string matching. For large $k$, our bounds leave open an exponential gap; we exhibit some evidence for the existence of a better protocol.\n  Circuit complexity. We present several upper and lower bounds on the size of circuits with threshold and DeMorgan gates solving the string matching problem. Similarly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02034","kind":"arxiv","version":4},"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":"1709.02034","created_at":"2026-05-17T23:53:11.999723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02034v4","created_at":"2026-05-17T23:53:11.999723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02034","created_at":"2026-05-17T23:53:11.999723+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADX7OMSJ2OKN","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADX7OMSJ2OKNE3MY","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADX7OMSJ","created_at":"2026-05-18T12:31:05.417338+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/ADX7OMSJ2OKNE3MYECL4RBTF6G","json":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G.json","graph_json":"https://pith.science/api/pith-number/ADX7OMSJ2OKNE3MYECL4RBTF6G/graph.json","events_json":"https://pith.science/api/pith-number/ADX7OMSJ2OKNE3MYECL4RBTF6G/events.json","paper":"https://pith.science/paper/ADX7OMSJ"},"agent_actions":{"view_html":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G","download_json":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G.json","view_paper":"https://pith.science/paper/ADX7OMSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02034&json=true","fetch_graph":"https://pith.science/api/pith-number/ADX7OMSJ2OKNE3MYECL4RBTF6G/graph.json","fetch_events":"https://pith.science/api/pith-number/ADX7OMSJ2OKNE3MYECL4RBTF6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/action/storage_attestation","attest_author":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/action/author_attestation","sign_citation":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/action/citation_signature","submit_replication":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/action/replication_record"}},"created_at":"2026-05-17T23:53:11.999723+00:00","updated_at":"2026-05-17T23:53:11.999723+00:00"}