{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RJ2QI2ZONLEWP4YASVIDP6TUXT","short_pith_number":"pith:RJ2QI2ZO","schema_version":"1.0","canonical_sha256":"8a75046b2e6ac967f300955037fa74bccbeec7c4f2ac549c9d0ca6eaab6c3636","source":{"kind":"arxiv","id":"2412.04965","version":1},"attestation_state":"computed","paper":{"title":"Succinct Data Structures for Segments","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Philip Bille, Simon R. Tarnow","submitted_at":"2024-12-06T11:32:56Z","abstract_excerpt":"We consider succinct data structures for representing a set of $n$ horizontal line segments in the plane given in rank space to support \\emph{segment access}, \\emph{segment selection}, and \\emph{segment rank} queries. A segment access query finds the segment $(x_1, x_2, y)$ given its $y$-coordinate ($y$-coordinates of the segments are distinct), a segment selection query finds the $j$th smallest segment (the segment with the $j$th smallest $y$-coordinate) among the segments crossing the vertical line for a given $x$-coordinate, and a segment rank query finds the number of segments crossing the"},"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":"2412.04965","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-06T11:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"c55abe77dc9aec25062e3fbed64f333848523eeae3d0c445902d3328f927c033","abstract_canon_sha256":"e9f278279de773e1b7b16eaea479ac65e5a412dfe7766dfc64e5332231db832b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:26.698498Z","signature_b64":"l9gn+4J9sx6L6h+3+8LqAymcpvIwZyPjaYy3zbJqOasodALnJT00roIYHg5DaegP7mRVCh/OskXRjEBilDSqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a75046b2e6ac967f300955037fa74bccbeec7c4f2ac549c9d0ca6eaab6c3636","last_reissued_at":"2026-07-05T09:45:26.698068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:26.698068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct Data Structures for Segments","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Philip Bille, Simon R. Tarnow","submitted_at":"2024-12-06T11:32:56Z","abstract_excerpt":"We consider succinct data structures for representing a set of $n$ horizontal line segments in the plane given in rank space to support \\emph{segment access}, \\emph{segment selection}, and \\emph{segment rank} queries. A segment access query finds the segment $(x_1, x_2, y)$ given its $y$-coordinate ($y$-coordinates of the segments are distinct), a segment selection query finds the $j$th smallest segment (the segment with the $j$th smallest $y$-coordinate) among the segments crossing the vertical line for a given $x$-coordinate, and a segment rank query finds the number of segments crossing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04965","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.04965/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.04965","created_at":"2026-07-05T09:45:26.698133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04965v1","created_at":"2026-07-05T09:45:26.698133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04965","created_at":"2026-07-05T09:45:26.698133+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJ2QI2ZONLEW","created_at":"2026-07-05T09:45:26.698133+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJ2QI2ZONLEWP4YA","created_at":"2026-07-05T09:45:26.698133+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJ2QI2ZO","created_at":"2026-07-05T09:45:26.698133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT","json":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT.json","graph_json":"https://pith.science/api/pith-number/RJ2QI2ZONLEWP4YASVIDP6TUXT/graph.json","events_json":"https://pith.science/api/pith-number/RJ2QI2ZONLEWP4YASVIDP6TUXT/events.json","paper":"https://pith.science/paper/RJ2QI2ZO"},"agent_actions":{"view_html":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT","download_json":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT.json","view_paper":"https://pith.science/paper/RJ2QI2ZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04965&json=true","fetch_graph":"https://pith.science/api/pith-number/RJ2QI2ZONLEWP4YASVIDP6TUXT/graph.json","fetch_events":"https://pith.science/api/pith-number/RJ2QI2ZONLEWP4YASVIDP6TUXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT/action/storage_attestation","attest_author":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT/action/author_attestation","sign_citation":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT/action/citation_signature","submit_replication":"https://pith.science/pith/RJ2QI2ZONLEWP4YASVIDP6TUXT/action/replication_record"}},"created_at":"2026-07-05T09:45:26.698133+00:00","updated_at":"2026-07-05T09:45:26.698133+00:00"}