{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AHLVTHEZBI2OLPDI7LYAIQMYZV","short_pith_number":"pith:AHLVTHEZ","canonical_record":{"source":{"id":"2411.03253","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-05T16:50:54Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"f83883e4a6bfa12c581f4821060f3d74eb98cc0fd5a90c0ea6d8a77162d186cc","abstract_canon_sha256":"64ecb7df3ab75a315f177a95bde7247d643afef4f80f4f3c0d79e98a6916a25c"},"schema_version":"1.0"},"canonical_sha256":"01d7599c990a34e5bc68faf0044198cd7d7981397359d0b440a1e6f5663cabee","source":{"kind":"arxiv","id":"2411.03253","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03253","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03253v2","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03253","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"AHLVTHEZBI2O","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"AHLVTHEZBI2OLPDI","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"AHLVTHEZ","created_at":"2026-06-09T01:05:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AHLVTHEZBI2OLPDI7LYAIQMYZV","target":"record","payload":{"canonical_record":{"source":{"id":"2411.03253","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-05T16:50:54Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"f83883e4a6bfa12c581f4821060f3d74eb98cc0fd5a90c0ea6d8a77162d186cc","abstract_canon_sha256":"64ecb7df3ab75a315f177a95bde7247d643afef4f80f4f3c0d79e98a6916a25c"},"schema_version":"1.0"},"canonical_sha256":"01d7599c990a34e5bc68faf0044198cd7d7981397359d0b440a1e6f5663cabee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:04.067143Z","signature_b64":"ySH5G6Vn1GezihVDPbmoGnFjEP/Q6vrYDi+FNX+3WmZ9TgmTgzkIKntfZhCUSS61/Ld1r44JPg7SeI2QUc9ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d7599c990a34e5bc68faf0044198cd7d7981397359d0b440a1e6f5663cabee","last_reissued_at":"2026-06-09T01:05:04.066596Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:04.066596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.03253","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-06-09T01:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vULOtjtGhCaeRm9yHKw9sHXGPdBPXW/gRiIiI9y3bhr2SBBAAos2ppDutUJFS86f1LLReYhsg9YOz+9cy+3GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:50:49.448540Z"},"content_sha256":"4770e0c832b3820bd06901d73bed835752c87dde00ea2efb9522e26225f84dfc","schema_version":"1.0","event_id":"sha256:4770e0c832b3820bd06901d73bed835752c87dde00ea2efb9522e26225f84dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AHLVTHEZBI2OLPDI7LYAIQMYZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Data Structures: Nearest Neighbor Search and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Gregory Valiant, Laurent Charlin, Omar Salemohamed, Shivam Garg, Vatsal Sharan","submitted_at":"2024-11-05T16:50:54Z","abstract_excerpt":"We propose a general framework for end-to-end learning of data structures. Our framework adapts to the underlying data distribution and provides fine-grained control over query and space complexity. Crucially, the data structure is learned from scratch, and does not require careful initialization or seeding with candidate data structures/algorithms. We first apply this framework to the problem of nearest neighbor search. In several settings, we are able to reverse-engineer the learned data structures and query algorithms. For 1D nearest neighbor search, the model discovers optimal distribution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03253","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.03253/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"},"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-06-09T01:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B9H5BxoY/vzaf0JLkBTxIIGYBlUMI/8c5we2dqTL9hxXl/XQQxI/GLb/lBLaRyM5Z37CoekPkM1971IJsyHoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:50:49.448906Z"},"content_sha256":"b483a251f1d3c7c9685c93060cd77d8d8580f75d8ada3817170e8c5ebc17bc71","schema_version":"1.0","event_id":"sha256:b483a251f1d3c7c9685c93060cd77d8d8580f75d8ada3817170e8c5ebc17bc71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV/bundle.json","state_url":"https://pith.science/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV/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-28T12:50:49Z","links":{"resolver":"https://pith.science/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV","bundle":"https://pith.science/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV/bundle.json","state":"https://pith.science/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHLVTHEZBI2OLPDI7LYAIQMYZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AHLVTHEZBI2OLPDI7LYAIQMYZV","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":"64ecb7df3ab75a315f177a95bde7247d643afef4f80f4f3c0d79e98a6916a25c","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-05T16:50:54Z","title_canon_sha256":"f83883e4a6bfa12c581f4821060f3d74eb98cc0fd5a90c0ea6d8a77162d186cc"},"schema_version":"1.0","source":{"id":"2411.03253","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03253","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03253v2","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03253","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"AHLVTHEZBI2O","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"AHLVTHEZBI2OLPDI","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"AHLVTHEZ","created_at":"2026-06-09T01:05:04Z"}],"graph_snapshots":[{"event_id":"sha256:b483a251f1d3c7c9685c93060cd77d8d8580f75d8ada3817170e8c5ebc17bc71","target":"graph","created_at":"2026-06-09T01:05:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.03253/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a general framework for end-to-end learning of data structures. Our framework adapts to the underlying data distribution and provides fine-grained control over query and space complexity. Crucially, the data structure is learned from scratch, and does not require careful initialization or seeding with candidate data structures/algorithms. We first apply this framework to the problem of nearest neighbor search. In several settings, we are able to reverse-engineer the learned data structures and query algorithms. For 1D nearest neighbor search, the model discovers optimal distribution","authors_text":"Gregory Valiant, Laurent Charlin, Omar Salemohamed, Shivam Garg, Vatsal Sharan","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-05T16:50:54Z","title":"Discovering Data Structures: Nearest Neighbor Search and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03253","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:4770e0c832b3820bd06901d73bed835752c87dde00ea2efb9522e26225f84dfc","target":"record","created_at":"2026-06-09T01:05:04Z","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":"64ecb7df3ab75a315f177a95bde7247d643afef4f80f4f3c0d79e98a6916a25c","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-05T16:50:54Z","title_canon_sha256":"f83883e4a6bfa12c581f4821060f3d74eb98cc0fd5a90c0ea6d8a77162d186cc"},"schema_version":"1.0","source":{"id":"2411.03253","kind":"arxiv","version":2}},"canonical_sha256":"01d7599c990a34e5bc68faf0044198cd7d7981397359d0b440a1e6f5663cabee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d7599c990a34e5bc68faf0044198cd7d7981397359d0b440a1e6f5663cabee","first_computed_at":"2026-06-09T01:05:04.066596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:04.066596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ySH5G6Vn1GezihVDPbmoGnFjEP/Q6vrYDi+FNX+3WmZ9TgmTgzkIKntfZhCUSS61/Ld1r44JPg7SeI2QUc9ODQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:04.067143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03253","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4770e0c832b3820bd06901d73bed835752c87dde00ea2efb9522e26225f84dfc","sha256:b483a251f1d3c7c9685c93060cd77d8d8580f75d8ada3817170e8c5ebc17bc71"],"state_sha256":"3c61f5a5b38b6d5a2c4b6a5d2c321ecbb4dd2b3147785a170d8f7a163d63cf58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxSC7/OC0UQl/++3zuL14ll2bW4C0CapLtd3tfiTnuzUX4fvVCFQiK3yOh7b88Pr4+VkcARXbuJ5w6bUNoI9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:50:49.450783Z","bundle_sha256":"01a57240c50dd1861696e6d05a0e89b3238322363159c1faac5424221e53676e"}}