{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DXY7AJTM4SWSSO4QQFW7ELSEE6","short_pith_number":"pith:DXY7AJTM","canonical_record":{"source":{"id":"1510.00293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T15:59:48Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"b7415e4bdf45478570782e1426c035022cb4d7f1cab2aaff3826355b1b7a4b50","abstract_canon_sha256":"85907ea5128814dd3ccf84f32208a3ba641cdc493c823c84e9ba5e0cf4d5d35c"},"schema_version":"1.0"},"canonical_sha256":"1df1f0266ce4ad293b90816df22e4427a23f0d0361f21984eb88718d5af9f2a2","source":{"kind":"arxiv","id":"1510.00293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00293","created_at":"2026-05-18T01:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00293v1","created_at":"2026-05-18T01:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00293","created_at":"2026-05-18T01:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"DXY7AJTM4SWS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DXY7AJTM4SWSSO4Q","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DXY7AJTM","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DXY7AJTM4SWSSO4QQFW7ELSEE6","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T15:59:48Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"b7415e4bdf45478570782e1426c035022cb4d7f1cab2aaff3826355b1b7a4b50","abstract_canon_sha256":"85907ea5128814dd3ccf84f32208a3ba641cdc493c823c84e9ba5e0cf4d5d35c"},"schema_version":"1.0"},"canonical_sha256":"1df1f0266ce4ad293b90816df22e4427a23f0d0361f21984eb88718d5af9f2a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:19.679786Z","signature_b64":"seTATtQRakmh/azgga+43KCy0YB5IgZMO7SDwlz3jFduJEkgO/qgExBXZ74a90I2MKr/J9upYP7yERfsd627DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df1f0266ce4ad293b90816df22e4427a23f0d0361f21984eb88718d5af9f2a2","last_reissued_at":"2026-05-18T01:31:19.679181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:19.679181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00293","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-05-18T01:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ds3EJbz4tzGz20weQx0UgbWZDkbwpp5Vensx2e41fPO2c3/Ov7W2qu+2Bk/iTMZiX8ITGbsWYOvWKPdCVnIlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:51:52.014448Z"},"content_sha256":"3f55508cb3601096307b488643bf5bbee9008ee175bdd1f7d18565f02f904e84","schema_version":"1.0","event_id":"sha256:3f55508cb3601096307b488643bf5bbee9008ee175bdd1f7d18565f02f904e84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DXY7AJTM4SWSSO4QQFW7ELSEE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tight bound on the size of certain separating hash families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chuan Guo, Douglas R. Stinson","submitted_at":"2015-10-01T15:59:48Z","abstract_excerpt":"In this paper, we present a new lower bound on the size of separating hash families of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paper by Guo et al. on binary frameproof codes. This bound compares well against known general bounds, and is especially useful when trying to bound the size of strong separating hash families. We also show that our new bound is tight by constructing hash families that meet the new bound with equality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00293","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"},"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-18T01:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KshdT21eU2bFnbF7TspD77Q09ivZfwMZAexbmd86ZTMCh8xZjECm8m8Qj2uXy+tdkYrUNqK6V9dfEebib8hABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:51:52.015148Z"},"content_sha256":"86f1ff05dc3156432b00b937f1ba2b9a5fc9307be5ac31bc37483abfbdb0a9b1","schema_version":"1.0","event_id":"sha256:86f1ff05dc3156432b00b937f1ba2b9a5fc9307be5ac31bc37483abfbdb0a9b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6/bundle.json","state_url":"https://pith.science/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6/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-09T04:51:52Z","links":{"resolver":"https://pith.science/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6","bundle":"https://pith.science/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6/bundle.json","state":"https://pith.science/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXY7AJTM4SWSSO4QQFW7ELSEE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DXY7AJTM4SWSSO4QQFW7ELSEE6","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":"85907ea5128814dd3ccf84f32208a3ba641cdc493c823c84e9ba5e0cf4d5d35c","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T15:59:48Z","title_canon_sha256":"b7415e4bdf45478570782e1426c035022cb4d7f1cab2aaff3826355b1b7a4b50"},"schema_version":"1.0","source":{"id":"1510.00293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00293","created_at":"2026-05-18T01:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00293v1","created_at":"2026-05-18T01:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00293","created_at":"2026-05-18T01:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"DXY7AJTM4SWS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DXY7AJTM4SWSSO4Q","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DXY7AJTM","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:86f1ff05dc3156432b00b937f1ba2b9a5fc9307be5ac31bc37483abfbdb0a9b1","target":"graph","created_at":"2026-05-18T01:31:19Z","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":"In this paper, we present a new lower bound on the size of separating hash families of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paper by Guo et al. on binary frameproof codes. This bound compares well against known general bounds, and is especially useful when trying to bound the size of strong separating hash families. We also show that our new bound is tight by constructing hash families that meet the new bound with equality.","authors_text":"Chuan Guo, Douglas R. Stinson","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T15:59:48Z","title":"A tight bound on the size of certain separating hash families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00293","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:3f55508cb3601096307b488643bf5bbee9008ee175bdd1f7d18565f02f904e84","target":"record","created_at":"2026-05-18T01:31:19Z","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":"85907ea5128814dd3ccf84f32208a3ba641cdc493c823c84e9ba5e0cf4d5d35c","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T15:59:48Z","title_canon_sha256":"b7415e4bdf45478570782e1426c035022cb4d7f1cab2aaff3826355b1b7a4b50"},"schema_version":"1.0","source":{"id":"1510.00293","kind":"arxiv","version":1}},"canonical_sha256":"1df1f0266ce4ad293b90816df22e4427a23f0d0361f21984eb88718d5af9f2a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1df1f0266ce4ad293b90816df22e4427a23f0d0361f21984eb88718d5af9f2a2","first_computed_at":"2026-05-18T01:31:19.679181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:19.679181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"seTATtQRakmh/azgga+43KCy0YB5IgZMO7SDwlz3jFduJEkgO/qgExBXZ74a90I2MKr/J9upYP7yERfsd627DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:19.679786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f55508cb3601096307b488643bf5bbee9008ee175bdd1f7d18565f02f904e84","sha256:86f1ff05dc3156432b00b937f1ba2b9a5fc9307be5ac31bc37483abfbdb0a9b1"],"state_sha256":"b04d5839618b002529fb989343c4d35a47a9a90bf8611a92a7fbf50b68b75027"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66wUSYJQ3WrJSPe5g4VZuAaj+ydzn1b0byk0ilCf2x/V1qWxjKMSzySNtGgAj0NgzAfowsaeD/+V+3bm99HhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:51:52.018988Z","bundle_sha256":"9c30d0083cb734fd09fbd2e6436908ee9c4571ea8a41049c0cd3416de98ae239"}}