{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OWIVDLM7XJEHGIWZCCBTLTFGWI","short_pith_number":"pith:OWIVDLM7","canonical_record":{"source":{"id":"1007.4899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-07-28T08:47:06Z","cross_cats_sorted":[],"title_canon_sha256":"9ed398116744da96bac1730230fe9b9a6435fbd92d18817faa9ccaab2e70fa73","abstract_canon_sha256":"a9aba00f2475ba5a58cef8742ce51d3a2be85dfb3e3d498b2eab029141f38c14"},"schema_version":"1.0"},"canonical_sha256":"759151ad9fba487322d9108335cca6b21c1652e23008be98ad78510736b2c9d1","source":{"kind":"arxiv","id":"1007.4899","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4899","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4899v2","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4899","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"OWIVDLM7XJEH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OWIVDLM7XJEHGIWZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OWIVDLM7","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OWIVDLM7XJEHGIWZCCBTLTFGWI","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-07-28T08:47:06Z","cross_cats_sorted":[],"title_canon_sha256":"9ed398116744da96bac1730230fe9b9a6435fbd92d18817faa9ccaab2e70fa73","abstract_canon_sha256":"a9aba00f2475ba5a58cef8742ce51d3a2be85dfb3e3d498b2eab029141f38c14"},"schema_version":"1.0"},"canonical_sha256":"759151ad9fba487322d9108335cca6b21c1652e23008be98ad78510736b2c9d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:00.082834Z","signature_b64":"ejMVaALij/EU4JNeEeqEwXE+a5EQdAA+GulZamlIyqflcaiTZWhXTUkeN+JjRwPL3UG7dKktgqkQXbr5en4nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759151ad9fba487322d9108335cca6b21c1652e23008be98ad78510736b2c9d1","last_reissued_at":"2026-05-18T04:01:00.082176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:00.082176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4899","source_version":2,"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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cvoNgANq2Buczi+2zQb/EzkBfuMuLXy/wxdJgmtZ1LUXXM/0XT9Vip+ysffnPv2A4Bq0e/nVE9L6sq8cDjyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:00:23.182602Z"},"content_sha256":"4582c9149b768cf6bf196910e449fbd27f285fea830175cf2e918048fbda8001","schema_version":"1.0","event_id":"sha256:4582c9149b768cf6bf196910e449fbd27f285fea830175cf2e918048fbda8001"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OWIVDLM7XJEHGIWZCCBTLTFGWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of self-dual normal bases and their complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Erik Jarl Pickett, Fran\\c{c}ois Arnault, St\\'ephane Vinatier","submitted_at":"2010-07-28T08:47:06Z","abstract_excerpt":"Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4899","kind":"arxiv","version":2},"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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic2lFQs2/x/nOhTFN+gdED31A1EKJNizVyxj+HpcfwC+O5Ejcn4ap9R/aoyj7E50S8cm6nvB9L66S+Lx0sCZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:00:23.183307Z"},"content_sha256":"641848b5365f4b57c3a1db061da52b23bc6a433f861e84c3a83cda8ff09465a8","schema_version":"1.0","event_id":"sha256:641848b5365f4b57c3a1db061da52b23bc6a433f861e84c3a83cda8ff09465a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI/bundle.json","state_url":"https://pith.science/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI/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-05-31T11:00:23Z","links":{"resolver":"https://pith.science/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI","bundle":"https://pith.science/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI/bundle.json","state":"https://pith.science/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWIVDLM7XJEHGIWZCCBTLTFGWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OWIVDLM7XJEHGIWZCCBTLTFGWI","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":"a9aba00f2475ba5a58cef8742ce51d3a2be85dfb3e3d498b2eab029141f38c14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-07-28T08:47:06Z","title_canon_sha256":"9ed398116744da96bac1730230fe9b9a6435fbd92d18817faa9ccaab2e70fa73"},"schema_version":"1.0","source":{"id":"1007.4899","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4899","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4899v2","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4899","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"OWIVDLM7XJEH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OWIVDLM7XJEHGIWZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OWIVDLM7","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:641848b5365f4b57c3a1db061da52b23bc6a433f861e84c3a83cda8ff09465a8","target":"graph","created_at":"2026-05-18T04:01:00Z","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":"Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis.","authors_text":"Erik Jarl Pickett, Fran\\c{c}ois Arnault, St\\'ephane Vinatier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-07-28T08:47:06Z","title":"Construction of self-dual normal bases and their complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4899","kind":"arxiv","version":2},"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:4582c9149b768cf6bf196910e449fbd27f285fea830175cf2e918048fbda8001","target":"record","created_at":"2026-05-18T04:01:00Z","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":"a9aba00f2475ba5a58cef8742ce51d3a2be85dfb3e3d498b2eab029141f38c14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-07-28T08:47:06Z","title_canon_sha256":"9ed398116744da96bac1730230fe9b9a6435fbd92d18817faa9ccaab2e70fa73"},"schema_version":"1.0","source":{"id":"1007.4899","kind":"arxiv","version":2}},"canonical_sha256":"759151ad9fba487322d9108335cca6b21c1652e23008be98ad78510736b2c9d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"759151ad9fba487322d9108335cca6b21c1652e23008be98ad78510736b2c9d1","first_computed_at":"2026-05-18T04:01:00.082176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:00.082176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ejMVaALij/EU4JNeEeqEwXE+a5EQdAA+GulZamlIyqflcaiTZWhXTUkeN+JjRwPL3UG7dKktgqkQXbr5en4nAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:00.082834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4899","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4582c9149b768cf6bf196910e449fbd27f285fea830175cf2e918048fbda8001","sha256:641848b5365f4b57c3a1db061da52b23bc6a433f861e84c3a83cda8ff09465a8"],"state_sha256":"b8e3c4e0f3d82b1ca3d998a72185071f5649cfc8c3b849090ca1f8e0d044cb68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPmju4B0pf42qpYGht95TLIcqTMQT+Qt3AFI6Qha6N6B+ata6v8HsOXw073dKhAvdKdN9VMIfxEi0sm2f/BxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:00:23.186845Z","bundle_sha256":"59bf7fa67679d77bb220a12a739aed6014e85d1dddea45bb7d1d14bcf3f12e97"}}