{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LWFBEAFHJNDXLC5UNSCIEWIHH2","short_pith_number":"pith:LWFBEAFH","schema_version":"1.0","canonical_sha256":"5d8a1200a74b47758bb46c848259073e96652ada4d579aa242c7c402806c60f6","source":{"kind":"arxiv","id":"1506.00222","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00222","created_at":"2026-05-18T00:46:49.845100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00222v2","created_at":"2026-05-18T00:46:49.845100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00222","created_at":"2026-05-18T00:46:49.845100+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWFBEAFHJNDX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWFBEAFHJNDXLC5U","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWFBEAFH","created_at":"2026-05-18T12:29:29.992203+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/LWFBEAFHJNDXLC5UNSCIEWIHH2","json":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2.json","graph_json":"https://pith.science/api/pith-number/LWFBEAFHJNDXLC5UNSCIEWIHH2/graph.json","events_json":"https://pith.science/api/pith-number/LWFBEAFHJNDXLC5UNSCIEWIHH2/events.json","paper":"https://pith.science/paper/LWFBEAFH"},"agent_actions":{"view_html":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2","download_json":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2.json","view_paper":"https://pith.science/paper/LWFBEAFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00222&json=true","fetch_graph":"https://pith.science/api/pith-number/LWFBEAFHJNDXLC5UNSCIEWIHH2/graph.json","fetch_events":"https://pith.science/api/pith-number/LWFBEAFHJNDXLC5UNSCIEWIHH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/action/storage_attestation","attest_author":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/action/author_attestation","sign_citation":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/action/citation_signature","submit_replication":"https://pith.science/pith/LWFBEAFHJNDXLC5UNSCIEWIHH2/action/replication_record"}},"created_at":"2026-05-18T00:46:49.845100+00:00","updated_at":"2026-05-18T00:46:49.845100+00:00"}