{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:APVXVHWLU5OJJH6E4SD7OI7EGD","short_pith_number":"pith:APVXVHWL","schema_version":"1.0","canonical_sha256":"03eb7a9ecba75c949fc4e487f723e430fa5ef4f21836e5c4ed50c4abdefc4d7a","source":{"kind":"arxiv","id":"2510.27588","version":3},"attestation_state":"computed","paper":{"title":"Learned Static Function Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Giorgio Vinciguerra, Hans-Peter Lehmann, Stefan Hermann, Stefan Walzer","submitted_at":"2025-10-31T16:09:53Z","abstract_excerpt":"We consider the task of constructing a data structure for associating a static set of keys with values, while allowing arbitrary output values for queries involving keys outside the set. Compared to hash tables, these so-called static function data structures do not need to store the key set and thus use significantly less memory. Several techniques are known, with compressed static functions approaching the zero-order empirical entropy of the value sequence. In this paper, we introduce learned static functions, which use machine learning to capture correlations between keys and values. For ea"},"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":"2510.27588","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-10-31T16:09:53Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"4e8c9ba491f343fab7fa1c0f7ec2c18d11945fb5c49abe290d8379fe1af1e40a","abstract_canon_sha256":"23fd6a97b32e3262b6147f160bf75bee105ee23bd5760955981bd40b3ebc39df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:37.811153Z","signature_b64":"On2QePPUix3Gs4aML/6E+MQaDUSetYlw92yGD57IKPzLiWHyn8znRAxt6dMdRcBfLvWyzOqtoOSo1S4FIYVuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03eb7a9ecba75c949fc4e487f723e430fa5ef4f21836e5c4ed50c4abdefc4d7a","last_reissued_at":"2026-05-20T02:05:37.810369Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:37.810369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learned Static Function Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Giorgio Vinciguerra, Hans-Peter Lehmann, Stefan Hermann, Stefan Walzer","submitted_at":"2025-10-31T16:09:53Z","abstract_excerpt":"We consider the task of constructing a data structure for associating a static set of keys with values, while allowing arbitrary output values for queries involving keys outside the set. Compared to hash tables, these so-called static function data structures do not need to store the key set and thus use significantly less memory. Several techniques are known, with compressed static functions approaching the zero-order empirical entropy of the value sequence. In this paper, we introduce learned static functions, which use machine learning to capture correlations between keys and values. For ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.27588","kind":"arxiv","version":3},"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.27588/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.27588","created_at":"2026-05-20T02:05:37.810495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.27588v3","created_at":"2026-05-20T02:05:37.810495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27588","created_at":"2026-05-20T02:05:37.810495+00:00"},{"alias_kind":"pith_short_12","alias_value":"APVXVHWLU5OJ","created_at":"2026-05-20T02:05:37.810495+00:00"},{"alias_kind":"pith_short_16","alias_value":"APVXVHWLU5OJJH6E","created_at":"2026-05-20T02:05:37.810495+00:00"},{"alias_kind":"pith_short_8","alias_value":"APVXVHWL","created_at":"2026-05-20T02:05:37.810495+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/APVXVHWLU5OJJH6E4SD7OI7EGD","json":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD.json","graph_json":"https://pith.science/api/pith-number/APVXVHWLU5OJJH6E4SD7OI7EGD/graph.json","events_json":"https://pith.science/api/pith-number/APVXVHWLU5OJJH6E4SD7OI7EGD/events.json","paper":"https://pith.science/paper/APVXVHWL"},"agent_actions":{"view_html":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD","download_json":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD.json","view_paper":"https://pith.science/paper/APVXVHWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.27588&json=true","fetch_graph":"https://pith.science/api/pith-number/APVXVHWLU5OJJH6E4SD7OI7EGD/graph.json","fetch_events":"https://pith.science/api/pith-number/APVXVHWLU5OJJH6E4SD7OI7EGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD/action/storage_attestation","attest_author":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD/action/author_attestation","sign_citation":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD/action/citation_signature","submit_replication":"https://pith.science/pith/APVXVHWLU5OJJH6E4SD7OI7EGD/action/replication_record"}},"created_at":"2026-05-20T02:05:37.810495+00:00","updated_at":"2026-05-20T02:05:37.810495+00:00"}