{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2FD3IQFPOAVK2UMJ6GMTMDZBDU","short_pith_number":"pith:2FD3IQFP","schema_version":"1.0","canonical_sha256":"d147b440af702aad5189f199360f211d2884a26f17b36dc5fd6a7a345ff75fa8","source":{"kind":"arxiv","id":"1710.00374","version":1},"attestation_state":"computed","paper":{"title":"Multivalued matrices and forbidden configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Attila Sali, Jeffrey Dawson, Linyuan Lu, Richard Anstee","submitted_at":"2017-10-01T16:19:24Z","abstract_excerpt":"An $r$-matrix is a matrix with symbols in $\\{0,1,\\ldots,r-1\\}$. A matrix is simple if it has no repeated columns. Let ${\\cal F}$ be a finite set of $r$-matrices. Let $\\hbox{forb}(m,r,{\\cal F})$ denote the maximum number of columns possible in a simple $r$-matrix\n  $A$ that has no submatrix which is a row and column permutation of any $F\\in{\\cal F}$. Many investigations have involved $r=2$. For general $r$, $\\hbox{forb}(m,r,{\\cal F})$ is polynomial in $m$ if and only if for every pair $i,j\\in\\{0,1,\\ldots,r-1\\}$ there is a matrix in ${\\cal F}$ whose entries are only $i$ or $j$.\n  Let ${\\cal T}_{"},"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":"1710.00374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-01T16:19:24Z","cross_cats_sorted":[],"title_canon_sha256":"f76635c283ded8931680917246d0da6e4ff5fe83d3bd697068df8712c78e964b","abstract_canon_sha256":"b121e3807936a403f9dc5c3f32ca209770012d2b5dc4254eea570612879790ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:54.977108Z","signature_b64":"3ezHa+bx3/In0OnZV5jpATD/qkR3qZv/pNXWjwOA61DSBw30TMYN0d8mGONqoEE3ZqnnPh2AvdLywDK5EyiRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d147b440af702aad5189f199360f211d2884a26f17b36dc5fd6a7a345ff75fa8","last_reissued_at":"2026-05-18T00:33:54.976552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:54.976552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multivalued matrices and forbidden configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Attila Sali, Jeffrey Dawson, Linyuan Lu, Richard Anstee","submitted_at":"2017-10-01T16:19:24Z","abstract_excerpt":"An $r$-matrix is a matrix with symbols in $\\{0,1,\\ldots,r-1\\}$. A matrix is simple if it has no repeated columns. Let ${\\cal F}$ be a finite set of $r$-matrices. Let $\\hbox{forb}(m,r,{\\cal F})$ denote the maximum number of columns possible in a simple $r$-matrix\n  $A$ that has no submatrix which is a row and column permutation of any $F\\in{\\cal F}$. Many investigations have involved $r=2$. For general $r$, $\\hbox{forb}(m,r,{\\cal F})$ is polynomial in $m$ if and only if for every pair $i,j\\in\\{0,1,\\ldots,r-1\\}$ there is a matrix in ${\\cal F}$ whose entries are only $i$ or $j$.\n  Let ${\\cal T}_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00374","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":"1710.00374","created_at":"2026-05-18T00:33:54.976642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00374v1","created_at":"2026-05-18T00:33:54.976642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00374","created_at":"2026-05-18T00:33:54.976642+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FD3IQFPOAVK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FD3IQFPOAVK2UMJ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FD3IQFP","created_at":"2026-05-18T12:30:55.937587+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/2FD3IQFPOAVK2UMJ6GMTMDZBDU","json":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU.json","graph_json":"https://pith.science/api/pith-number/2FD3IQFPOAVK2UMJ6GMTMDZBDU/graph.json","events_json":"https://pith.science/api/pith-number/2FD3IQFPOAVK2UMJ6GMTMDZBDU/events.json","paper":"https://pith.science/paper/2FD3IQFP"},"agent_actions":{"view_html":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU","download_json":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU.json","view_paper":"https://pith.science/paper/2FD3IQFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00374&json=true","fetch_graph":"https://pith.science/api/pith-number/2FD3IQFPOAVK2UMJ6GMTMDZBDU/graph.json","fetch_events":"https://pith.science/api/pith-number/2FD3IQFPOAVK2UMJ6GMTMDZBDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU/action/storage_attestation","attest_author":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU/action/author_attestation","sign_citation":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU/action/citation_signature","submit_replication":"https://pith.science/pith/2FD3IQFPOAVK2UMJ6GMTMDZBDU/action/replication_record"}},"created_at":"2026-05-18T00:33:54.976642+00:00","updated_at":"2026-05-18T00:33:54.976642+00:00"}