{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:N2RDLAOCWLXJWG6R25CFSQSOGN","short_pith_number":"pith:N2RDLAOC","schema_version":"1.0","canonical_sha256":"6ea23581c2b2ee9b1bd1d74459424e3372f39733467ffef3905e5283e808b6ad","source":{"kind":"arxiv","id":"1302.4622","version":1},"attestation_state":"computed","paper":{"title":"Sur la complexit\\'e de familles d'ensembles pseudo-al\\'eatoires","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"C\\'ecile Dartyge (IECL), Elie Mosaki (ICJ), Ramachandran Balasubramanian (CIT)","submitted_at":"2013-02-19T14:39:49Z","abstract_excerpt":"In this paper we are interested in the following problem. Let $p$ be a prime number, $S\\subset \\F_p$ and $\\cP\\subset \\{P\\in\\F_p [X]:\\deg P\\le d\\}$. What is the largest integer $k$ such that for all subsets $\\cA, \\cB$ of $\\F_p$ satisfying $\\cA\\cap\\cB =\\emptyset$ and $|\\cA\\cup\\cB |=k$, there exists $P\\in\\cP$ such that $P(x)\\in S$ if $x\\in\\cA$ and $P(x)\\not\\in S$ if $x\\in\\cB$? This problem corresponds to the study of the complexity of some families of pseudo-random subsets. First we recall this complexity definition and the context of pseudo-random subsets. Then we state the different results we "},"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":"1302.4622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-19T14:39:49Z","cross_cats_sorted":[],"title_canon_sha256":"7ef07f2b505ea20a530b5683dbabf08aa803b2ad9dbe16cd506ab1d493c43f79","abstract_canon_sha256":"b644732a01aebc342263e391cffccab6f8bd927bd9be916ac2eed7da0027e201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:12.691896Z","signature_b64":"gZyKWex6o01Ojv7OWtN2S1ZEKMQaJQDlXh3yIWHbSoRDScWigmn3NrAEZPQULOlcm98duBHmJIVTnsok+GNbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ea23581c2b2ee9b1bd1d74459424e3372f39733467ffef3905e5283e808b6ad","last_reissued_at":"2026-05-18T03:33:12.690987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:12.690987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sur la complexit\\'e de familles d'ensembles pseudo-al\\'eatoires","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"C\\'ecile Dartyge (IECL), Elie Mosaki (ICJ), Ramachandran Balasubramanian (CIT)","submitted_at":"2013-02-19T14:39:49Z","abstract_excerpt":"In this paper we are interested in the following problem. Let $p$ be a prime number, $S\\subset \\F_p$ and $\\cP\\subset \\{P\\in\\F_p [X]:\\deg P\\le d\\}$. What is the largest integer $k$ such that for all subsets $\\cA, \\cB$ of $\\F_p$ satisfying $\\cA\\cap\\cB =\\emptyset$ and $|\\cA\\cup\\cB |=k$, there exists $P\\in\\cP$ such that $P(x)\\in S$ if $x\\in\\cA$ and $P(x)\\not\\in S$ if $x\\in\\cB$? This problem corresponds to the study of the complexity of some families of pseudo-random subsets. First we recall this complexity definition and the context of pseudo-random subsets. Then we state the different results we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4622","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":"1302.4622","created_at":"2026-05-18T03:33:12.691137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4622v1","created_at":"2026-05-18T03:33:12.691137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4622","created_at":"2026-05-18T03:33:12.691137+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2RDLAOCWLXJ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2RDLAOCWLXJWG6R","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2RDLAOC","created_at":"2026-05-18T12:27:52.871228+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/N2RDLAOCWLXJWG6R25CFSQSOGN","json":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN.json","graph_json":"https://pith.science/api/pith-number/N2RDLAOCWLXJWG6R25CFSQSOGN/graph.json","events_json":"https://pith.science/api/pith-number/N2RDLAOCWLXJWG6R25CFSQSOGN/events.json","paper":"https://pith.science/paper/N2RDLAOC"},"agent_actions":{"view_html":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN","download_json":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN.json","view_paper":"https://pith.science/paper/N2RDLAOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4622&json=true","fetch_graph":"https://pith.science/api/pith-number/N2RDLAOCWLXJWG6R25CFSQSOGN/graph.json","fetch_events":"https://pith.science/api/pith-number/N2RDLAOCWLXJWG6R25CFSQSOGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/action/storage_attestation","attest_author":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/action/author_attestation","sign_citation":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/action/citation_signature","submit_replication":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/action/replication_record"}},"created_at":"2026-05-18T03:33:12.691137+00:00","updated_at":"2026-05-18T03:33:12.691137+00:00"}