{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N2RDLAOCWLXJWG6R25CFSQSOGN","short_pith_number":"pith:N2RDLAOC","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"},"canonical_sha256":"6ea23581c2b2ee9b1bd1d74459424e3372f39733467ffef3905e5283e808b6ad","source":{"kind":"arxiv","id":"1302.4622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4622","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4622v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4622","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"N2RDLAOCWLXJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N2RDLAOCWLXJWG6R","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N2RDLAOC","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N2RDLAOCWLXJWG6R25CFSQSOGN","target":"record","payload":{"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"},"canonical_sha256":"6ea23581c2b2ee9b1bd1d74459424e3372f39733467ffef3905e5283e808b6ad","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"},"source_kind":"arxiv","source_id":"1302.4622","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-18T03:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nECp/RXmtB6WlwRn8A2tGDdZPCcLWn6+S8AJgzPoLWEwWYygyK3ZTgN+bECOVNQEqz4GWkI1Kt9R0RLWZ3jiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:21:29.328754Z"},"content_sha256":"85c2c6706037010c76372c99cce4b962a5c4eaaec03fac9d606339a59f294849","schema_version":"1.0","event_id":"sha256:85c2c6706037010c76372c99cce4b962a5c4eaaec03fac9d606339a59f294849"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N2RDLAOCWLXJWG6R25CFSQSOGN","target":"graph","payload":{"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"},"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-18T03:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUUNc3kbAcg3juBIpFcDi9+CKJCor/QLaFHCGYIujgfb6m2tAjabyCDXw2rxZbyQ5LREWWM8U/Wk6Pd0OBLPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:21:29.329106Z"},"content_sha256":"cf7019f641aa635a0a15d8ac44353c3e6ed82469d661e9aa8ff798c2e9624655","schema_version":"1.0","event_id":"sha256:cf7019f641aa635a0a15d8ac44353c3e6ed82469d661e9aa8ff798c2e9624655"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/bundle.json","state_url":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/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-22T01:21:29Z","links":{"resolver":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN","bundle":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/bundle.json","state":"https://pith.science/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2RDLAOCWLXJWG6R25CFSQSOGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N2RDLAOCWLXJWG6R25CFSQSOGN","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":"b644732a01aebc342263e391cffccab6f8bd927bd9be916ac2eed7da0027e201","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-19T14:39:49Z","title_canon_sha256":"7ef07f2b505ea20a530b5683dbabf08aa803b2ad9dbe16cd506ab1d493c43f79"},"schema_version":"1.0","source":{"id":"1302.4622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4622","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4622v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4622","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"N2RDLAOCWLXJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N2RDLAOCWLXJWG6R","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N2RDLAOC","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:cf7019f641aa635a0a15d8ac44353c3e6ed82469d661e9aa8ff798c2e9624655","target":"graph","created_at":"2026-05-18T03:33:12Z","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 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 ","authors_text":"C\\'ecile Dartyge (IECL), Elie Mosaki (ICJ), Ramachandran Balasubramanian (CIT)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-19T14:39:49Z","title":"Sur la complexit\\'e de familles d'ensembles pseudo-al\\'eatoires"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4622","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:85c2c6706037010c76372c99cce4b962a5c4eaaec03fac9d606339a59f294849","target":"record","created_at":"2026-05-18T03:33:12Z","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":"b644732a01aebc342263e391cffccab6f8bd927bd9be916ac2eed7da0027e201","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-19T14:39:49Z","title_canon_sha256":"7ef07f2b505ea20a530b5683dbabf08aa803b2ad9dbe16cd506ab1d493c43f79"},"schema_version":"1.0","source":{"id":"1302.4622","kind":"arxiv","version":1}},"canonical_sha256":"6ea23581c2b2ee9b1bd1d74459424e3372f39733467ffef3905e5283e808b6ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ea23581c2b2ee9b1bd1d74459424e3372f39733467ffef3905e5283e808b6ad","first_computed_at":"2026-05-18T03:33:12.690987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:12.690987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gZyKWex6o01Ojv7OWtN2S1ZEKMQaJQDlXh3yIWHbSoRDScWigmn3NrAEZPQULOlcm98duBHmJIVTnsok+GNbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:12.691896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85c2c6706037010c76372c99cce4b962a5c4eaaec03fac9d606339a59f294849","sha256:cf7019f641aa635a0a15d8ac44353c3e6ed82469d661e9aa8ff798c2e9624655"],"state_sha256":"84cfe38823cd9ff8de0ef996a75a3b8f59da1cbca8136c985ffb39649bc3eb9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sevf8Ry2KnrcCgJ40XmmdP/79Y8+jUDbLAhQNzzNg6+ky2vPUdGvm4yUCDj6QB54wHqYvsuq54dnQNGgRV3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T01:21:29.331069Z","bundle_sha256":"465dc52e6766b975ab215eec81c5a9e1cba280ca9e5e893249bc9ce06ce97d6a"}}