{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4IAAGHTYKDUK62PKNSBEWTHR6G","short_pith_number":"pith:4IAAGHTY","schema_version":"1.0","canonical_sha256":"e200031e7850e8af69ea6c824b4cf1f1b621d6dc9290055bef74628cff5eb00a","source":{"kind":"arxiv","id":"1802.03534","version":1},"attestation_state":"computed","paper":{"title":"A family of ovoids in PG(3, 2^m) from cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Cunsheng Ding","submitted_at":"2018-02-10T07:16:56Z","abstract_excerpt":"Ovoids in $\\PG(3, q)$ have been an interesting topic in coding theory, combinatorics, and finite geometry for a long time. So far only two families are known. The first is the elliptic quadratics and the second is the Tits ovoids. In this article, we present a family of ovoids in $\\PG(3, 2^m)$ for all $m$ which are from a family of irreducible cyclic codes."},"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":"1802.03534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T07:16:56Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"71d5df00dd95794d188fb3a3b2f316c0057878ddb453af1f02ebb83d1ff87c4b","abstract_canon_sha256":"db5930cb315bd15e9d4e10dfbfb35b3a08d2bc8f2741790c7d2683a6a0a89b21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:51.259186Z","signature_b64":"WFNCiy0TuXct3Jtjfi9jtOgQzhLSnhxfYnZV8T1j92NQKuihPJwA7/tmajbrpx1uUCkAmY0P8nhV/G2neVF8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e200031e7850e8af69ea6c824b4cf1f1b621d6dc9290055bef74628cff5eb00a","last_reissued_at":"2026-05-18T00:23:51.258628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:51.258628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A family of ovoids in PG(3, 2^m) from cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Cunsheng Ding","submitted_at":"2018-02-10T07:16:56Z","abstract_excerpt":"Ovoids in $\\PG(3, q)$ have been an interesting topic in coding theory, combinatorics, and finite geometry for a long time. So far only two families are known. The first is the elliptic quadratics and the second is the Tits ovoids. In this article, we present a family of ovoids in $\\PG(3, 2^m)$ for all $m$ which are from a family of irreducible cyclic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03534","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":"1802.03534","created_at":"2026-05-18T00:23:51.258728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03534v1","created_at":"2026-05-18T00:23:51.258728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03534","created_at":"2026-05-18T00:23:51.258728+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IAAGHTYKDUK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IAAGHTYKDUK62PK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IAAGHTY","created_at":"2026-05-18T12:32:05.422762+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/4IAAGHTYKDUK62PKNSBEWTHR6G","json":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G.json","graph_json":"https://pith.science/api/pith-number/4IAAGHTYKDUK62PKNSBEWTHR6G/graph.json","events_json":"https://pith.science/api/pith-number/4IAAGHTYKDUK62PKNSBEWTHR6G/events.json","paper":"https://pith.science/paper/4IAAGHTY"},"agent_actions":{"view_html":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G","download_json":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G.json","view_paper":"https://pith.science/paper/4IAAGHTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03534&json=true","fetch_graph":"https://pith.science/api/pith-number/4IAAGHTYKDUK62PKNSBEWTHR6G/graph.json","fetch_events":"https://pith.science/api/pith-number/4IAAGHTYKDUK62PKNSBEWTHR6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G/action/storage_attestation","attest_author":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G/action/author_attestation","sign_citation":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G/action/citation_signature","submit_replication":"https://pith.science/pith/4IAAGHTYKDUK62PKNSBEWTHR6G/action/replication_record"}},"created_at":"2026-05-18T00:23:51.258728+00:00","updated_at":"2026-05-18T00:23:51.258728+00:00"}