{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6CS4RSROOG5E5UCEUPOHO4N6PL","short_pith_number":"pith:6CS4RSRO","canonical_record":{"source":{"id":"2510.13204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-10-15T06:49:00Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0252f3047941f2a644022dacb15573d8197520ad55384aad578c68b3a72c86e3","abstract_canon_sha256":"2c3a9db5010d2fabae443b4625388da936b6650a9e0c5a217d7b68adb38d91c7"},"schema_version":"1.0"},"canonical_sha256":"f0a5c8ca2e71ba4ed044a3dc7771be7af05bb9b529b1636e9417ac58d8b148e4","source":{"kind":"arxiv","id":"2510.13204","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.13204","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"2510.13204v2","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.13204","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"6CS4RSROOG5E","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"pith_short_16","alias_value":"6CS4RSROOG5E5UCE","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"pith_short_8","alias_value":"6CS4RSRO","created_at":"2026-06-11T01:09:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6CS4RSROOG5E5UCEUPOHO4N6PL","target":"record","payload":{"canonical_record":{"source":{"id":"2510.13204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-10-15T06:49:00Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0252f3047941f2a644022dacb15573d8197520ad55384aad578c68b3a72c86e3","abstract_canon_sha256":"2c3a9db5010d2fabae443b4625388da936b6650a9e0c5a217d7b68adb38d91c7"},"schema_version":"1.0"},"canonical_sha256":"f0a5c8ca2e71ba4ed044a3dc7771be7af05bb9b529b1636e9417ac58d8b148e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:20.196644Z","signature_b64":"/gJWdEtvv2Oa0l8mp5YVF0/bJdi1zYxsIKAdw0cb3X3KSQJWIc0m32TsDpsLwyGDd9ps38dKis8BoLpemfKJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a5c8ca2e71ba4ed044a3dc7771be7af05bb9b529b1636e9417ac58d8b148e4","last_reissued_at":"2026-06-11T01:09:20.195759Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:20.195759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.13204","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-06-11T01:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3zmD5HQZbdx8gYbelj7Lj0ljXz+SnwrrvVmz/vS5BawljGt4DrZsz34pqDMyPBIV5ZZ1ufpxUpTJ/ufBOOeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:17:27.007119Z"},"content_sha256":"94d0690469a1e48ccdd1630174a40afa6012f1ef497fc25931bd2f602dc78d7c","schema_version":"1.0","event_id":"sha256:94d0690469a1e48ccdd1630174a40afa6012f1ef497fc25931bd2f602dc78d7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6CS4RSROOG5E5UCEUPOHO4N6PL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How many integrals should be evaluated at least in two-dimensional hyperinterpolation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Congpei An, Hong Yan, Maolin Che, Yimin Wei","submitted_at":"2025-10-15T06:49:00Z","abstract_excerpt":"This paper introduces a novel approach to approximating continuous functions over high-dimensional hypercubes by integrating matrix CUR decomposition with hyperinterpolation techniques. Traditional Fourier-based hyperinterpolation methods suffer from the curse of dimensionality, as the number of coefficients grows exponentially with the dimension. To address this challenge, we propose two efficient strategies for constructing low-rank matrix CUR decompositions of the coefficient matrix, significantly reducing computational complexity while preserving accuracy.\n  The first method employs struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13204","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.13204/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-11T01:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwKAZOc3NF/IIJz4lr26ih8/KOYT1O0XImF0E81wECeDn3ggvMqOXhBSySy96H1lni43PEZazvBoxfIBSJr+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:17:27.007505Z"},"content_sha256":"021a95c11795c0d13a3a1e85253162aa419a05af8944323025730c6be1f9d855","schema_version":"1.0","event_id":"sha256:021a95c11795c0d13a3a1e85253162aa419a05af8944323025730c6be1f9d855"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CS4RSROOG5E5UCEUPOHO4N6PL/bundle.json","state_url":"https://pith.science/pith/6CS4RSROOG5E5UCEUPOHO4N6PL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CS4RSROOG5E5UCEUPOHO4N6PL/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-29T03:17:27Z","links":{"resolver":"https://pith.science/pith/6CS4RSROOG5E5UCEUPOHO4N6PL","bundle":"https://pith.science/pith/6CS4RSROOG5E5UCEUPOHO4N6PL/bundle.json","state":"https://pith.science/pith/6CS4RSROOG5E5UCEUPOHO4N6PL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CS4RSROOG5E5UCEUPOHO4N6PL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6CS4RSROOG5E5UCEUPOHO4N6PL","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":"2c3a9db5010d2fabae443b4625388da936b6650a9e0c5a217d7b68adb38d91c7","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-10-15T06:49:00Z","title_canon_sha256":"0252f3047941f2a644022dacb15573d8197520ad55384aad578c68b3a72c86e3"},"schema_version":"1.0","source":{"id":"2510.13204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.13204","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"2510.13204v2","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.13204","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"6CS4RSROOG5E","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"pith_short_16","alias_value":"6CS4RSROOG5E5UCE","created_at":"2026-06-11T01:09:20Z"},{"alias_kind":"pith_short_8","alias_value":"6CS4RSRO","created_at":"2026-06-11T01:09:20Z"}],"graph_snapshots":[{"event_id":"sha256:021a95c11795c0d13a3a1e85253162aa419a05af8944323025730c6be1f9d855","target":"graph","created_at":"2026-06-11T01:09:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.13204/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a novel approach to approximating continuous functions over high-dimensional hypercubes by integrating matrix CUR decomposition with hyperinterpolation techniques. Traditional Fourier-based hyperinterpolation methods suffer from the curse of dimensionality, as the number of coefficients grows exponentially with the dimension. To address this challenge, we propose two efficient strategies for constructing low-rank matrix CUR decompositions of the coefficient matrix, significantly reducing computational complexity while preserving accuracy.\n  The first method employs struct","authors_text":"Congpei An, Hong Yan, Maolin Che, Yimin Wei","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-10-15T06:49:00Z","title":"How many integrals should be evaluated at least in two-dimensional hyperinterpolation?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13204","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:94d0690469a1e48ccdd1630174a40afa6012f1ef497fc25931bd2f602dc78d7c","target":"record","created_at":"2026-06-11T01:09:20Z","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":"2c3a9db5010d2fabae443b4625388da936b6650a9e0c5a217d7b68adb38d91c7","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-10-15T06:49:00Z","title_canon_sha256":"0252f3047941f2a644022dacb15573d8197520ad55384aad578c68b3a72c86e3"},"schema_version":"1.0","source":{"id":"2510.13204","kind":"arxiv","version":2}},"canonical_sha256":"f0a5c8ca2e71ba4ed044a3dc7771be7af05bb9b529b1636e9417ac58d8b148e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a5c8ca2e71ba4ed044a3dc7771be7af05bb9b529b1636e9417ac58d8b148e4","first_computed_at":"2026-06-11T01:09:20.195759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:20.195759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gJWdEtvv2Oa0l8mp5YVF0/bJdi1zYxsIKAdw0cb3X3KSQJWIc0m32TsDpsLwyGDd9ps38dKis8BoLpemfKJBQ==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:20.196644Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.13204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94d0690469a1e48ccdd1630174a40afa6012f1ef497fc25931bd2f602dc78d7c","sha256:021a95c11795c0d13a3a1e85253162aa419a05af8944323025730c6be1f9d855"],"state_sha256":"f4b01dd7d40a273f48a66edaefe93b90757a69b93fa79c492ac93e87abf00c9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZOY6Py1JZFQ42WdKvdnhvyBMiM3QLfwAEkvzTRaIYWJrsxRdcPy7MxTOsxCy8mKPPHdrBpE+HrMjXUUjN9GDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:17:27.009433Z","bundle_sha256":"40c49c6a659cf316b6d3f62e068706668d208dfa70ae1dcb129dd85162dc50b8"}}