{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ADX7OMSJ2OKNE3MYECL4RBTF6G","short_pith_number":"pith:ADX7OMSJ","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"},"canonical_sha256":"00eff73249d394d26d982097c88665f19658474ac9d81b9170cd66ab68049aa9","source":{"kind":"arxiv","id":"1709.02034","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02034","created_at":"2026-05-17T23:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02034v4","created_at":"2026-05-17T23:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02034","created_at":"2026-05-17T23:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"ADX7OMSJ2OKN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ADX7OMSJ2OKNE3MY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ADX7OMSJ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ADX7OMSJ2OKNE3MYECL4RBTF6G","target":"record","payload":{"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"},"canonical_sha256":"00eff73249d394d26d982097c88665f19658474ac9d81b9170cd66ab68049aa9","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"},"source_kind":"arxiv","source_id":"1709.02034","source_version":4,"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-05-17T23:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsnbyVx53/VKP7+AR3MmeYjDReqbd1IPXEfX7bp7P9/Wa0rXLeOkQsc4+4VbYB9FjB4GnPaetvvhZOffQrIJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:45:14.925501Z"},"content_sha256":"9f29ba01d995308450a24714b1c467212fc32948188ac0cca33197cc85601668","schema_version":"1.0","event_id":"sha256:9f29ba01d995308450a24714b1c467212fc32948188ac0cca33197cc85601668"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ADX7OMSJ2OKNE3MYECL4RBTF6G","target":"graph","payload":{"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"},"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-05-17T23:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kM21hsjoB8nHjqW+zA4C+0BWPxLAVSWIuNJf6ES7jmVL2FJgFil2tmNjwf+1KLVUC8RuQVc15awUN/ZW5Ri2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:45:14.925844Z"},"content_sha256":"6264747a171998a06013d1ece90ef0c3a451a0393d0895c0dc11c3e4852386ad","schema_version":"1.0","event_id":"sha256:6264747a171998a06013d1ece90ef0c3a451a0393d0895c0dc11c3e4852386ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/bundle.json","state_url":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/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-05-28T04:45:14Z","links":{"resolver":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G","bundle":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/bundle.json","state":"https://pith.science/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADX7OMSJ2OKNE3MYECL4RBTF6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ADX7OMSJ2OKNE3MYECL4RBTF6G","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":"3703408461a83ba212890b2e8168af21ec0dc10fc5eae2d8f6d7c36ff42d7006","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T00:52:20Z","title_canon_sha256":"76f554cfdd535115999792fb815bc5b162ff918ba320bbb423518b42d799e738"},"schema_version":"1.0","source":{"id":"1709.02034","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02034","created_at":"2026-05-17T23:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02034v4","created_at":"2026-05-17T23:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02034","created_at":"2026-05-17T23:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"ADX7OMSJ2OKN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ADX7OMSJ2OKNE3MY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ADX7OMSJ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:6264747a171998a06013d1ece90ef0c3a451a0393d0895c0dc11c3e4852386ad","target":"graph","created_at":"2026-05-17T23:53:11Z","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":"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 ","authors_text":"Alexander Golovnev, Daniel Reichman, Igor Shinkar, Mika G\\\"o\\\"os","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T00:52:20Z","title":"String Matching: Communication, Circuits, and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02034","kind":"arxiv","version":4},"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:9f29ba01d995308450a24714b1c467212fc32948188ac0cca33197cc85601668","target":"record","created_at":"2026-05-17T23:53:11Z","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":"3703408461a83ba212890b2e8168af21ec0dc10fc5eae2d8f6d7c36ff42d7006","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T00:52:20Z","title_canon_sha256":"76f554cfdd535115999792fb815bc5b162ff918ba320bbb423518b42d799e738"},"schema_version":"1.0","source":{"id":"1709.02034","kind":"arxiv","version":4}},"canonical_sha256":"00eff73249d394d26d982097c88665f19658474ac9d81b9170cd66ab68049aa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00eff73249d394d26d982097c88665f19658474ac9d81b9170cd66ab68049aa9","first_computed_at":"2026-05-17T23:53:11.999619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:11.999619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yae8qpVx6Pkmjl1T3JaB/8MsWVZtfo0/kSiF0XcB+nJxR8D9itRET5tMekG41tH/xea0qoEOwoEJbEqMch2KBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:12.000342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02034","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f29ba01d995308450a24714b1c467212fc32948188ac0cca33197cc85601668","sha256:6264747a171998a06013d1ece90ef0c3a451a0393d0895c0dc11c3e4852386ad"],"state_sha256":"18ec2b57e59948c63e88078ccb3ed239f22f78be773bda58ff9d255ca9f5c705"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1arNpoGbJBUumYrMfIlqL3SEzYzcvHAAI/FLj9xfxSSEQIPk549TPJwW1i8K3C3pnFlD1pHXlxRLIetQcJNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:45:14.927787Z","bundle_sha256":"33d683300877029dca434bfb5b5db9374678d135660866cbb9df9c4d56d8d7e0"}}