{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KU6JPRG7H4XQYFO6V5DX7NKVHX","short_pith_number":"pith:KU6JPRG7","schema_version":"1.0","canonical_sha256":"553c97c4df3f2f0c15deaf477fb5553dfa1774df78672e600fd7a2a7e1eab0e2","source":{"kind":"arxiv","id":"1611.03274","version":2},"attestation_state":"computed","paper":{"title":"Constructions and bounds for separating hash families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Cao, X. Niu","submitted_at":"2016-11-10T12:11:18Z","abstract_excerpt":"In this paper, we present a new construction for strong separating hash families by using hypergraphs and obtain some optimal separating hash families.\n  We also improve some previously known bounds of separating hash families."},"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":"1611.03274","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-10T12:11:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ce519f9b7ab56ef23c09c26de64b25516dfc1e0f6352db0e662f984a253f6827","abstract_canon_sha256":"e8887c2c48ba6370932b0769f351d1c6137035ba08e42628adcfdf480eeb1c84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:05.094096Z","signature_b64":"9mbuHzyrhY4btTk9lsW1TFIDehteb2R+Qz2OFPLP0IUeB3A2X77AKv7Wau1jpnEvd2tpWwypf92doZrR1PSpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"553c97c4df3f2f0c15deaf477fb5553dfa1774df78672e600fd7a2a7e1eab0e2","last_reissued_at":"2026-05-18T00:35:05.093386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:05.093386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions and bounds for separating hash families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Cao, X. Niu","submitted_at":"2016-11-10T12:11:18Z","abstract_excerpt":"In this paper, we present a new construction for strong separating hash families by using hypergraphs and obtain some optimal separating hash families.\n  We also improve some previously known bounds of separating hash families."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03274","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":"1611.03274","created_at":"2026-05-18T00:35:05.093483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03274v2","created_at":"2026-05-18T00:35:05.093483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03274","created_at":"2026-05-18T00:35:05.093483+00:00"},{"alias_kind":"pith_short_12","alias_value":"KU6JPRG7H4XQ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KU6JPRG7H4XQYFO6","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KU6JPRG7","created_at":"2026-05-18T12:30:29.479603+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/KU6JPRG7H4XQYFO6V5DX7NKVHX","json":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX.json","graph_json":"https://pith.science/api/pith-number/KU6JPRG7H4XQYFO6V5DX7NKVHX/graph.json","events_json":"https://pith.science/api/pith-number/KU6JPRG7H4XQYFO6V5DX7NKVHX/events.json","paper":"https://pith.science/paper/KU6JPRG7"},"agent_actions":{"view_html":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX","download_json":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX.json","view_paper":"https://pith.science/paper/KU6JPRG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03274&json=true","fetch_graph":"https://pith.science/api/pith-number/KU6JPRG7H4XQYFO6V5DX7NKVHX/graph.json","fetch_events":"https://pith.science/api/pith-number/KU6JPRG7H4XQYFO6V5DX7NKVHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX/action/storage_attestation","attest_author":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX/action/author_attestation","sign_citation":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX/action/citation_signature","submit_replication":"https://pith.science/pith/KU6JPRG7H4XQYFO6V5DX7NKVHX/action/replication_record"}},"created_at":"2026-05-18T00:35:05.093483+00:00","updated_at":"2026-05-18T00:35:05.093483+00:00"}