{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ONLENPRYYPPMCYKS3VCGL65XY6","short_pith_number":"pith:ONLENPRY","canonical_record":{"source":{"id":"1903.00507","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-01T19:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"32a879eeafb2eee5b18db6e8dfe6617de5a12f2273c6151e2bd1e8f313976c18","abstract_canon_sha256":"a32fbfd7041d0a8174cda54ae4c45bfa3faecc49e95a68587852381ce5ec1ff0"},"schema_version":"1.0"},"canonical_sha256":"735646be38c3dec16152dd4465fbb7c7950dbc51710419a9697d1525eb06f34b","source":{"kind":"arxiv","id":"1903.00507","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00507","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00507v3","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00507","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"ONLENPRYYPPM","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ONLENPRYYPPMCYKS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ONLENPRY","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ONLENPRYYPPMCYKS3VCGL65XY6","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00507","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-01T19:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"32a879eeafb2eee5b18db6e8dfe6617de5a12f2273c6151e2bd1e8f313976c18","abstract_canon_sha256":"a32fbfd7041d0a8174cda54ae4c45bfa3faecc49e95a68587852381ce5ec1ff0"},"schema_version":"1.0"},"canonical_sha256":"735646be38c3dec16152dd4465fbb7c7950dbc51710419a9697d1525eb06f34b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.607607Z","signature_b64":"64kG6chrrBL6Dnk1HM5E9LNXQRd+qQu33tIFGpFwiyALTuyhjL2tUxlPb1Tk2i9kciNouxIx8m2ksom2vtZaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735646be38c3dec16152dd4465fbb7c7950dbc51710419a9697d1525eb06f34b","last_reissued_at":"2026-05-17T23:51:41.606998Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.606998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00507","source_version":3,"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-17T23:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R5BFVJHMKAxQv+I6HhqsKZEuRUe8gSIz1ETc6nQZXPJtuKbfsSIQ46b8iX0SliA7pi7BGA5d6scklHOLaoPlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:02:10.984702Z"},"content_sha256":"3315cd6679021cb79195eed03674b47798b302411b9eea0b9e1d2fa286d9ae6b","schema_version":"1.0","event_id":"sha256:3315cd6679021cb79195eed03674b47798b302411b9eea0b9e1d2fa286d9ae6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ONLENPRYYPPMCYKS3VCGL65XY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superseding traditional indexes by orchestrating learning and geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giorgio Vinciguerra, Michele Miccinesi, Paolo Ferragina","submitted_at":"2019-03-01T19:34:48Z","abstract_excerpt":"We design the first learned index that solves the dictionary problem with time and space complexity provably better than classic data structures for hierarchical memories, such as B-trees, and modern learned indexes. We call our solution the Piecewise Geometric Model index (PGM-index) because it turns the indexing of a sequence of keys into the coverage of a sequence of 2D-points via linear models (i.e. segments) suitably learned to trade query time vs space efficiency. This idea comes from some known heuristic results which we strengthen by showing that the minimal number of such segments can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00507","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":""},"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-17T23:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCGb+3KuNXfH8qZL36ZpEVnVuV9BrFSjA2dWDHE2Co8uR3XDlh42ITuISVuyEOh+nWofFijafit1AxpboONBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:02:10.985045Z"},"content_sha256":"fb6cd4de7a3e344b5c546944f5423306e769af96e73a32c53991a8b703a54d9e","schema_version":"1.0","event_id":"sha256:fb6cd4de7a3e344b5c546944f5423306e769af96e73a32c53991a8b703a54d9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONLENPRYYPPMCYKS3VCGL65XY6/bundle.json","state_url":"https://pith.science/pith/ONLENPRYYPPMCYKS3VCGL65XY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONLENPRYYPPMCYKS3VCGL65XY6/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-26T20:02:10Z","links":{"resolver":"https://pith.science/pith/ONLENPRYYPPMCYKS3VCGL65XY6","bundle":"https://pith.science/pith/ONLENPRYYPPMCYKS3VCGL65XY6/bundle.json","state":"https://pith.science/pith/ONLENPRYYPPMCYKS3VCGL65XY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONLENPRYYPPMCYKS3VCGL65XY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ONLENPRYYPPMCYKS3VCGL65XY6","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":"a32fbfd7041d0a8174cda54ae4c45bfa3faecc49e95a68587852381ce5ec1ff0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-01T19:34:48Z","title_canon_sha256":"32a879eeafb2eee5b18db6e8dfe6617de5a12f2273c6151e2bd1e8f313976c18"},"schema_version":"1.0","source":{"id":"1903.00507","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00507","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00507v3","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00507","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"ONLENPRYYPPM","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ONLENPRYYPPMCYKS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ONLENPRY","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:fb6cd4de7a3e344b5c546944f5423306e769af96e73a32c53991a8b703a54d9e","target":"graph","created_at":"2026-05-17T23:51:41Z","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":"We design the first learned index that solves the dictionary problem with time and space complexity provably better than classic data structures for hierarchical memories, such as B-trees, and modern learned indexes. We call our solution the Piecewise Geometric Model index (PGM-index) because it turns the indexing of a sequence of keys into the coverage of a sequence of 2D-points via linear models (i.e. segments) suitably learned to trade query time vs space efficiency. This idea comes from some known heuristic results which we strengthen by showing that the minimal number of such segments can","authors_text":"Giorgio Vinciguerra, Michele Miccinesi, Paolo Ferragina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-01T19:34:48Z","title":"Superseding traditional indexes by orchestrating learning and geometry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00507","kind":"arxiv","version":3},"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:3315cd6679021cb79195eed03674b47798b302411b9eea0b9e1d2fa286d9ae6b","target":"record","created_at":"2026-05-17T23:51:41Z","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":"a32fbfd7041d0a8174cda54ae4c45bfa3faecc49e95a68587852381ce5ec1ff0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-01T19:34:48Z","title_canon_sha256":"32a879eeafb2eee5b18db6e8dfe6617de5a12f2273c6151e2bd1e8f313976c18"},"schema_version":"1.0","source":{"id":"1903.00507","kind":"arxiv","version":3}},"canonical_sha256":"735646be38c3dec16152dd4465fbb7c7950dbc51710419a9697d1525eb06f34b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"735646be38c3dec16152dd4465fbb7c7950dbc51710419a9697d1525eb06f34b","first_computed_at":"2026-05-17T23:51:41.606998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:41.606998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"64kG6chrrBL6Dnk1HM5E9LNXQRd+qQu33tIFGpFwiyALTuyhjL2tUxlPb1Tk2i9kciNouxIx8m2ksom2vtZaCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:41.607607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00507","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3315cd6679021cb79195eed03674b47798b302411b9eea0b9e1d2fa286d9ae6b","sha256:fb6cd4de7a3e344b5c546944f5423306e769af96e73a32c53991a8b703a54d9e"],"state_sha256":"6f9621cfa58dcb9bdfd7d9268c87494608e4ffd3858685670745af403d0dce3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtU2B8wwRHaD9THmS/K4RxBox+IXdE2sI3cU4bn97ApOqASrl7tU8NlZucfTNH6MgY5pB9UntSiQbpoIoMwOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:02:10.987017Z","bundle_sha256":"6dc4e897e0e4397de8ed25a271a88190be3495036c13c73b9a9870bb8566bc07"}}