{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NKHXXLIPTUTC47HWUCAQSUR2VS","short_pith_number":"pith:NKHXXLIP","canonical_record":{"source":{"id":"2502.04741","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T08:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"9404f304254c3e331faabb59aad76f9e11509d7f5eee70385f36c0833ac80c44","abstract_canon_sha256":"3e27382e469c7482f0d0b78e4ff6c58e5f4523a18cd6cd7375bc77d8c08ef15a"},"schema_version":"1.0"},"canonical_sha256":"6a8f7bad0f9d262e7cf6a08109523aacae0b53f0fe956a088e38dc5c7e89030d","source":{"kind":"arxiv","id":"2502.04741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04741","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04741v1","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04741","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"NKHXXLIPTUTC","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"pith_short_16","alias_value":"NKHXXLIPTUTC47HW","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"pith_short_8","alias_value":"NKHXXLIP","created_at":"2026-07-05T10:10:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NKHXXLIPTUTC47HWUCAQSUR2VS","target":"record","payload":{"canonical_record":{"source":{"id":"2502.04741","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T08:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"9404f304254c3e331faabb59aad76f9e11509d7f5eee70385f36c0833ac80c44","abstract_canon_sha256":"3e27382e469c7482f0d0b78e4ff6c58e5f4523a18cd6cd7375bc77d8c08ef15a"},"schema_version":"1.0"},"canonical_sha256":"6a8f7bad0f9d262e7cf6a08109523aacae0b53f0fe956a088e38dc5c7e89030d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:56.498662Z","signature_b64":"WLS4qMCsgve+BkHQ9y7B59+ydrt8HjR6lWPrH1mykLciWrCjCOhW+jqAZLPTUUTwmJRzVor7ajOreolxnmleBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a8f7bad0f9d262e7cf6a08109523aacae0b53f0fe956a088e38dc5c7e89030d","last_reissued_at":"2026-07-05T10:10:56.498106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:56.498106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.04741","source_version":1,"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-07-05T10:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97k1XNv/4pmc/ys0i4HAUdfLKuzRsTc11UwOvIhud4lTAX2qg+jwFEg52s7uhDZLqVEF+jU9PX/SAwFwLWuEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:10:33.761354Z"},"content_sha256":"9c21aefbe27643a513b677352c97f63f9502c2f0225b7c39c0cda852035bbde5","schema_version":"1.0","event_id":"sha256:9c21aefbe27643a513b677352c97f63f9502c2f0225b7c39c0cda852035bbde5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NKHXXLIPTUTC47HWUCAQSUR2VS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multivalued forbidden numbers of two-rowed configurations -- the missing cases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Attila Sali, Jun Yan, Wallace Peaslee","submitted_at":"2025-02-07T08:16:47Z","abstract_excerpt":"The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\\{0,1,\\ldots, s-1\\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a configuration in a matrix $A$, denoted $F\\prec A$, if it is a row/column permutation of a submatrix of $A$. $\\text{Avoid}(m,s,F)$ is the set of $m$-rowed, simple $s$-matrices not containing a configuration of $F$ and $\\text{forb}(m,s, F)=\\max\\{|A|\\colon A \\in \\text{Avoid}(m,s,F)\\}$. Dillon and Sali initiated the systematic study of $\\text{forb}(m,s, F)$ for $2$-matrices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.04741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OaRJfTBUpzrKi6fzxXMdMLBpPs6t00LhQBsNVIsVM14HiDjX3WVgWgVKzg2nSXsUXMAg5wYJelJUP4FEKp6aCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:10:33.761732Z"},"content_sha256":"33fb19a585bc53bff1156ba9b6ebeedca1c38d9e261fd6bf329b4798cd241a0c","schema_version":"1.0","event_id":"sha256:33fb19a585bc53bff1156ba9b6ebeedca1c38d9e261fd6bf329b4798cd241a0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKHXXLIPTUTC47HWUCAQSUR2VS/bundle.json","state_url":"https://pith.science/pith/NKHXXLIPTUTC47HWUCAQSUR2VS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKHXXLIPTUTC47HWUCAQSUR2VS/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-07-08T19:10:33Z","links":{"resolver":"https://pith.science/pith/NKHXXLIPTUTC47HWUCAQSUR2VS","bundle":"https://pith.science/pith/NKHXXLIPTUTC47HWUCAQSUR2VS/bundle.json","state":"https://pith.science/pith/NKHXXLIPTUTC47HWUCAQSUR2VS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKHXXLIPTUTC47HWUCAQSUR2VS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NKHXXLIPTUTC47HWUCAQSUR2VS","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":"3e27382e469c7482f0d0b78e4ff6c58e5f4523a18cd6cd7375bc77d8c08ef15a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T08:16:47Z","title_canon_sha256":"9404f304254c3e331faabb59aad76f9e11509d7f5eee70385f36c0833ac80c44"},"schema_version":"1.0","source":{"id":"2502.04741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04741","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04741v1","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04741","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"NKHXXLIPTUTC","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"pith_short_16","alias_value":"NKHXXLIPTUTC47HW","created_at":"2026-07-05T10:10:56Z"},{"alias_kind":"pith_short_8","alias_value":"NKHXXLIP","created_at":"2026-07-05T10:10:56Z"}],"graph_snapshots":[{"event_id":"sha256:33fb19a585bc53bff1156ba9b6ebeedca1c38d9e261fd6bf329b4798cd241a0c","target":"graph","created_at":"2026-07-05T10:10:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.04741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\\{0,1,\\ldots, s-1\\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a configuration in a matrix $A$, denoted $F\\prec A$, if it is a row/column permutation of a submatrix of $A$. $\\text{Avoid}(m,s,F)$ is the set of $m$-rowed, simple $s$-matrices not containing a configuration of $F$ and $\\text{forb}(m,s, F)=\\max\\{|A|\\colon A \\in \\text{Avoid}(m,s,F)\\}$. Dillon and Sali initiated the systematic study of $\\text{forb}(m,s, F)$ for $2$-matrices","authors_text":"Attila Sali, Jun Yan, Wallace Peaslee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T08:16:47Z","title":"Multivalued forbidden numbers of two-rowed configurations -- the missing cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04741","kind":"arxiv","version":1},"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:9c21aefbe27643a513b677352c97f63f9502c2f0225b7c39c0cda852035bbde5","target":"record","created_at":"2026-07-05T10:10:56Z","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":"3e27382e469c7482f0d0b78e4ff6c58e5f4523a18cd6cd7375bc77d8c08ef15a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T08:16:47Z","title_canon_sha256":"9404f304254c3e331faabb59aad76f9e11509d7f5eee70385f36c0833ac80c44"},"schema_version":"1.0","source":{"id":"2502.04741","kind":"arxiv","version":1}},"canonical_sha256":"6a8f7bad0f9d262e7cf6a08109523aacae0b53f0fe956a088e38dc5c7e89030d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a8f7bad0f9d262e7cf6a08109523aacae0b53f0fe956a088e38dc5c7e89030d","first_computed_at":"2026-07-05T10:10:56.498106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:56.498106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WLS4qMCsgve+BkHQ9y7B59+ydrt8HjR6lWPrH1mykLciWrCjCOhW+jqAZLPTUUTwmJRzVor7ajOreolxnmleBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:56.498662Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.04741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c21aefbe27643a513b677352c97f63f9502c2f0225b7c39c0cda852035bbde5","sha256:33fb19a585bc53bff1156ba9b6ebeedca1c38d9e261fd6bf329b4798cd241a0c"],"state_sha256":"78b69b015b5e10dca2311cea4433dd9856a09c8215052efece6524376126743f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmBd4tQMaqnmb8gjc/yFac0lLUFjX6O2Uc+7dtqyNafVQ/GaNRLL6hbLkwX7FCVRgfLHfGBURm247S4zCWQgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T19:10:33.764277Z","bundle_sha256":"2876504dfb40c32c6b7c95ed947e241d1cb1c863cf9576f5a0dcc846bf81e32e"}}