{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EBMKERTYUWPVVEVEAWUVQRDFVK","short_pith_number":"pith:EBMKERTY","schema_version":"1.0","canonical_sha256":"2058a24678a59f5a92a405a9584465aabf80f7d36bb4a2c89e3422a7ba138987","source":{"kind":"arxiv","id":"1707.01758","version":2},"attestation_state":"computed","paper":{"title":"Some intriguing upper bounds for separating hash families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Chong Shangguan, Gennian Ge, Xin Wang","submitted_at":"2017-07-06T12:54:36Z","abstract_excerpt":"An $N\\times n$ matrix on $q$ symbols is called $\\{w_1,\\ldots,w_t\\}$-separating if for arbitrary $t$ pairwise disjoint column sets $C_1,\\ldots,C_t$ with $|C_i|=w_i$ for $1\\le i\\le t$, there exists a row $f$ such that $f(C_1),\\ldots,f(C_t)$ are also pairwise disjoint, where $f(C_i)$ denotes the collection of components of $C_i$ restricted to row $f$.\n  Given integers $N,q$ and $w_1,\\ldots,w_t$, denote by $C(N,q,\\{w_1,\\ldots,w_t\\})$ the maximal $n$ such that a corresponding matrix does exist.\n  The determination of $C(N,q,\\{w_1,\\ldots,w_t\\})$ has received remarkable attentions during the recent y"},"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":"1707.01758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T12:54:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9ea312c3ebb2549fcf52ff30adee26e751019714f846e22cb5c5bdf7d38c6695","abstract_canon_sha256":"7bf78cbd19c8a528610a8aa3c3a0cfea7b24901031bea9d294e106e9ba0622bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.737151Z","signature_b64":"i/rxaCGZennOdJE1G3yjvYAZ8pWK2nmFjyQdSVrHEFSD8c+T1PaGp26rNRKdpPiWzq44OpdzyFVqu1HhoyZkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2058a24678a59f5a92a405a9584465aabf80f7d36bb4a2c89e3422a7ba138987","last_reissued_at":"2026-05-18T00:07:50.736637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.736637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some intriguing upper bounds for separating hash families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Chong Shangguan, Gennian Ge, Xin Wang","submitted_at":"2017-07-06T12:54:36Z","abstract_excerpt":"An $N\\times n$ matrix on $q$ symbols is called $\\{w_1,\\ldots,w_t\\}$-separating if for arbitrary $t$ pairwise disjoint column sets $C_1,\\ldots,C_t$ with $|C_i|=w_i$ for $1\\le i\\le t$, there exists a row $f$ such that $f(C_1),\\ldots,f(C_t)$ are also pairwise disjoint, where $f(C_i)$ denotes the collection of components of $C_i$ restricted to row $f$.\n  Given integers $N,q$ and $w_1,\\ldots,w_t$, denote by $C(N,q,\\{w_1,\\ldots,w_t\\})$ the maximal $n$ such that a corresponding matrix does exist.\n  The determination of $C(N,q,\\{w_1,\\ldots,w_t\\})$ has received remarkable attentions during the recent y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01758","kind":"arxiv","version":2},"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":"1707.01758","created_at":"2026-05-18T00:07:50.736726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01758v2","created_at":"2026-05-18T00:07:50.736726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01758","created_at":"2026-05-18T00:07:50.736726+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBMKERTYUWPV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBMKERTYUWPVVEVE","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBMKERTY","created_at":"2026-05-18T12:31:12.930513+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/EBMKERTYUWPVVEVEAWUVQRDFVK","json":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK.json","graph_json":"https://pith.science/api/pith-number/EBMKERTYUWPVVEVEAWUVQRDFVK/graph.json","events_json":"https://pith.science/api/pith-number/EBMKERTYUWPVVEVEAWUVQRDFVK/events.json","paper":"https://pith.science/paper/EBMKERTY"},"agent_actions":{"view_html":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK","download_json":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK.json","view_paper":"https://pith.science/paper/EBMKERTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01758&json=true","fetch_graph":"https://pith.science/api/pith-number/EBMKERTYUWPVVEVEAWUVQRDFVK/graph.json","fetch_events":"https://pith.science/api/pith-number/EBMKERTYUWPVVEVEAWUVQRDFVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/action/storage_attestation","attest_author":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/action/author_attestation","sign_citation":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/action/citation_signature","submit_replication":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/action/replication_record"}},"created_at":"2026-05-18T00:07:50.736726+00:00","updated_at":"2026-05-18T00:07:50.736726+00:00"}