{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:46GERKRQBTVPKC455JL4SH5V5G","short_pith_number":"pith:46GERKRQ","canonical_record":{"source":{"id":"1110.5696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-26T02:24:48Z","cross_cats_sorted":["math.AG","math.CO"],"title_canon_sha256":"b3ce9eebfcaec412a7a1a22e684cf364000e2eadf872da91c423ff132674edad","abstract_canon_sha256":"21795edb1b1a2281672041c76baf231e43c416844491dca88326822ebf430105"},"schema_version":"1.0"},"canonical_sha256":"e78c48aa300ceaf50b9dea57c91fb5e9af5ece3c496d7346495308e6424c9eff","source":{"kind":"arxiv","id":"1110.5696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5696","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5696v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5696","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"46GERKRQBTVP","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"46GERKRQBTVPKC45","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"46GERKRQ","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:46GERKRQBTVPKC455JL4SH5V5G","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-26T02:24:48Z","cross_cats_sorted":["math.AG","math.CO"],"title_canon_sha256":"b3ce9eebfcaec412a7a1a22e684cf364000e2eadf872da91c423ff132674edad","abstract_canon_sha256":"21795edb1b1a2281672041c76baf231e43c416844491dca88326822ebf430105"},"schema_version":"1.0"},"canonical_sha256":"e78c48aa300ceaf50b9dea57c91fb5e9af5ece3c496d7346495308e6424c9eff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:11.599066Z","signature_b64":"3qKQ42SndOhPi5fltkerzN/XaXqE9kPUkS54vsl1xYTWrlAkpyQF1kXUVL9LhuyPDukX4l0CgceZQY5n59d5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e78c48aa300ceaf50b9dea57c91fb5e9af5ece3c496d7346495308e6424c9eff","last_reissued_at":"2026-05-18T04:10:11.598227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:11.598227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5696","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-18T04:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fi/XRlynMSvKDKvbF9PK+4suU7V72ioJNkFGCxLeO6PuB826kF1bQ3VgNw9PwXQgXssJkwr+5hW1Gg63HTJaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:18:54.040597Z"},"content_sha256":"2077c5d8cd06cc78108b9fcc4d8ac8d85337914ab3171e1a984630e3145d4ffd","schema_version":"1.0","event_id":"sha256:2077c5d8cd06cc78108b9fcc4d8ac8d85337914ab3171e1a984630e3145d4ffd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:46GERKRQBTVPKC455JL4SH5V5G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace Evasive Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO"],"primary_cat":"cs.CC","authors_text":"Shachar Lovett, Zeev Dvir","submitted_at":"2011-10-26T02:24:48Z","abstract_excerpt":"In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed subspace-evasive sets, started in the work of Pudlak and Rodl (2004) who showed how such constructions over the binary field can be used to construct explicit Ramsey graphs. More recently, Guruswami (2011) showed that, over large finite fields (of size polynomial in n), subspace evasive sets can be used to obtain explicit list-decodable codes with optimal r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5696","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-18T04:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yf1ruS+ksVxmuw5laNQ8wTQk00wzzbylGN3B53MVNbLtiYmRInl7MjPN/UrrjfRLcEpLnGw9N/rf35NVqA6ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:18:54.041310Z"},"content_sha256":"cd537f32f60e423a57af6b96d2668b06efcf8caa61eee500e96053cbbf350431","schema_version":"1.0","event_id":"sha256:cd537f32f60e423a57af6b96d2668b06efcf8caa61eee500e96053cbbf350431"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46GERKRQBTVPKC455JL4SH5V5G/bundle.json","state_url":"https://pith.science/pith/46GERKRQBTVPKC455JL4SH5V5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46GERKRQBTVPKC455JL4SH5V5G/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-09T06:18:54Z","links":{"resolver":"https://pith.science/pith/46GERKRQBTVPKC455JL4SH5V5G","bundle":"https://pith.science/pith/46GERKRQBTVPKC455JL4SH5V5G/bundle.json","state":"https://pith.science/pith/46GERKRQBTVPKC455JL4SH5V5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46GERKRQBTVPKC455JL4SH5V5G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:46GERKRQBTVPKC455JL4SH5V5G","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":"21795edb1b1a2281672041c76baf231e43c416844491dca88326822ebf430105","cross_cats_sorted":["math.AG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-26T02:24:48Z","title_canon_sha256":"b3ce9eebfcaec412a7a1a22e684cf364000e2eadf872da91c423ff132674edad"},"schema_version":"1.0","source":{"id":"1110.5696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5696","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5696v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5696","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"46GERKRQBTVP","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"46GERKRQBTVPKC45","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"46GERKRQ","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:cd537f32f60e423a57af6b96d2668b06efcf8caa61eee500e96053cbbf350431","target":"graph","created_at":"2026-05-18T04:10:11Z","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 work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed subspace-evasive sets, started in the work of Pudlak and Rodl (2004) who showed how such constructions over the binary field can be used to construct explicit Ramsey graphs. More recently, Guruswami (2011) showed that, over large finite fields (of size polynomial in n), subspace evasive sets can be used to obtain explicit list-decodable codes with optimal r","authors_text":"Shachar Lovett, Zeev Dvir","cross_cats":["math.AG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-26T02:24:48Z","title":"Subspace Evasive Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5696","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:2077c5d8cd06cc78108b9fcc4d8ac8d85337914ab3171e1a984630e3145d4ffd","target":"record","created_at":"2026-05-18T04:10:11Z","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":"21795edb1b1a2281672041c76baf231e43c416844491dca88326822ebf430105","cross_cats_sorted":["math.AG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-26T02:24:48Z","title_canon_sha256":"b3ce9eebfcaec412a7a1a22e684cf364000e2eadf872da91c423ff132674edad"},"schema_version":"1.0","source":{"id":"1110.5696","kind":"arxiv","version":1}},"canonical_sha256":"e78c48aa300ceaf50b9dea57c91fb5e9af5ece3c496d7346495308e6424c9eff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e78c48aa300ceaf50b9dea57c91fb5e9af5ece3c496d7346495308e6424c9eff","first_computed_at":"2026-05-18T04:10:11.598227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:11.598227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3qKQ42SndOhPi5fltkerzN/XaXqE9kPUkS54vsl1xYTWrlAkpyQF1kXUVL9LhuyPDukX4l0CgceZQY5n59d5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:11.599066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2077c5d8cd06cc78108b9fcc4d8ac8d85337914ab3171e1a984630e3145d4ffd","sha256:cd537f32f60e423a57af6b96d2668b06efcf8caa61eee500e96053cbbf350431"],"state_sha256":"5f149e780681966fd4c6e21a2358d674bb97a0d4da1ed3d2f90e79510c95291e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozEaGL2NPIPJYXmVIl3P2aZgk1IHLaqQ2ZTrIUYKVZ77z2jlf+bwCTKs60ZI11GElZGinYEdaihUfwFg484KDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:18:54.045204Z","bundle_sha256":"9523b9e756c39180fe90b7a2b301db2baf35047dcfc5bf75564e02d3a46a5cd2"}}