{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WPECQVSVXPGVAIXQ2IMNTKIL45","short_pith_number":"pith:WPECQVSV","canonical_record":{"source":{"id":"1510.07087","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-23T23:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"095f5df6a3972087b8772eca07a467665b78880f54e82aa124df9660f41fbd14","abstract_canon_sha256":"9a58f324e7699e8e9844cf1dbdc79ffcd842153597aca0e1baf65ff8215e391a"},"schema_version":"1.0"},"canonical_sha256":"b3c8285655bbcd5022f0d218d9a90be740650a36952793f4f3556a7789a3ee41","source":{"kind":"arxiv","id":"1510.07087","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07087","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07087v5","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07087","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"WPECQVSVXPGV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WPECQVSVXPGVAIXQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WPECQVSV","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WPECQVSVXPGVAIXQ2IMNTKIL45","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07087","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-23T23:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"095f5df6a3972087b8772eca07a467665b78880f54e82aa124df9660f41fbd14","abstract_canon_sha256":"9a58f324e7699e8e9844cf1dbdc79ffcd842153597aca0e1baf65ff8215e391a"},"schema_version":"1.0"},"canonical_sha256":"b3c8285655bbcd5022f0d218d9a90be740650a36952793f4f3556a7789a3ee41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:13.481197Z","signature_b64":"hD2JMA5a4iwjs7TDLjnzj6JUqY8rIP5kDI0s6qrxAbKYFcy3kP2Rx2WGSLMu/OfdEsNlrf6fQcpW3sDxaW5lDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3c8285655bbcd5022f0d218d9a90be740650a36952793f4f3556a7789a3ee41","last_reissued_at":"2026-05-18T00:42:13.480495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:13.480495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07087","source_version":5,"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:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EkQt99BK6QadT5uBIT9Yg/wsBBue7NQIKE1NIOVen9DdM3jCOu15KPnCfu9EeC9OVZPkSYJA9mGA/4WdUklAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:42:08.456824Z"},"content_sha256":"0938228cccd4edbbe522e378d6bf17db91fff99afefd9e9b6d5386a5dad16992","schema_version":"1.0","event_id":"sha256:0938228cccd4edbbe522e378d6bf17db91fff99afefd9e9b6d5386a5dad16992"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WPECQVSVXPGVAIXQ2IMNTKIL45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directional H2-matrix compression for high-frequency problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Steffen B\\\"orm","submitted_at":"2015-10-23T23:37:51Z","abstract_excerpt":"Standard numerical algorithms like the fast multipole method or $\\mathcal{H}$-matrix schemes rely on low-rank approximations of the underlying kernel function. For high-frequency problems, the ranks grow rapidly as the mesh is refined, and standard techniques are no longer attractive.\n  Directional compression techniques solve this problem by using decompositions based on plane waves. Taking advantage of hierarchical relations between these waves' directions, an efficient approximation is obtained.\n  This paper is dedicated to directional $\\mathcal{H}^2$-matrices that employ local low-rank app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07087","kind":"arxiv","version":5},"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:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TT+m2NJgVh1dYUK9MwRcyhm5tEK6s9S4X2DT4Fi941Gb4eG6saAuzhL8Ol9btXqIFOGcgrsNM7hJBh7z/MikDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:42:08.457157Z"},"content_sha256":"fb8d24c78c5956e882e7267533ad92c605698540e88bd5562e8c9a94ab54727e","schema_version":"1.0","event_id":"sha256:fb8d24c78c5956e882e7267533ad92c605698540e88bd5562e8c9a94ab54727e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPECQVSVXPGVAIXQ2IMNTKIL45/bundle.json","state_url":"https://pith.science/pith/WPECQVSVXPGVAIXQ2IMNTKIL45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPECQVSVXPGVAIXQ2IMNTKIL45/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-29T18:42:08Z","links":{"resolver":"https://pith.science/pith/WPECQVSVXPGVAIXQ2IMNTKIL45","bundle":"https://pith.science/pith/WPECQVSVXPGVAIXQ2IMNTKIL45/bundle.json","state":"https://pith.science/pith/WPECQVSVXPGVAIXQ2IMNTKIL45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPECQVSVXPGVAIXQ2IMNTKIL45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WPECQVSVXPGVAIXQ2IMNTKIL45","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":"9a58f324e7699e8e9844cf1dbdc79ffcd842153597aca0e1baf65ff8215e391a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-23T23:37:51Z","title_canon_sha256":"095f5df6a3972087b8772eca07a467665b78880f54e82aa124df9660f41fbd14"},"schema_version":"1.0","source":{"id":"1510.07087","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07087","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07087v5","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07087","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"WPECQVSVXPGV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WPECQVSVXPGVAIXQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WPECQVSV","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:fb8d24c78c5956e882e7267533ad92c605698540e88bd5562e8c9a94ab54727e","target":"graph","created_at":"2026-05-18T00:42:13Z","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":"Standard numerical algorithms like the fast multipole method or $\\mathcal{H}$-matrix schemes rely on low-rank approximations of the underlying kernel function. For high-frequency problems, the ranks grow rapidly as the mesh is refined, and standard techniques are no longer attractive.\n  Directional compression techniques solve this problem by using decompositions based on plane waves. Taking advantage of hierarchical relations between these waves' directions, an efficient approximation is obtained.\n  This paper is dedicated to directional $\\mathcal{H}^2$-matrices that employ local low-rank app","authors_text":"Steffen B\\\"orm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-23T23:37:51Z","title":"Directional H2-matrix compression for high-frequency problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07087","kind":"arxiv","version":5},"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:0938228cccd4edbbe522e378d6bf17db91fff99afefd9e9b6d5386a5dad16992","target":"record","created_at":"2026-05-18T00:42:13Z","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":"9a58f324e7699e8e9844cf1dbdc79ffcd842153597aca0e1baf65ff8215e391a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-23T23:37:51Z","title_canon_sha256":"095f5df6a3972087b8772eca07a467665b78880f54e82aa124df9660f41fbd14"},"schema_version":"1.0","source":{"id":"1510.07087","kind":"arxiv","version":5}},"canonical_sha256":"b3c8285655bbcd5022f0d218d9a90be740650a36952793f4f3556a7789a3ee41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3c8285655bbcd5022f0d218d9a90be740650a36952793f4f3556a7789a3ee41","first_computed_at":"2026-05-18T00:42:13.480495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:13.480495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hD2JMA5a4iwjs7TDLjnzj6JUqY8rIP5kDI0s6qrxAbKYFcy3kP2Rx2WGSLMu/OfdEsNlrf6fQcpW3sDxaW5lDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:13.481197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07087","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0938228cccd4edbbe522e378d6bf17db91fff99afefd9e9b6d5386a5dad16992","sha256:fb8d24c78c5956e882e7267533ad92c605698540e88bd5562e8c9a94ab54727e"],"state_sha256":"9b0c59dfb1b63978a9b029595eb8df0dddaf887d9db0d29cf1fd2201ccf1a6e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PVs8ucOJvidqnkhqom4nY1kIe1rxt8V6yQvGiTbQtZ648ErQaIyi+gg/8b8u2F4Q+D6C10YKmOPWqfPL8oFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:42:08.458937Z","bundle_sha256":"ae54bd27ba985aa1396703660617a03cb0134ac424b61809f8f67e9bdb94268b"}}