{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PLGCCA2KXGCOXMR7Q6RNLUQDGG","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":"c76e54f0eb79b6fa9985a4b8efcb05ef24ef07b08547054d9a19836ca2abb4f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:50:35Z","title_canon_sha256":"2d1bcfcc7ef403336b4db297a83121cb7140080bcfc264e51da19e36bffd95f6"},"schema_version":"1.0","source":{"id":"1605.06577","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06577","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06577v2","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06577","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"PLGCCA2KXGCO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PLGCCA2KXGCOXMR7","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PLGCCA2K","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:4435b61e65c849bf9dac6f54d1a6141141078e63ca044f4732a2ff92c189a4f5","target":"graph","created_at":"2026-05-18T01:13:46Z","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":"Let ${\\cal A}=\\{A_1,\\ldots, A_r\\}$ be a partition of a set $\\{1,\\ldots,m\\}\\times\\{1,\\ldots, n\\}$ into $r$ nonempty subsets, and $A=(a_{ij})$ be an $m\\times n$ matrix. We say that $A$ has a pattern ${\\cal A}$ provided that $a_{ij}=a_{i'j'}$ if and only if $(i,j),(i',j')\\in A_t$ for some $t\\in\\{1,\\ldots,r\\}$. In this note we study the following function $f$ defined on the set of all $m\\times n$ matrices $M$ with $s$ distinct entries: $f(M; {\\cal A})$ is the smallest number of positions where the entries of $M$ need to be changed such that the resulting matrix does not have any submatrix with pat","authors_text":"Maria Axenovich, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:50:35Z","title":"Avoiding patterns in matrices via a small number of changes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06577","kind":"arxiv","version":2},"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:ee11f1d02667dcc21c7b681e37fde2e9cbb87d66d5bde5eb90b8617626dfecf3","target":"record","created_at":"2026-05-18T01:13:46Z","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":"c76e54f0eb79b6fa9985a4b8efcb05ef24ef07b08547054d9a19836ca2abb4f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:50:35Z","title_canon_sha256":"2d1bcfcc7ef403336b4db297a83121cb7140080bcfc264e51da19e36bffd95f6"},"schema_version":"1.0","source":{"id":"1605.06577","kind":"arxiv","version":2}},"canonical_sha256":"7acc21034ab984ebb23f87a2d5d20331a3f9231a882ecbef0fd40e9daae9cacd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7acc21034ab984ebb23f87a2d5d20331a3f9231a882ecbef0fd40e9daae9cacd","first_computed_at":"2026-05-18T01:13:46.743552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:46.743552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k+c6RtDT/5F7ury5l8z0jsgwXAsd9bwCJcxV0U3izP+AIUxvOyRfXqgzvDNGe7pj+b9jzkZ9N2/UNZVTUa2qCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:46.744255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06577","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee11f1d02667dcc21c7b681e37fde2e9cbb87d66d5bde5eb90b8617626dfecf3","sha256:4435b61e65c849bf9dac6f54d1a6141141078e63ca044f4732a2ff92c189a4f5"],"state_sha256":"da1137ed64d6c5559e4c411a63867ae29803aac1065bb474e5134b5f95aa74fc"}