{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LWFBEAFHJNDXLC5UNSCIEWIHH2","short_pith_number":"pith:LWFBEAFH","canonical_record":{"source":{"id":"1506.00222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-31T12:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"4a118c60cb0bee33da20ec2fcfbc677f44515cb89e222b69f7bf511f268c4c85","abstract_canon_sha256":"f803f074c1ee8653d2e99a83554df82e9f5b077c40edbe932b56475834d7efc8"},"schema_version":"1.0"},"canonical_sha256":"5d8a1200a74b47758bb46c848259073e96652ada4d579aa242c7c402806c60f6","source":{"kind":"arxiv","id":"1506.00222","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00222","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00222v2","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00222","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"LWFBEAFHJNDX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWFBEAFHJNDXLC5U","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWFBEAFH","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LWFBEAFHJNDXLC5UNSCIEWIHH2","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-31T12:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"4a118c60cb0bee33da20ec2fcfbc677f44515cb89e222b69f7bf511f268c4c85","abstract_canon_sha256":"f803f074c1ee8653d2e99a83554df82e9f5b077c40edbe932b56475834d7efc8"},"schema_version":"1.0"},"canonical_sha256":"5d8a1200a74b47758bb46c848259073e96652ada4d579aa242c7c402806c60f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.845623Z","signature_b64":"M1bEmcbtjp9FCcMz9xVnIVJKieIozqFC0V5TruBGxrVnaKdvkmW3B5xtpGgwW+wp2gk2up/Pq/hDuTU54iNkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d8a1200a74b47758bb46c848259073e96652ada4d579aa242c7c402806c60f6","last_reissued_at":"2026-05-18T00:46:49.845006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.845006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00222","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:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOawYr0+AM72Mcw9yb/cyzJ0x5pVJ0TAmWvRZTYcHm0R8FqX2tinn139FjmMUkTdkTBESdLwKA1R9RGB8L1kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:57:47.007638Z"},"content_sha256":"115482188a96fa4fe03f89089481820dbfd39685f08ea48a3789c36b836a1a8c","schema_version":"1.0","event_id":"sha256:115482188a96fa4fe03f89089481820dbfd39685f08ea48a3789c36b836a1a8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LWFBEAFHJNDXLC5UNSCIEWIHH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive compression of large vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Steffen B\\\"orm","submitted_at":"2015-05-31T12:42:07Z","abstract_excerpt":"Numerical algorithms for elliptic partial differential equations frequently employ error estimators and adaptive mesh refinement strategies in order to reduce the computational cost.\n  We can extend these techniques to general vectors by splitting the vectors into a hierarchically organized partition of subsets and using appropriate bases to represent the corresponding parts of the vectors. This leads to the concept of \\emph{hierarchical vectors}.\n  A hierarchical vector with $m$ subsets and bases of rank $k$ requires $mk$ units of storage, and typical operations like the evaluation of norms a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00222","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:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lh6Mhp2TKTewUxVY5dUFlV3xrteEAxj7OGyu3KofDC9bl82HQO+efScNo0GY/CuJPEP/7Czaq/YXvRGeagOQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:57:47.007982Z"},"content_sha256":"fc2b076bf92b5473cb41d847430fd592337396b51b8a9e7de3f342b78ff0bfd4","schema_version":"1.0","event_id":"sha256:fc2b076bf92b5473cb41d847430fd592337396b51b8a9e7de3f342b78ff0bfd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/bundle.json","state_url":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/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-29T19:57:47Z","links":{"resolver":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2","bundle":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/bundle.json","state":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LWFBEAFHJNDXLC5UNSCIEWIHH2","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":"f803f074c1ee8653d2e99a83554df82e9f5b077c40edbe932b56475834d7efc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-31T12:42:07Z","title_canon_sha256":"4a118c60cb0bee33da20ec2fcfbc677f44515cb89e222b69f7bf511f268c4c85"},"schema_version":"1.0","source":{"id":"1506.00222","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00222","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00222v2","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00222","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"LWFBEAFHJNDX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWFBEAFHJNDXLC5U","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWFBEAFH","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:fc2b076bf92b5473cb41d847430fd592337396b51b8a9e7de3f342b78ff0bfd4","target":"graph","created_at":"2026-05-18T00:46:49Z","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":"Numerical algorithms for elliptic partial differential equations frequently employ error estimators and adaptive mesh refinement strategies in order to reduce the computational cost.\n  We can extend these techniques to general vectors by splitting the vectors into a hierarchically organized partition of subsets and using appropriate bases to represent the corresponding parts of the vectors. This leads to the concept of \\emph{hierarchical vectors}.\n  A hierarchical vector with $m$ subsets and bases of rank $k$ requires $mk$ units of storage, and typical operations like the evaluation of norms a","authors_text":"Steffen B\\\"orm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-31T12:42:07Z","title":"Adaptive compression of large vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00222","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:115482188a96fa4fe03f89089481820dbfd39685f08ea48a3789c36b836a1a8c","target":"record","created_at":"2026-05-18T00:46:49Z","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":"f803f074c1ee8653d2e99a83554df82e9f5b077c40edbe932b56475834d7efc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-31T12:42:07Z","title_canon_sha256":"4a118c60cb0bee33da20ec2fcfbc677f44515cb89e222b69f7bf511f268c4c85"},"schema_version":"1.0","source":{"id":"1506.00222","kind":"arxiv","version":2}},"canonical_sha256":"5d8a1200a74b47758bb46c848259073e96652ada4d579aa242c7c402806c60f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d8a1200a74b47758bb46c848259073e96652ada4d579aa242c7c402806c60f6","first_computed_at":"2026-05-18T00:46:49.845006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:49.845006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M1bEmcbtjp9FCcMz9xVnIVJKieIozqFC0V5TruBGxrVnaKdvkmW3B5xtpGgwW+wp2gk2up/Pq/hDuTU54iNkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:49.845623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00222","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:115482188a96fa4fe03f89089481820dbfd39685f08ea48a3789c36b836a1a8c","sha256:fc2b076bf92b5473cb41d847430fd592337396b51b8a9e7de3f342b78ff0bfd4"],"state_sha256":"a10c56ffa960e01926ba233aebf50e3951d3fc9b4c27e3050486fc62a0f321cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drpEvFAEnme9npTA07p0lPsw8CfgbeiLbMEN5rJGgjBFCXP1YDvZbT5pXL8TM4TS8k16dq/sKTO6Sg9TpxyXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:57:47.009881Z","bundle_sha256":"6c8492d13ae209a65e28416ea618f5d31eca1a688db3917d8ca23fe4fcc37622"}}