{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VPVI4WYQAXSYUOVNNVYKCOGNSJ","short_pith_number":"pith:VPVI4WYQ","schema_version":"1.0","canonical_sha256":"abea8e5b1005e58a3aad6d70a138cd924e1c8fa828bca21cd1ca2566b231c080","source":{"kind":"arxiv","id":"2110.08106","version":1},"attestation_state":"computed","paper":{"title":"Compact representation for matrices of bounded twin-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Marek Soko{\\l}owski, Micha{\\l} Pilipczuk","submitted_at":"2021-10-15T14:07:39Z","abstract_excerpt":"For every fixed $d \\in \\mathbb{N}$, we design a data structure that represents a binary $n \\times n$ matrix that is $d$-twin-ordered. The data structure occupies $O_d(n)$ bits, which is the least one could hope for, and can be queried for entries of the matrix in time $O_d(\\log \\log n)$ per query."},"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":"2110.08106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-15T14:07:39Z","cross_cats_sorted":[],"title_canon_sha256":"65cfec372f7769388a724de48abfac2cb6966913fbe85262d6848caa6f6073dd","abstract_canon_sha256":"e2fc0410b14d126b48d09ac98d24cb656074e9f06e7c83cbf974fcc9e3cad561"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:00.577622Z","signature_b64":"FGWS2vRVPQjgVOQP0UXtezLJrOjdT9JGumz5h8UTyIWRww9ak+oQSHntS3YjEEFL6ik5+pE6ICY339s9e+c0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abea8e5b1005e58a3aad6d70a138cd924e1c8fa828bca21cd1ca2566b231c080","last_reissued_at":"2026-07-05T03:23:00.577104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:00.577104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact representation for matrices of bounded twin-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Marek Soko{\\l}owski, Micha{\\l} Pilipczuk","submitted_at":"2021-10-15T14:07:39Z","abstract_excerpt":"For every fixed $d \\in \\mathbb{N}$, we design a data structure that represents a binary $n \\times n$ matrix that is $d$-twin-ordered. The data structure occupies $O_d(n)$ bits, which is the least one could hope for, and can be queried for entries of the matrix in time $O_d(\\log \\log n)$ per query."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08106","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/2110.08106/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":"2110.08106","created_at":"2026-07-05T03:23:00.577168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08106v1","created_at":"2026-07-05T03:23:00.577168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08106","created_at":"2026-07-05T03:23:00.577168+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPVI4WYQAXSY","created_at":"2026-07-05T03:23:00.577168+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPVI4WYQAXSYUOVN","created_at":"2026-07-05T03:23:00.577168+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPVI4WYQ","created_at":"2026-07-05T03:23:00.577168+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/VPVI4WYQAXSYUOVNNVYKCOGNSJ","json":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ.json","graph_json":"https://pith.science/api/pith-number/VPVI4WYQAXSYUOVNNVYKCOGNSJ/graph.json","events_json":"https://pith.science/api/pith-number/VPVI4WYQAXSYUOVNNVYKCOGNSJ/events.json","paper":"https://pith.science/paper/VPVI4WYQ"},"agent_actions":{"view_html":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ","download_json":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ.json","view_paper":"https://pith.science/paper/VPVI4WYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08106&json=true","fetch_graph":"https://pith.science/api/pith-number/VPVI4WYQAXSYUOVNNVYKCOGNSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VPVI4WYQAXSYUOVNNVYKCOGNSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ/action/storage_attestation","attest_author":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ/action/author_attestation","sign_citation":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ/action/citation_signature","submit_replication":"https://pith.science/pith/VPVI4WYQAXSYUOVNNVYKCOGNSJ/action/replication_record"}},"created_at":"2026-07-05T03:23:00.577168+00:00","updated_at":"2026-07-05T03:23:00.577168+00:00"}