{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EBMKERTYUWPVVEVEAWUVQRDFVK","short_pith_number":"pith:EBMKERTY","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"},"canonical_sha256":"2058a24678a59f5a92a405a9584465aabf80f7d36bb4a2c89e3422a7ba138987","source":{"kind":"arxiv","id":"1707.01758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01758","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01758v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01758","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"EBMKERTYUWPV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBMKERTYUWPVVEVE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBMKERTY","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EBMKERTYUWPVVEVEAWUVQRDFVK","target":"record","payload":{"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"},"canonical_sha256":"2058a24678a59f5a92a405a9584465aabf80f7d36bb4a2c89e3422a7ba138987","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"},"source_kind":"arxiv","source_id":"1707.01758","source_version":2,"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-05-18T00:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02iPN4QdWp1x+uvqnjcjpQTSyL/4DLqfodLkMO8Dn4Ctqt0vi5HBo7ZH4U0pjkWvcjKB/mnt2+TchICNDB4kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:12:26.633254Z"},"content_sha256":"7b3b73c4b07c5842cacb88aea7249245e931df4941454aea5b401b8626637e83","schema_version":"1.0","event_id":"sha256:7b3b73c4b07c5842cacb88aea7249245e931df4941454aea5b401b8626637e83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EBMKERTYUWPVVEVEAWUVQRDFVK","target":"graph","payload":{"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"},"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-05-18T00:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEIbZfqB0w6lbgRQLIVq8t1TM5IWHR5FcqUv712tvgT/QrsM9s0DigVzqr3+5rFThssDAeC9gt7nZz5uBK2JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:12:26.633617Z"},"content_sha256":"c87a0213982fae6db1ed7c3a4481b8b3184ab7e4ba3c3f99ce9e9520c8bb2df3","schema_version":"1.0","event_id":"sha256:c87a0213982fae6db1ed7c3a4481b8b3184ab7e4ba3c3f99ce9e9520c8bb2df3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/bundle.json","state_url":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/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-06-02T08:12:26Z","links":{"resolver":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK","bundle":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/bundle.json","state":"https://pith.science/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBMKERTYUWPVVEVEAWUVQRDFVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EBMKERTYUWPVVEVEAWUVQRDFVK","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":"7bf78cbd19c8a528610a8aa3c3a0cfea7b24901031bea9d294e106e9ba0622bc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T12:54:36Z","title_canon_sha256":"9ea312c3ebb2549fcf52ff30adee26e751019714f846e22cb5c5bdf7d38c6695"},"schema_version":"1.0","source":{"id":"1707.01758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01758","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01758v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01758","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"EBMKERTYUWPV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBMKERTYUWPVVEVE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBMKERTY","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:c87a0213982fae6db1ed7c3a4481b8b3184ab7e4ba3c3f99ce9e9520c8bb2df3","target":"graph","created_at":"2026-05-18T00:07:50Z","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":"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","authors_text":"Chong Shangguan, Gennian Ge, Xin Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T12:54:36Z","title":"Some intriguing upper bounds for separating hash families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01758","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:7b3b73c4b07c5842cacb88aea7249245e931df4941454aea5b401b8626637e83","target":"record","created_at":"2026-05-18T00:07:50Z","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":"7bf78cbd19c8a528610a8aa3c3a0cfea7b24901031bea9d294e106e9ba0622bc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T12:54:36Z","title_canon_sha256":"9ea312c3ebb2549fcf52ff30adee26e751019714f846e22cb5c5bdf7d38c6695"},"schema_version":"1.0","source":{"id":"1707.01758","kind":"arxiv","version":2}},"canonical_sha256":"2058a24678a59f5a92a405a9584465aabf80f7d36bb4a2c89e3422a7ba138987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2058a24678a59f5a92a405a9584465aabf80f7d36bb4a2c89e3422a7ba138987","first_computed_at":"2026-05-18T00:07:50.736637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:50.736637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i/rxaCGZennOdJE1G3yjvYAZ8pWK2nmFjyQdSVrHEFSD8c+T1PaGp26rNRKdpPiWzq44OpdzyFVqu1HhoyZkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:50.737151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b3b73c4b07c5842cacb88aea7249245e931df4941454aea5b401b8626637e83","sha256:c87a0213982fae6db1ed7c3a4481b8b3184ab7e4ba3c3f99ce9e9520c8bb2df3"],"state_sha256":"d1bba417ae5468a25dd15ab9badfcc1c20d8fe6b7678ed07e0c2b98a9f8f4ed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FT/K4uHcG5Xt999G7LidMn+FREOg9Z+9ilgvzVkx1fjinttFpy1F7SnOCng0RHD541dYHT756zRiO/X+LWK3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:12:26.635573Z","bundle_sha256":"e8f25682dfc8f24bc684abf6d48e3495bacd4c181dbba9462446c4721642e1e9"}}