{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KKGDQ7WFQEB5TZTYDIQPE6MYR4","short_pith_number":"pith:KKGDQ7WF","canonical_record":{"source":{"id":"1311.5739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-11-22T12:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"255ff54c63bc5d02563a6a18b16c77d8bc850033964be608bf9ffff1ce736c29","abstract_canon_sha256":"60c5181de054642f41b16cefb340a8522c74414fedc825fc7d8b97495398e0d8"},"schema_version":"1.0"},"canonical_sha256":"528c387ec58103d9e6781a20f279988f1ea690272aa655a1215d9d7d1ed2a262","source":{"kind":"arxiv","id":"1311.5739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5739","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5739v1","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5739","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"KKGDQ7WFQEB5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KKGDQ7WFQEB5TZTY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KKGDQ7WF","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KKGDQ7WFQEB5TZTYDIQPE6MYR4","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-11-22T12:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"255ff54c63bc5d02563a6a18b16c77d8bc850033964be608bf9ffff1ce736c29","abstract_canon_sha256":"60c5181de054642f41b16cefb340a8522c74414fedc825fc7d8b97495398e0d8"},"schema_version":"1.0"},"canonical_sha256":"528c387ec58103d9e6781a20f279988f1ea690272aa655a1215d9d7d1ed2a262","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:23.405355Z","signature_b64":"SNBsDoeaz57ajsCO5+K/S+r37l/ERQI8GY0GdcokQ29zmpP3L9ia7C9WvAje1oiuJFbcTpyrKzV7BaEq2UEsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"528c387ec58103d9e6781a20f279988f1ea690272aa655a1215d9d7d1ed2a262","last_reissued_at":"2026-05-18T03:06:23.404684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:23.404684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5739","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:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HY3q4g5YtkB9VaNMnBm80Y6rDJDJ7IiUynXq0Lvbf8pzeXQWzlAaXDwTbbnbpcyxM5mkEDL1UIu1vZoH36M8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:26:56.924445Z"},"content_sha256":"085b795934563380f6198e6025185acba716ccb084b727b2e7b1125e9951143c","schema_version":"1.0","event_id":"sha256:085b795934563380f6198e6025185acba716ccb084b727b2e7b1125e9951143c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KKGDQ7WFQEB5TZTYDIQPE6MYR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit constructions of Vandermonde sequences using global function fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Harald Niederreiter, Roswitha Hofer","submitted_at":"2013-11-22T12:56:50Z","abstract_excerpt":"The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via component-by-component search algorithms. A striking characteristic of the Vandermonde nets is that for fixed $m$ an explicit construction of $m \\times m$ generating matrices over the finite field $F_q$ is known for dimensions $s \\le q+1$. This paper extends this explicit construction in two directions. We give a maximal extension in terms of $m$ by introducing a construction algorithm for $\\infty \\times \\infty$ genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5739","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:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5t87Fvgbj9vgIUFtw0DMzEcYw18reoxnqDrkieBa1Kdr+YOmaiPPk6H1rF7dRphE8+H/Bk0J2j9smaeBm3xvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:26:56.925087Z"},"content_sha256":"d98f983ec68378239ced4be65ea6b93bc5a050ae83c7473f6e5f1a8c13bbcd77","schema_version":"1.0","event_id":"sha256:d98f983ec68378239ced4be65ea6b93bc5a050ae83c7473f6e5f1a8c13bbcd77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/bundle.json","state_url":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/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-07T14:26:56Z","links":{"resolver":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4","bundle":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/bundle.json","state":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KKGDQ7WFQEB5TZTYDIQPE6MYR4","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":"60c5181de054642f41b16cefb340a8522c74414fedc825fc7d8b97495398e0d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-11-22T12:56:50Z","title_canon_sha256":"255ff54c63bc5d02563a6a18b16c77d8bc850033964be608bf9ffff1ce736c29"},"schema_version":"1.0","source":{"id":"1311.5739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5739","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5739v1","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5739","created_at":"2026-05-18T03:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"KKGDQ7WFQEB5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KKGDQ7WFQEB5TZTY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KKGDQ7WF","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d98f983ec68378239ced4be65ea6b93bc5a050ae83c7473f6e5f1a8c13bbcd77","target":"graph","created_at":"2026-05-18T03:06:23Z","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":"The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via component-by-component search algorithms. A striking characteristic of the Vandermonde nets is that for fixed $m$ an explicit construction of $m \\times m$ generating matrices over the finite field $F_q$ is known for dimensions $s \\le q+1$. This paper extends this explicit construction in two directions. We give a maximal extension in terms of $m$ by introducing a construction algorithm for $\\infty \\times \\infty$ genera","authors_text":"Harald Niederreiter, Roswitha Hofer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-11-22T12:56:50Z","title":"Explicit constructions of Vandermonde sequences using global function fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5739","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:085b795934563380f6198e6025185acba716ccb084b727b2e7b1125e9951143c","target":"record","created_at":"2026-05-18T03:06:23Z","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":"60c5181de054642f41b16cefb340a8522c74414fedc825fc7d8b97495398e0d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-11-22T12:56:50Z","title_canon_sha256":"255ff54c63bc5d02563a6a18b16c77d8bc850033964be608bf9ffff1ce736c29"},"schema_version":"1.0","source":{"id":"1311.5739","kind":"arxiv","version":1}},"canonical_sha256":"528c387ec58103d9e6781a20f279988f1ea690272aa655a1215d9d7d1ed2a262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"528c387ec58103d9e6781a20f279988f1ea690272aa655a1215d9d7d1ed2a262","first_computed_at":"2026-05-18T03:06:23.404684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:23.404684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SNBsDoeaz57ajsCO5+K/S+r37l/ERQI8GY0GdcokQ29zmpP3L9ia7C9WvAje1oiuJFbcTpyrKzV7BaEq2UEsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:23.405355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:085b795934563380f6198e6025185acba716ccb084b727b2e7b1125e9951143c","sha256:d98f983ec68378239ced4be65ea6b93bc5a050ae83c7473f6e5f1a8c13bbcd77"],"state_sha256":"36bc4d4195ef873a418b09f7ff4e2450360cab9e6cb17a14b63562e2059de3d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sU/ygF+DQvHrm0dT5SII+8AcydNYJB3iWGWXVR4+rKcFosl9wan0wMdbjLKHnlEoJaWvDJsiiaSReJvc3QSMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:26:56.928484Z","bundle_sha256":"e22d35a010448e54a0c0dd42cc867131a0666fdd4585936855fff917f8265d9b"}}