{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RNZLO7JCD73PCR4C2NG3VVOGAF","short_pith_number":"pith:RNZLO7JC","schema_version":"1.0","canonical_sha256":"8b72b77d221ff6f14782d34dbad5c60144041d8a4fd469c23b90466745aa2ed9","source":{"kind":"arxiv","id":"1606.01376","version":1},"attestation_state":"computed","paper":{"title":"Universal Sets and Cover-Free Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Debjyoti Saharoy, Shailesh Vaya","submitted_at":"2016-06-04T13:32:39Z","abstract_excerpt":"We propose a polynomial time construction of an $(n,d)$-universal set over alphabet $\\Sigma=\\{0,1\\}$, of size $d\\cdot 2^{d+o(d)}\\cdot\\log n$. This is an improvement over the size, $d^{5}2^{2.66d}\\log n$, of an $(n,d)$-universal set constructed by Bshouty, \\cite{BshoutyTesters}, over alphabet $\\Sigma=\\{0,1\\}$."},"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":"1606.01376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-04T13:32:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f462a923d413b24bd1583372d2f930f2d014388427ca7aadf5588a433c310aef","abstract_canon_sha256":"5221d47ef31a59a56e6eb53ad49d46d69e2b26761d2645d42a2c94a799ea0d9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.293710Z","signature_b64":"QZttMiLz+8/Rhc/w75OkcHBQ6pUMfA2Bbb9rNk/OMseMbKnpu8anYZrpLfURiWkRiHr2cfDcZm5w7t0mHvZKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b72b77d221ff6f14782d34dbad5c60144041d8a4fd469c23b90466745aa2ed9","last_reissued_at":"2026-05-18T01:12:54.293365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.293365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Sets and Cover-Free Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Debjyoti Saharoy, Shailesh Vaya","submitted_at":"2016-06-04T13:32:39Z","abstract_excerpt":"We propose a polynomial time construction of an $(n,d)$-universal set over alphabet $\\Sigma=\\{0,1\\}$, of size $d\\cdot 2^{d+o(d)}\\cdot\\log n$. This is an improvement over the size, $d^{5}2^{2.66d}\\log n$, of an $(n,d)$-universal set constructed by Bshouty, \\cite{BshoutyTesters}, over alphabet $\\Sigma=\\{0,1\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01376","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.01376","created_at":"2026-05-18T01:12:54.293421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01376v1","created_at":"2026-05-18T01:12:54.293421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01376","created_at":"2026-05-18T01:12:54.293421+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNZLO7JCD73P","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNZLO7JCD73PCR4C","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNZLO7JC","created_at":"2026-05-18T12:30:41.710351+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/RNZLO7JCD73PCR4C2NG3VVOGAF","json":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF.json","graph_json":"https://pith.science/api/pith-number/RNZLO7JCD73PCR4C2NG3VVOGAF/graph.json","events_json":"https://pith.science/api/pith-number/RNZLO7JCD73PCR4C2NG3VVOGAF/events.json","paper":"https://pith.science/paper/RNZLO7JC"},"agent_actions":{"view_html":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF","download_json":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF.json","view_paper":"https://pith.science/paper/RNZLO7JC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01376&json=true","fetch_graph":"https://pith.science/api/pith-number/RNZLO7JCD73PCR4C2NG3VVOGAF/graph.json","fetch_events":"https://pith.science/api/pith-number/RNZLO7JCD73PCR4C2NG3VVOGAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF/action/storage_attestation","attest_author":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF/action/author_attestation","sign_citation":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF/action/citation_signature","submit_replication":"https://pith.science/pith/RNZLO7JCD73PCR4C2NG3VVOGAF/action/replication_record"}},"created_at":"2026-05-18T01:12:54.293421+00:00","updated_at":"2026-05-18T01:12:54.293421+00:00"}