{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FU3WYA2I2QQ34U2LTWMBAMXFEV","short_pith_number":"pith:FU3WYA2I","schema_version":"1.0","canonical_sha256":"2d376c0348d421be534b9d981032e5257079be65c74c2beaa267dbdef3422de1","source":{"kind":"arxiv","id":"1209.5441","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.5441","created_at":"2026-05-18T03:44:48.523277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5441v1","created_at":"2026-05-18T03:44:48.523277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5441","created_at":"2026-05-18T03:44:48.523277+00:00"},{"alias_kind":"pith_short_12","alias_value":"FU3WYA2I2QQ3","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FU3WYA2I2QQ34U2L","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FU3WYA2I","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.10864","citing_title":"Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV","json":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV.json","graph_json":"https://pith.science/api/pith-number/FU3WYA2I2QQ34U2LTWMBAMXFEV/graph.json","events_json":"https://pith.science/api/pith-number/FU3WYA2I2QQ34U2LTWMBAMXFEV/events.json","paper":"https://pith.science/paper/FU3WYA2I"},"agent_actions":{"view_html":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV","download_json":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV.json","view_paper":"https://pith.science/paper/FU3WYA2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5441&json=true","fetch_graph":"https://pith.science/api/pith-number/FU3WYA2I2QQ34U2LTWMBAMXFEV/graph.json","fetch_events":"https://pith.science/api/pith-number/FU3WYA2I2QQ34U2LTWMBAMXFEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/action/storage_attestation","attest_author":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/action/author_attestation","sign_citation":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/action/citation_signature","submit_replication":"https://pith.science/pith/FU3WYA2I2QQ34U2LTWMBAMXFEV/action/replication_record"}},"created_at":"2026-05-18T03:44:48.523277+00:00","updated_at":"2026-05-18T03:44:48.523277+00:00"}