{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YKMXFBMQDXQAMKWOCBZ4O2KQOT","short_pith_number":"pith:YKMXFBMQ","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"},"canonical_sha256":"c2997285901de0062ace1073c7695074ff1c63f55e37e579c255993f6acc1159","source":{"kind":"arxiv","id":"1707.02769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02769","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02769v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02769","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"YKMXFBMQDXQA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YKMXFBMQDXQAMKWO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YKMXFBMQ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YKMXFBMQDXQAMKWOCBZ4O2KQOT","target":"record","payload":{"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"},"canonical_sha256":"c2997285901de0062ace1073c7695074ff1c63f55e37e579c255993f6acc1159","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"},"source_kind":"arxiv","source_id":"1707.02769","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EEoPexIoj+UfyQ0NX2fOJAC6sGZLYiy3v79gf5JBpZzvQwejPSYf3I8NjwagG9WsiQM50g85Pz1OTG5Ryj1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:03:57.264871Z"},"content_sha256":"8e4bc2bcbefd4f8db45a5d7564f46f073eb1424576d39df24d6eaf019040781d","schema_version":"1.0","event_id":"sha256:8e4bc2bcbefd4f8db45a5d7564f46f073eb1424576d39df24d6eaf019040781d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YKMXFBMQDXQAMKWOCBZ4O2KQOT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOVvtANvhhJfL6r+IoBwVEJxtfLuyPHtNAfxfoJ7vb/72KPc50w7WrYma4SsFuWgSNzcOa62tCV7L5abyC1JBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:03:57.265647Z"},"content_sha256":"007d37f92892fe4d99302e8cc9899f999162367086739673e776b998c739308d","schema_version":"1.0","event_id":"sha256:007d37f92892fe4d99302e8cc9899f999162367086739673e776b998c739308d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/bundle.json","state_url":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T21:03:57Z","links":{"resolver":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT","bundle":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/bundle.json","state":"https://pith.science/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKMXFBMQDXQAMKWOCBZ4O2KQOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YKMXFBMQDXQAMKWOCBZ4O2KQOT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2ea1b87c189bf4699b9a8ad8485da9d766a777a0e22595b3587ff03d6f2a4918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:26:15Z","title_canon_sha256":"84a51483fac6985fb7d7d6e9e53b977929f52caeb497a8b6f70c7729e172bf4a"},"schema_version":"1.0","source":{"id":"1707.02769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02769","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02769v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02769","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"YKMXFBMQDXQA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YKMXFBMQDXQAMKWO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YKMXFBMQ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:007d37f92892fe4d99302e8cc9899f999162367086739673e776b998c739308d","target":"graph","created_at":"2026-05-18T00:40:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ana Cerdeira-Pena, Gonzalo Navarro, Guillermo De Bernardo, Nieves R. Brisaboa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:26:15Z","title":"Compressed Representation of Dynamic Binary Relations with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02769","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8e4bc2bcbefd4f8db45a5d7564f46f073eb1424576d39df24d6eaf019040781d","target":"record","created_at":"2026-05-18T00:40:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2ea1b87c189bf4699b9a8ad8485da9d766a777a0e22595b3587ff03d6f2a4918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T09:26:15Z","title_canon_sha256":"84a51483fac6985fb7d7d6e9e53b977929f52caeb497a8b6f70c7729e172bf4a"},"schema_version":"1.0","source":{"id":"1707.02769","kind":"arxiv","version":1}},"canonical_sha256":"c2997285901de0062ace1073c7695074ff1c63f55e37e579c255993f6acc1159","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2997285901de0062ace1073c7695074ff1c63f55e37e579c255993f6acc1159","first_computed_at":"2026-05-18T00:40:35.803085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:35.803085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zT2mDSm3YXJepdywNS0aV+kec+FKUj5/poP+JbKgjJze2mB5b+vymnKwFbU3IsPpD6UZDLPTregrW96mfi7eDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:35.803667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e4bc2bcbefd4f8db45a5d7564f46f073eb1424576d39df24d6eaf019040781d","sha256:007d37f92892fe4d99302e8cc9899f999162367086739673e776b998c739308d"],"state_sha256":"e89eb41790b7d029d1515d11c8b3ca54c2941e7f874cea4c7857fb092d41a88a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTZvUImsFavEc4FwioSX8sSz/zfOvrag/C1Riob9zmdF78wDwzk9cTLZRJHnCsjYkP63u5GIfu+gEdGB39rXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:03:57.269436Z","bundle_sha256":"445a90f280aa480c6e4a8e074a676467a59180b5aeb78cab8f1f83aa8236521a"}}