{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Y4SEQ47XIFUGUZPN4JFZURMBN7","short_pith_number":"pith:Y4SEQ47X","schema_version":"1.0","canonical_sha256":"c7244873f741686a65ede24b9a45816fdf14a3975a53fcebeffefaf8b95b82e9","source":{"kind":"arxiv","id":"2607.17261","version":1},"attestation_state":"computed","paper":{"title":"Tight bound for the skew Hamming set-pair problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guorong Gao, Run Zhao","submitted_at":"2026-07-19T14:06:04Z","abstract_excerpt":"Let $X$ be an alphabet, let $t\\geq 0$ and $n\\geq t+1$, and let $((a_i,b_i))_{i=1}^{m}$ be an ordered family of word pairs in $X^n$ satisfying $dist(a_i,b_i)\\geq t+1$ for every $i$ and $dist(a_i,b_j)\\leq t$ whenever $i<j$. We prove the sharp bound $m\\leq 2^{t+1}$, thereby resolving a problem posed by Alon, Jin, and Sudakov. Our proof uses a linear-algebraic method based on a characteristic-two algebra, which may be of independent interest."},"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":"2607.17261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-19T14:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"4fad5304ccb38b28a7126d2f71022429aeb8624ceaf7105d1b1119c34a149498","abstract_canon_sha256":"a7534fd3e286e51c7e7d22fee391389f6ea891cc47a1092580f2b8e4a0c9919c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:24.328152Z","signature_b64":"+tV49iqGP8dfy9rFWUpoi/nvvIyuREh/gXUHnRvGL/xS04MAVx4Kvg0a2Xz+pVcpG9Whi6IL1YHJVk0eyclaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7244873f741686a65ede24b9a45816fdf14a3975a53fcebeffefaf8b95b82e9","last_reissued_at":"2026-07-21T01:21:24.327313Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:24.327313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight bound for the skew Hamming set-pair problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guorong Gao, Run Zhao","submitted_at":"2026-07-19T14:06:04Z","abstract_excerpt":"Let $X$ be an alphabet, let $t\\geq 0$ and $n\\geq t+1$, and let $((a_i,b_i))_{i=1}^{m}$ be an ordered family of word pairs in $X^n$ satisfying $dist(a_i,b_i)\\geq t+1$ for every $i$ and $dist(a_i,b_j)\\leq t$ whenever $i<j$. We prove the sharp bound $m\\leq 2^{t+1}$, thereby resolving a problem posed by Alon, Jin, and Sudakov. Our proof uses a linear-algebraic method based on a characteristic-two algebra, which may be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17261","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/2607.17261/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.17261","created_at":"2026-07-21T01:21:24.327748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17261v1","created_at":"2026-07-21T01:21:24.327748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17261","created_at":"2026-07-21T01:21:24.327748+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4SEQ47XIFUG","created_at":"2026-07-21T01:21:24.327748+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4SEQ47XIFUGUZPN","created_at":"2026-07-21T01:21:24.327748+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4SEQ47X","created_at":"2026-07-21T01:21:24.327748+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/Y4SEQ47XIFUGUZPN4JFZURMBN7","json":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7.json","graph_json":"https://pith.science/api/pith-number/Y4SEQ47XIFUGUZPN4JFZURMBN7/graph.json","events_json":"https://pith.science/api/pith-number/Y4SEQ47XIFUGUZPN4JFZURMBN7/events.json","paper":"https://pith.science/paper/Y4SEQ47X"},"agent_actions":{"view_html":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7","download_json":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7.json","view_paper":"https://pith.science/paper/Y4SEQ47X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17261&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4SEQ47XIFUGUZPN4JFZURMBN7/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4SEQ47XIFUGUZPN4JFZURMBN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7/action/storage_attestation","attest_author":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7/action/author_attestation","sign_citation":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7/action/citation_signature","submit_replication":"https://pith.science/pith/Y4SEQ47XIFUGUZPN4JFZURMBN7/action/replication_record"}},"created_at":"2026-07-21T01:21:24.327748+00:00","updated_at":"2026-07-21T01:21:24.327748+00:00"}