{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DXRGQPGGC2MFGXCIRHI4Y4XV2U","short_pith_number":"pith:DXRGQPGG","canonical_record":{"source":{"id":"1306.0406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-03T13:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"9158ce6e64f5cd3a75bd1b81a38d58c0db21f5763e4210f5c1b13dc243bda3f6","abstract_canon_sha256":"3cd2b637006c2de4b41a746b18739f4a67bca19d738feef612eed7e597c43d18"},"schema_version":"1.0"},"canonical_sha256":"1de2683cc61698535c4889d1cc72f5d512b78e18aa39b60a3ae2560f2579cd77","source":{"kind":"arxiv","id":"1306.0406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0406","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0406v1","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0406","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"DXRGQPGGC2MF","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DXRGQPGGC2MFGXCI","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DXRGQPGG","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DXRGQPGGC2MFGXCIRHI4Y4XV2U","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-03T13:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"9158ce6e64f5cd3a75bd1b81a38d58c0db21f5763e4210f5c1b13dc243bda3f6","abstract_canon_sha256":"3cd2b637006c2de4b41a746b18739f4a67bca19d738feef612eed7e597c43d18"},"schema_version":"1.0"},"canonical_sha256":"1de2683cc61698535c4889d1cc72f5d512b78e18aa39b60a3ae2560f2579cd77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:55.339395Z","signature_b64":"ixsymhMZkWX9Rm/SmoAwx54Gn3ejQ35UJlNEoJ/WjHzjR+S50B0/dzeZo41gndTi1B0V1cTnJdNVd1cq4pRHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de2683cc61698535c4889d1cc72f5d512b78e18aa39b60a3ae2560f2579cd77","last_reissued_at":"2026-05-18T03:21:55.338880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:55.338880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0406","source_version":1,"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-18T03:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfL2A6pYRrXq3k9j25ju5M5D9zZA85IsINSiJt77Jzbiep8IpFm6256gbIorpINIQmcrVtHS1iOat9JsmN1NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:31:54.567547Z"},"content_sha256":"5f024089b8959c9127c300024837f7f99d8491b34dffd1520dbec7f7d7489d43","schema_version":"1.0","event_id":"sha256:5f024089b8959c9127c300024837f7f99d8491b34dffd1520dbec7f7d7489d43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DXRGQPGGC2MFGXCIRHI4Y4XV2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amihood Amir, Gianni Franceschini, Moshe Lewenstein, Noa Lewenstein, Roberto Grossi, Tsvi Kopelowitz","submitted_at":"2013-06-03T13:53:29Z","abstract_excerpt":"This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not a constant. Examples of these keys are strings, multi-dimensional points, multiple-precision numbers, multi-key data (e.g.~records), XML paths, URL addresses, etc. The technique is more general than what has been done in previous work as no particular exploitation of the underlying structure of is required. The only requirement is that the ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0406","kind":"arxiv","version":1},"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-18T03:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3n/SAa+LlDnBEL5tMiDu2dVapg790LQR+LN8SCiLL/wBz42CjUC1tHptH3Hwfx1YQMZJ1PXq/uGvHvSi0QvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:31:54.568265Z"},"content_sha256":"7b95b8415f04d4a44b37d58e687c6824011b64f9563057165a597c1f124d4ab9","schema_version":"1.0","event_id":"sha256:7b95b8415f04d4a44b37d58e687c6824011b64f9563057165a597c1f124d4ab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U/bundle.json","state_url":"https://pith.science/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U/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-05-24T13:31:54Z","links":{"resolver":"https://pith.science/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U","bundle":"https://pith.science/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U/bundle.json","state":"https://pith.science/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXRGQPGGC2MFGXCIRHI4Y4XV2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DXRGQPGGC2MFGXCIRHI4Y4XV2U","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":"3cd2b637006c2de4b41a746b18739f4a67bca19d738feef612eed7e597c43d18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-03T13:53:29Z","title_canon_sha256":"9158ce6e64f5cd3a75bd1b81a38d58c0db21f5763e4210f5c1b13dc243bda3f6"},"schema_version":"1.0","source":{"id":"1306.0406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0406","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0406v1","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0406","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"DXRGQPGGC2MF","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DXRGQPGGC2MFGXCI","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DXRGQPGG","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:7b95b8415f04d4a44b37d58e687c6824011b64f9563057165a597c1f124d4ab9","target":"graph","created_at":"2026-05-18T03:21:55Z","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":"This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not a constant. Examples of these keys are strings, multi-dimensional points, multiple-precision numbers, multi-key data (e.g.~records), XML paths, URL addresses, etc. The technique is more general than what has been done in previous work as no particular exploitation of the underlying structure of is required. The only requirement is that the ins","authors_text":"Amihood Amir, Gianni Franceschini, Moshe Lewenstein, Noa Lewenstein, Roberto Grossi, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-03T13:53:29Z","title":"Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0406","kind":"arxiv","version":1},"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:5f024089b8959c9127c300024837f7f99d8491b34dffd1520dbec7f7d7489d43","target":"record","created_at":"2026-05-18T03:21:55Z","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":"3cd2b637006c2de4b41a746b18739f4a67bca19d738feef612eed7e597c43d18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-03T13:53:29Z","title_canon_sha256":"9158ce6e64f5cd3a75bd1b81a38d58c0db21f5763e4210f5c1b13dc243bda3f6"},"schema_version":"1.0","source":{"id":"1306.0406","kind":"arxiv","version":1}},"canonical_sha256":"1de2683cc61698535c4889d1cc72f5d512b78e18aa39b60a3ae2560f2579cd77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de2683cc61698535c4889d1cc72f5d512b78e18aa39b60a3ae2560f2579cd77","first_computed_at":"2026-05-18T03:21:55.338880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:55.338880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ixsymhMZkWX9Rm/SmoAwx54Gn3ejQ35UJlNEoJ/WjHzjR+S50B0/dzeZo41gndTi1B0V1cTnJdNVd1cq4pRHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:55.339395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f024089b8959c9127c300024837f7f99d8491b34dffd1520dbec7f7d7489d43","sha256:7b95b8415f04d4a44b37d58e687c6824011b64f9563057165a597c1f124d4ab9"],"state_sha256":"a39d8fc7bd6d3607a6afc0a1adcb760675d4db3aca1fb7b030d4301f21947245"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Tf7l2tF0LZCs8BTskVqA4k57gzrlIlrsuI3f2gQpuXl8E9LJHg/ZVhrrFHUum6VNZoITsufzPPiCHkJOUlqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T13:31:54.573730Z","bundle_sha256":"33f693893071f9020f027c28dd0749a7c4dccfb9c0b00eabbf1e4157050b5f24"}}