{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YKMXFBMQDXQAMKWOCBZ4O2KQOT","short_pith_number":"pith:YKMXFBMQ","schema_version":"1.0","canonical_sha256":"c2997285901de0062ace1073c7695074ff1c63f55e37e579c255993f6acc1159","source":{"kind":"arxiv","id":"1707.02769","version":1},"attestation_state":"computed","paper":{"title":"Compressed Representation of Dynamic Binary Relations with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ana Cerdeira-Pena, Gonzalo Navarro, Guillermo De Bernardo, Nieves R. Brisaboa","submitted_at":"2017-07-10T09:26:15Z","abstract_excerpt":"We introduce a dynamic data structure for the compact representation of binary relations $\\mathcal{R} \\subseteq A \\times B$. The data structure is a dynamic variant of the k$^2$-tree, a static compact representation that takes advantage of clustering in the binary relation to achieve compression. Our structure can efficiently check whether two objects $(a,b) \\in A \\times B$ are related, and list the objects of $B$ related to some $a \\in A$ and vice versa. Additionally, our structure allows inserting and deleting pairs $(a,b)$ in the relation, as well as modifying the base sets $A$ and $B$. We "},"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":"1707.02769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"84a51483fac6985fb7d7d6e9e53b977929f52caeb497a8b6f70c7729e172bf4a","abstract_canon_sha256":"2ea1b87c189bf4699b9a8ad8485da9d766a777a0e22595b3587ff03d6f2a4918"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:35.803667Z","signature_b64":"zT2mDSm3YXJepdywNS0aV+kec+FKUj5/poP+JbKgjJze2mB5b+vymnKwFbU3IsPpD6UZDLPTregrW96mfi7eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2997285901de0062ace1073c7695074ff1c63f55e37e579c255993f6acc1159","last_reissued_at":"2026-05-18T00:40:35.803085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:35.803085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Representation of Dynamic Binary Relations with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ana Cerdeira-Pena, Gonzalo Navarro, Guillermo De Bernardo, Nieves R. Brisaboa","submitted_at":"2017-07-10T09:26:15Z","abstract_excerpt":"We introduce a dynamic data structure for the compact representation of binary relations $\\mathcal{R} \\subseteq A \\times B$. The data structure is a dynamic variant of the k$^2$-tree, a static compact representation that takes advantage of clustering in the binary relation to achieve compression. Our structure can efficiently check whether two objects $(a,b) \\in A \\times B$ are related, and list the objects of $B$ related to some $a \\in A$ and vice versa. Additionally, our structure allows inserting and deleting pairs $(a,b)$ in the relation, as well as modifying the base sets $A$ and $B$. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02769","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":"1707.02769","created_at":"2026-05-18T00:40:35.803181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02769v1","created_at":"2026-05-18T00:40:35.803181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02769","created_at":"2026-05-18T00:40:35.803181+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKMXFBMQDXQA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKMXFBMQDXQAMKWO","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKMXFBMQ","created_at":"2026-05-18T12:31:56.362134+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/YKMXFBMQDXQAMKWOCBZ4O2KQOT","json":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT.json","graph_json":"https://pith.science/api/pith-number/YKMXFBMQDXQAMKWOCBZ4O2KQOT/graph.json","events_json":"https://pith.science/api/pith-number/YKMXFBMQDXQAMKWOCBZ4O2KQOT/events.json","paper":"https://pith.science/paper/YKMXFBMQ"},"agent_actions":{"view_html":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT","download_json":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT.json","view_paper":"https://pith.science/paper/YKMXFBMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02769&json=true","fetch_graph":"https://pith.science/api/pith-number/YKMXFBMQDXQAMKWOCBZ4O2KQOT/graph.json","fetch_events":"https://pith.science/api/pith-number/YKMXFBMQDXQAMKWOCBZ4O2KQOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/action/storage_attestation","attest_author":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/action/author_attestation","sign_citation":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/action/citation_signature","submit_replication":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/action/replication_record"}},"created_at":"2026-05-18T00:40:35.803181+00:00","updated_at":"2026-05-18T00:40:35.803181+00:00"}