{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UZAUGKAGDIWYGYV4HLWLMDQJNR","short_pith_number":"pith:UZAUGKAG","canonical_record":{"source":{"id":"1601.07281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-27T07:42:55Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"e8f81f15e74895d3caa803176e395c44a897ddb72e8f815d00b637cc9f0238c3","abstract_canon_sha256":"22c12870369f3863b38c188d9217422336962d6b9115b8ac661e262f5a0ac73a"},"schema_version":"1.0"},"canonical_sha256":"a6414328061a2d8362bc3aecb60e096c41246a4c5ab6d6a5df1fc8aed8f50624","source":{"kind":"arxiv","id":"1601.07281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07281","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07281v2","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07281","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"UZAUGKAGDIWY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UZAUGKAGDIWYGYV4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UZAUGKAG","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UZAUGKAGDIWYGYV4HLWLMDQJNR","target":"record","payload":{"canonical_record":{"source":{"id":"1601.07281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-27T07:42:55Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"e8f81f15e74895d3caa803176e395c44a897ddb72e8f815d00b637cc9f0238c3","abstract_canon_sha256":"22c12870369f3863b38c188d9217422336962d6b9115b8ac661e262f5a0ac73a"},"schema_version":"1.0"},"canonical_sha256":"a6414328061a2d8362bc3aecb60e096c41246a4c5ab6d6a5df1fc8aed8f50624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:15.263347Z","signature_b64":"Y85XTDAcYA0Lrbbm4X3r41nDxKz5+Vw/ebdYicsYLAoyVQn04zlIcjSJYlAiUXK3aWwBlDlXf+1gEXcjqpoGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6414328061a2d8362bc3aecb60e096c41246a4c5ab6d6a5df1fc8aed8f50624","last_reissued_at":"2026-05-18T00:32:15.262833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:15.262833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.07281","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-18T00:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+VuLn/n50kAc2dmCk1aOAMyltdmy6Uot9K77Ukj+BbtlSg5/lvLhJPfJpNhOKB3mUzrleg53qrZ6N2kW+tyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:12:27.821545Z"},"content_sha256":"a673b109f44b27f31942451f3d1ed2d0929a1750172aca42410e35b35843e7c5","schema_version":"1.0","event_id":"sha256:a673b109f44b27f31942451f3d1ed2d0929a1750172aca42410e35b35843e7c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UZAUGKAGDIWYGYV4HLWLMDQJNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal $L_p$-discrepancy bounds for second order digital sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.NA"],"primary_cat":"math.NT","authors_text":"Aicke Hinrichs, Friedrich Pillichshammer, Josef Dick, Lev Markhasin","submitted_at":"2016-01-27T07:42:55Z","abstract_excerpt":"The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution modulo one of infinite sequences. In 1986 Proinov proved for all $p>1$ a lower bound for the $L_p$-discrepancy of general infinite sequences in the $d$-dimensional unit cube, but it remained an open question whether this lower bound is best possible in the order of magnitude until recently. In 2014 Dick and Pillichshammer gave a first construction of an infinite sequence whose order of $L_2$-discrepancy matches the lower bound of Proinov. Here we give a complete solution to this problem for all finite $p > 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07281","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-18T00:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4S8fzbmFCJSippOaKr4u45gPo+oPcTc187TYZUrrOJJCJfCdpOnkqbysgtIaU0zMXT73GrMu6w/EyoEgOffEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:12:27.822250Z"},"content_sha256":"a1a2df1f018b84cece97edffe71df8c00d34bf470711aa5c4cd65ab768606aa7","schema_version":"1.0","event_id":"sha256:a1a2df1f018b84cece97edffe71df8c00d34bf470711aa5c4cd65ab768606aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR/bundle.json","state_url":"https://pith.science/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR/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-27T13:12:27Z","links":{"resolver":"https://pith.science/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR","bundle":"https://pith.science/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR/bundle.json","state":"https://pith.science/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZAUGKAGDIWYGYV4HLWLMDQJNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UZAUGKAGDIWYGYV4HLWLMDQJNR","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":"22c12870369f3863b38c188d9217422336962d6b9115b8ac661e262f5a0ac73a","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-27T07:42:55Z","title_canon_sha256":"e8f81f15e74895d3caa803176e395c44a897ddb72e8f815d00b637cc9f0238c3"},"schema_version":"1.0","source":{"id":"1601.07281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07281","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07281v2","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07281","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"UZAUGKAGDIWY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UZAUGKAGDIWYGYV4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UZAUGKAG","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:a1a2df1f018b84cece97edffe71df8c00d34bf470711aa5c4cd65ab768606aa7","target":"graph","created_at":"2026-05-18T00:32:15Z","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 $L_p$-discrepancy is a quantitative measure for the irregularity of distribution modulo one of infinite sequences. In 1986 Proinov proved for all $p>1$ a lower bound for the $L_p$-discrepancy of general infinite sequences in the $d$-dimensional unit cube, but it remained an open question whether this lower bound is best possible in the order of magnitude until recently. In 2014 Dick and Pillichshammer gave a first construction of an infinite sequence whose order of $L_2$-discrepancy matches the lower bound of Proinov. Here we give a complete solution to this problem for all finite $p > 1$.","authors_text":"Aicke Hinrichs, Friedrich Pillichshammer, Josef Dick, Lev Markhasin","cross_cats":["math.FA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-27T07:42:55Z","title":"Optimal $L_p$-discrepancy bounds for second order digital sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07281","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:a673b109f44b27f31942451f3d1ed2d0929a1750172aca42410e35b35843e7c5","target":"record","created_at":"2026-05-18T00:32:15Z","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":"22c12870369f3863b38c188d9217422336962d6b9115b8ac661e262f5a0ac73a","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-01-27T07:42:55Z","title_canon_sha256":"e8f81f15e74895d3caa803176e395c44a897ddb72e8f815d00b637cc9f0238c3"},"schema_version":"1.0","source":{"id":"1601.07281","kind":"arxiv","version":2}},"canonical_sha256":"a6414328061a2d8362bc3aecb60e096c41246a4c5ab6d6a5df1fc8aed8f50624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6414328061a2d8362bc3aecb60e096c41246a4c5ab6d6a5df1fc8aed8f50624","first_computed_at":"2026-05-18T00:32:15.262833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:15.262833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y85XTDAcYA0Lrbbm4X3r41nDxKz5+Vw/ebdYicsYLAoyVQn04zlIcjSJYlAiUXK3aWwBlDlXf+1gEXcjqpoGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:15.263347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a673b109f44b27f31942451f3d1ed2d0929a1750172aca42410e35b35843e7c5","sha256:a1a2df1f018b84cece97edffe71df8c00d34bf470711aa5c4cd65ab768606aa7"],"state_sha256":"beb76dff5d388650a13b056130ff6643bccae4258f2fc9b90428756c48944814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"795jZvGN8G9R5VAn884DhtJ9qt/puheyqWUy36IpYLhZ4OOuQEYodH/6wGb43ib+vMrxYV4DYk7zhdL/csn4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:12:27.826686Z","bundle_sha256":"68028dabd060b981ad53ea023033b371d03caa59238b2d170390a37ad823f2bd"}}