{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OZVLMDC27C72IFWNX7IRH4YQZD","short_pith_number":"pith:OZVLMDC2","schema_version":"1.0","canonical_sha256":"766ab60c5af8bfa416cdbfd113f310c8e8fbb45a83391f0e7dcf356e999e0256","source":{"kind":"arxiv","id":"1607.03961","version":3},"attestation_state":"computed","paper":{"title":"Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Omri Ben-Eliezer, Simon Korman","submitted_at":"2016-07-13T23:55:56Z","abstract_excerpt":"Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data.\n  We focus on the natural local problem of testing pattern freeness: given a large $d$-dimensional array $A$ and a fixed $d$-dimensional pattern $P$ over a finite alphabet, we say that $A$ is $P$-free if it does not contain a copy of the forbidden pattern $P$ as a consecutive subarray. The distan"},"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":"1607.03961","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T23:55:56Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"4fb0c7a9ad752b00f76497ec9a36ce6318cb5f99d9bbfa74f39b1831f4b6cce9","abstract_canon_sha256":"feff98b59b6d31c7297254c210fab50113147e173387d9a2b92bdee74f8c7c32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:58.926614Z","signature_b64":"PswU/GA1ozGgkK36IiI0ABqo7qVc+FJ8ELJGKKnhevP02yICTbhf9DIesl+nmRhTBlq2DrJqiD1HpxLeOTEZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766ab60c5af8bfa416cdbfd113f310c8e8fbb45a83391f0e7dcf356e999e0256","last_reissued_at":"2026-05-18T00:47:58.925970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:58.925970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Omri Ben-Eliezer, Simon Korman","submitted_at":"2016-07-13T23:55:56Z","abstract_excerpt":"Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data.\n  We focus on the natural local problem of testing pattern freeness: given a large $d$-dimensional array $A$ and a fixed $d$-dimensional pattern $P$ over a finite alphabet, we say that $A$ is $P$-free if it does not contain a copy of the forbidden pattern $P$ as a consecutive subarray. The distan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03961","kind":"arxiv","version":3},"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":"1607.03961","created_at":"2026-05-18T00:47:58.926071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03961v3","created_at":"2026-05-18T00:47:58.926071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03961","created_at":"2026-05-18T00:47:58.926071+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZVLMDC27C72","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZVLMDC27C72IFWN","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZVLMDC2","created_at":"2026-05-18T12:30:36.002864+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/OZVLMDC27C72IFWNX7IRH4YQZD","json":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD.json","graph_json":"https://pith.science/api/pith-number/OZVLMDC27C72IFWNX7IRH4YQZD/graph.json","events_json":"https://pith.science/api/pith-number/OZVLMDC27C72IFWNX7IRH4YQZD/events.json","paper":"https://pith.science/paper/OZVLMDC2"},"agent_actions":{"view_html":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD","download_json":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD.json","view_paper":"https://pith.science/paper/OZVLMDC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03961&json=true","fetch_graph":"https://pith.science/api/pith-number/OZVLMDC27C72IFWNX7IRH4YQZD/graph.json","fetch_events":"https://pith.science/api/pith-number/OZVLMDC27C72IFWNX7IRH4YQZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD/action/storage_attestation","attest_author":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD/action/author_attestation","sign_citation":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD/action/citation_signature","submit_replication":"https://pith.science/pith/OZVLMDC27C72IFWNX7IRH4YQZD/action/replication_record"}},"created_at":"2026-05-18T00:47:58.926071+00:00","updated_at":"2026-05-18T00:47:58.926071+00:00"}