{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FU3WYA2I2QQ34U2LTWMBAMXFEV","short_pith_number":"pith:FU3WYA2I","canonical_record":{"source":{"id":"1209.5441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-24T21:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"3d537db0e92cd8b02c47cf0e8ad07c3cabcb9125976a721c767869b79633064e","abstract_canon_sha256":"95c62115a43ac0e15ab0eea653d0b07fef0b59eadb45c474757aa4757a1c6aa2"},"schema_version":"1.0"},"canonical_sha256":"2d376c0348d421be534b9d981032e5257079be65c74c2beaa267dbdef3422de1","source":{"kind":"arxiv","id":"1209.5441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5441","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5441v1","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5441","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"FU3WYA2I2QQ3","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FU3WYA2I2QQ34U2L","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FU3WYA2I","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FU3WYA2I2QQ34U2LTWMBAMXFEV","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-24T21:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"3d537db0e92cd8b02c47cf0e8ad07c3cabcb9125976a721c767869b79633064e","abstract_canon_sha256":"95c62115a43ac0e15ab0eea653d0b07fef0b59eadb45c474757aa4757a1c6aa2"},"schema_version":"1.0"},"canonical_sha256":"2d376c0348d421be534b9d981032e5257079be65c74c2beaa267dbdef3422de1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:48.523910Z","signature_b64":"1GuN/smJlJGVR57SeiyYJTu7c/H/L7j7+5A6z7Ul9X+/jJqpRbr58uHzd59czDTYiaWjzZI59rXwnnC0B/VDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d376c0348d421be534b9d981032e5257079be65c74c2beaa267dbdef3422de1","last_reissued_at":"2026-05-18T03:44:48.523148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:48.523148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5441","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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mFYyuW4LVQe70UnwWUc10cjGxq5JEXimfyJL3pnbZ9XJMseO2LABcgXYYyECcNGo3l6Lb+Dz2KF3BO0g7r0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:02:21.006914Z"},"content_sha256":"251407f2d2a82ce329e74817084747af69593e6a0074493640d3a9b549967f9e","schema_version":"1.0","event_id":"sha256:251407f2d2a82ce329e74817084747af69593e6a0074493640d3a9b549967f9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FU3WYA2I2QQ34U2LTWMBAMXFEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predecessor search with distance-sensitive query time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna","submitted_at":"2012-09-24T21:57:39Z","abstract_excerpt":"A predecessor (successor) search finds the largest element $x^-$ smaller than the input string $x$ (the smallest element $x^+$ larger than or equal to $x$, respectively) out of a given set $S$; in this paper, we consider the static case (i.e., $S$ is fixed and does not change over time) and assume that the $n$ elements of $S$ are available for inspection. We present a number of algorithms that, with a small additional index (usually of O(n log w) bits, where $w$ is the string length), can answer predecessor/successor queries quickly and with time bounds that depend on different kinds of distan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5441","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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znvpee5XxFoUIIWvPyvXOFAnuRhXEMO93a/HqXx5njRU/9bY4apdVx9dmDlXP1ESFZgLTRzHPvPQy+6KCLNrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:02:21.007261Z"},"content_sha256":"474d4240e3a20be4787d12b1934276155d7a5afb438938dac3448844e5de5f61","schema_version":"1.0","event_id":"sha256:474d4240e3a20be4787d12b1934276155d7a5afb438938dac3448844e5de5f61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/bundle.json","state_url":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/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-21T23:02:21Z","links":{"resolver":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV","bundle":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/bundle.json","state":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FU3WYA2I2QQ34U2LTWMBAMXFEV","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":"95c62115a43ac0e15ab0eea653d0b07fef0b59eadb45c474757aa4757a1c6aa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-24T21:57:39Z","title_canon_sha256":"3d537db0e92cd8b02c47cf0e8ad07c3cabcb9125976a721c767869b79633064e"},"schema_version":"1.0","source":{"id":"1209.5441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5441","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5441v1","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5441","created_at":"2026-05-18T03:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"FU3WYA2I2QQ3","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FU3WYA2I2QQ34U2L","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FU3WYA2I","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:474d4240e3a20be4787d12b1934276155d7a5afb438938dac3448844e5de5f61","target":"graph","created_at":"2026-05-18T03:44:48Z","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":"A predecessor (successor) search finds the largest element $x^-$ smaller than the input string $x$ (the smallest element $x^+$ larger than or equal to $x$, respectively) out of a given set $S$; in this paper, we consider the static case (i.e., $S$ is fixed and does not change over time) and assume that the $n$ elements of $S$ are available for inspection. We present a number of algorithms that, with a small additional index (usually of O(n log w) bits, where $w$ is the string length), can answer predecessor/successor queries quickly and with time bounds that depend on different kinds of distan","authors_text":"Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-24T21:57:39Z","title":"Predecessor search with distance-sensitive query time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5441","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:251407f2d2a82ce329e74817084747af69593e6a0074493640d3a9b549967f9e","target":"record","created_at":"2026-05-18T03:44:48Z","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":"95c62115a43ac0e15ab0eea653d0b07fef0b59eadb45c474757aa4757a1c6aa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-24T21:57:39Z","title_canon_sha256":"3d537db0e92cd8b02c47cf0e8ad07c3cabcb9125976a721c767869b79633064e"},"schema_version":"1.0","source":{"id":"1209.5441","kind":"arxiv","version":1}},"canonical_sha256":"2d376c0348d421be534b9d981032e5257079be65c74c2beaa267dbdef3422de1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d376c0348d421be534b9d981032e5257079be65c74c2beaa267dbdef3422de1","first_computed_at":"2026-05-18T03:44:48.523148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:48.523148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GuN/smJlJGVR57SeiyYJTu7c/H/L7j7+5A6z7Ul9X+/jJqpRbr58uHzd59czDTYiaWjzZI59rXwnnC0B/VDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:48.523910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:251407f2d2a82ce329e74817084747af69593e6a0074493640d3a9b549967f9e","sha256:474d4240e3a20be4787d12b1934276155d7a5afb438938dac3448844e5de5f61"],"state_sha256":"b1d3321cedf2ddaebc6db68fac864fb7dcafe85e5124c7f983b6f180ee09a42a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nd+gUqFqnIUYQbXW3+v6ONfmhPHSj8XLQelErD/B8oQ2buFoRcCx0Yeb1mqCWkySmdL9uhLTJT9ZQy8NUzvgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:02:21.009470Z","bundle_sha256":"e17656e1eed4f8b2f8fd426917d0db27b5eda032c1e9ebb13868f8bab11d3ccd"}}