{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QB3B4SD4YSOXLJCVPPTTJUFFQF","short_pith_number":"pith:QB3B4SD4","schema_version":"1.0","canonical_sha256":"80761e487cc49d75a4557be734d0a5815ff8f34af9ac5c6de05b593623e471ca","source":{"kind":"arxiv","id":"2311.16957","version":1},"attestation_state":"computed","paper":{"title":"Space-Efficient Data Structures for Polyominoes and Bar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cooper Sigrist, Katherine Ling, Magnus Berg, Shahin Kamali","submitted_at":"2023-11-28T17:04:27Z","abstract_excerpt":"We provide a compact data structure for representing polyominoes that supports neighborhood and visibility queries. Neighborhood queries concern reporting adjacent cells to a given cell, and visibility queries determine whether a straight line can be drawn within the polyomino that connects two specified cells. For an arbitrary small $\\epsilon >0$, our data structure can encode a polyomino with $n$ cells in $(3+\\epsilon)n + o(n)$ bits while supporting all queries in constant time. The space complexity can be improved to $3n+o(n)$, while supporting neighborhood queries in $\\mathcal{O}(1)$ and v"},"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":"2311.16957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-28T17:04:27Z","cross_cats_sorted":[],"title_canon_sha256":"9d678bcbe0e187fca9ffec5858a58900ecd45041cc74dab68fe4a59b6ffae3bd","abstract_canon_sha256":"59f79fc31f36f3f5458d92d77226563e08e49547047ae4bf9ecbebfcce068228"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:48.868861Z","signature_b64":"8yZffn9zJDkm/KomP910W46nwwRmNTO4EhVQS6ViP+DZtFHuOeQgwMwfLnDMdbgARtHQ/o9umxtWjx5pcdU3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80761e487cc49d75a4557be734d0a5815ff8f34af9ac5c6de05b593623e471ca","last_reissued_at":"2026-07-05T07:17:48.868184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:48.868184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Data Structures for Polyominoes and Bar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cooper Sigrist, Katherine Ling, Magnus Berg, Shahin Kamali","submitted_at":"2023-11-28T17:04:27Z","abstract_excerpt":"We provide a compact data structure for representing polyominoes that supports neighborhood and visibility queries. Neighborhood queries concern reporting adjacent cells to a given cell, and visibility queries determine whether a straight line can be drawn within the polyomino that connects two specified cells. For an arbitrary small $\\epsilon >0$, our data structure can encode a polyomino with $n$ cells in $(3+\\epsilon)n + o(n)$ bits while supporting all queries in constant time. The space complexity can be improved to $3n+o(n)$, while supporting neighborhood queries in $\\mathcal{O}(1)$ and v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16957","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/2311.16957/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":"2311.16957","created_at":"2026-07-05T07:17:48.868235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16957v1","created_at":"2026-07-05T07:17:48.868235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16957","created_at":"2026-07-05T07:17:48.868235+00:00"},{"alias_kind":"pith_short_12","alias_value":"QB3B4SD4YSOX","created_at":"2026-07-05T07:17:48.868235+00:00"},{"alias_kind":"pith_short_16","alias_value":"QB3B4SD4YSOXLJCV","created_at":"2026-07-05T07:17:48.868235+00:00"},{"alias_kind":"pith_short_8","alias_value":"QB3B4SD4","created_at":"2026-07-05T07:17:48.868235+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/QB3B4SD4YSOXLJCVPPTTJUFFQF","json":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF.json","graph_json":"https://pith.science/api/pith-number/QB3B4SD4YSOXLJCVPPTTJUFFQF/graph.json","events_json":"https://pith.science/api/pith-number/QB3B4SD4YSOXLJCVPPTTJUFFQF/events.json","paper":"https://pith.science/paper/QB3B4SD4"},"agent_actions":{"view_html":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF","download_json":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF.json","view_paper":"https://pith.science/paper/QB3B4SD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16957&json=true","fetch_graph":"https://pith.science/api/pith-number/QB3B4SD4YSOXLJCVPPTTJUFFQF/graph.json","fetch_events":"https://pith.science/api/pith-number/QB3B4SD4YSOXLJCVPPTTJUFFQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF/action/storage_attestation","attest_author":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF/action/author_attestation","sign_citation":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF/action/citation_signature","submit_replication":"https://pith.science/pith/QB3B4SD4YSOXLJCVPPTTJUFFQF/action/replication_record"}},"created_at":"2026-07-05T07:17:48.868235+00:00","updated_at":"2026-07-05T07:17:48.868235+00:00"}