{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KKGDQ7WFQEB5TZTYDIQPE6MYR4","short_pith_number":"pith:KKGDQ7WF","schema_version":"1.0","canonical_sha256":"528c387ec58103d9e6781a20f279988f1ea690272aa655a1215d9d7d1ed2a262","source":{"kind":"arxiv","id":"1311.5739","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.5739","created_at":"2026-05-18T03:06:23.404778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5739v1","created_at":"2026-05-18T03:06:23.404778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5739","created_at":"2026-05-18T03:06:23.404778+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKGDQ7WFQEB5","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKGDQ7WFQEB5TZTY","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKGDQ7WF","created_at":"2026-05-18T12:27:51.066281+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/KKGDQ7WFQEB5TZTYDIQPE6MYR4","json":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4.json","graph_json":"https://pith.science/api/pith-number/KKGDQ7WFQEB5TZTYDIQPE6MYR4/graph.json","events_json":"https://pith.science/api/pith-number/KKGDQ7WFQEB5TZTYDIQPE6MYR4/events.json","paper":"https://pith.science/paper/KKGDQ7WF"},"agent_actions":{"view_html":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4","download_json":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4.json","view_paper":"https://pith.science/paper/KKGDQ7WF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5739&json=true","fetch_graph":"https://pith.science/api/pith-number/KKGDQ7WFQEB5TZTYDIQPE6MYR4/graph.json","fetch_events":"https://pith.science/api/pith-number/KKGDQ7WFQEB5TZTYDIQPE6MYR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/action/storage_attestation","attest_author":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/action/author_attestation","sign_citation":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/action/citation_signature","submit_replication":"https://pith.science/pith/KKGDQ7WFQEB5TZTYDIQPE6MYR4/action/replication_record"}},"created_at":"2026-05-18T03:06:23.404778+00:00","updated_at":"2026-05-18T03:06:23.404778+00:00"}