{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XKMR5KLERGBC3CAPI5EF25AWMN","short_pith_number":"pith:XKMR5KLE","schema_version":"1.0","canonical_sha256":"ba991ea96489822d880f47485d741663634f69fe835d78318a41665301caa075","source":{"kind":"arxiv","id":"1412.4221","version":1},"attestation_state":"computed","paper":{"title":"A Lower Bound on WAFOM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Takehito Yoshiki","submitted_at":"2014-12-13T10:16:28Z","abstract_excerpt":"We give a lower bound on Walsh figure of merit (WAFOM), which is a parameter to estimate the integration error for quasi-Monte Carlo (QMC) integration by a point set called a digital net. This lower bound is optimal because the existence of point sets attaining the order was proved in [K. Suzuki, An explicit construction of point sets with large minimum Dick weight, Journal of Complexity 30, (2014), 347-354]."},"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":"1412.4221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-13T10:16:28Z","cross_cats_sorted":[],"title_canon_sha256":"052841ffecd1a23ab3f0b5dbdcd92a43db44987687800d120fcd42f254bb54e7","abstract_canon_sha256":"8cd7b8f53a953a4bd72ec7bd52438cef0f0ae40bf08228f24193e6674df7e84b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:19.857828Z","signature_b64":"tABUGWd7PNPjexcjl5gJo/fE6ocLFcUe5x3dfbZIWLMdJm5ahPVAb/O97kfMUpKKZoKz0VnfIbui2g5xC1A+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba991ea96489822d880f47485d741663634f69fe835d78318a41665301caa075","last_reissued_at":"2026-05-18T02:31:19.857161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:19.857161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound on WAFOM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Takehito Yoshiki","submitted_at":"2014-12-13T10:16:28Z","abstract_excerpt":"We give a lower bound on Walsh figure of merit (WAFOM), which is a parameter to estimate the integration error for quasi-Monte Carlo (QMC) integration by a point set called a digital net. This lower bound is optimal because the existence of point sets attaining the order was proved in [K. Suzuki, An explicit construction of point sets with large minimum Dick weight, Journal of Complexity 30, (2014), 347-354]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4221","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":"1412.4221","created_at":"2026-05-18T02:31:19.857259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4221v1","created_at":"2026-05-18T02:31:19.857259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4221","created_at":"2026-05-18T02:31:19.857259+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKMR5KLERGBC","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKMR5KLERGBC3CAP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKMR5KLE","created_at":"2026-05-18T12:28:57.508820+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/XKMR5KLERGBC3CAPI5EF25AWMN","json":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN.json","graph_json":"https://pith.science/api/pith-number/XKMR5KLERGBC3CAPI5EF25AWMN/graph.json","events_json":"https://pith.science/api/pith-number/XKMR5KLERGBC3CAPI5EF25AWMN/events.json","paper":"https://pith.science/paper/XKMR5KLE"},"agent_actions":{"view_html":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN","download_json":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN.json","view_paper":"https://pith.science/paper/XKMR5KLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4221&json=true","fetch_graph":"https://pith.science/api/pith-number/XKMR5KLERGBC3CAPI5EF25AWMN/graph.json","fetch_events":"https://pith.science/api/pith-number/XKMR5KLERGBC3CAPI5EF25AWMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN/action/storage_attestation","attest_author":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN/action/author_attestation","sign_citation":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN/action/citation_signature","submit_replication":"https://pith.science/pith/XKMR5KLERGBC3CAPI5EF25AWMN/action/replication_record"}},"created_at":"2026-05-18T02:31:19.857259+00:00","updated_at":"2026-05-18T02:31:19.857259+00:00"}