{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AXLXOVNOO5VGD6IBL74COZB5F5","short_pith_number":"pith:AXLXOVNO","canonical_record":{"source":{"id":"1212.3418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-14T09:17:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5326e1d457ba867da9ad4b059ca9c26664c1e0bae0beddaf9a1e22c73d1b953d","abstract_canon_sha256":"d59317834070de431263281a0ec8bf4380a6076024976d733708277286a9ba00"},"schema_version":"1.0"},"canonical_sha256":"05d77755ae776a61f9015ff827643d2f7288178ad4fdd1fa38682881b3ca57a9","source":{"kind":"arxiv","id":"1212.3418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3418","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3418v1","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3418","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"AXLXOVNOO5VG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AXLXOVNOO5VGD6IB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AXLXOVNO","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AXLXOVNOO5VGD6IBL74COZB5F5","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-14T09:17:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5326e1d457ba867da9ad4b059ca9c26664c1e0bae0beddaf9a1e22c73d1b953d","abstract_canon_sha256":"d59317834070de431263281a0ec8bf4380a6076024976d733708277286a9ba00"},"schema_version":"1.0"},"canonical_sha256":"05d77755ae776a61f9015ff827643d2f7288178ad4fdd1fa38682881b3ca57a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:24.720362Z","signature_b64":"Law79b3OCbhtYxxbEUBrfsl75g6Wk05VWao6Q7hZahry8P1dxJZaWMbmElNQn0Y/oAxzTIkUAxYNZqYM6HVhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d77755ae776a61f9015ff827643d2f7288178ad4fdd1fa38682881b3ca57a9","last_reissued_at":"2026-05-18T03:38:24.719611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:24.719611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3418","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-18T03:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M80BjNRZiikf6pv8crMLs/ySKQvUkAxte5rJ6fyQb96uO97lZjenwJLYUH4AFx98MbMuldwgNvvsMdflCoJ9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:33:44.524138Z"},"content_sha256":"99183cd3e7bb869c34877655e0b85d27a1d230a9023c6040060e98fe696de0d0","schema_version":"1.0","event_id":"sha256:99183cd3e7bb869c34877655e0b85d27a1d230a9023c6040060e98fe696de0d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AXLXOVNOO5VGD6IBL74COZB5F5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Stabilizing Balancing Algorithm for Containment-Based Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Anissa Lamani (MIS), Evangelos Bampas, Franck Petit (LIP6), INRIA Rocquencourt), Mathieu Valero (LIP6","submitted_at":"2012-12-14T09:17:50Z","abstract_excerpt":"Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts. In addition to their versatility, their balanced shape ensures an overall satisfactory performance. Re- cently, it has been shown that their distributed implementations can be fault-resilient. However, this robustness is achieved at the cost of un-balancing the structure. While the structure remains correct in terms of searchability, its performance can be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3418","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-18T03:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMrgP2vNNvlYDVWymcCdbSugXzmzNGNULceVlJ8CmIixE089wxhdZrI8zkAdHwfduGDCKUD1v6xBd9xawj5fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:33:44.524918Z"},"content_sha256":"9d8590831c1c11b595586f2cec4f524176d88a9c541cd140fdd0efb996fe17a0","schema_version":"1.0","event_id":"sha256:9d8590831c1c11b595586f2cec4f524176d88a9c541cd140fdd0efb996fe17a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/bundle.json","state_url":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXLXOVNOO5VGD6IBL74COZB5F5/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-05-24T11:33:44Z","links":{"resolver":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5","bundle":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/bundle.json","state":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXLXOVNOO5VGD6IBL74COZB5F5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AXLXOVNOO5VGD6IBL74COZB5F5","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":"d59317834070de431263281a0ec8bf4380a6076024976d733708277286a9ba00","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-14T09:17:50Z","title_canon_sha256":"5326e1d457ba867da9ad4b059ca9c26664c1e0bae0beddaf9a1e22c73d1b953d"},"schema_version":"1.0","source":{"id":"1212.3418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3418","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3418v1","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3418","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"AXLXOVNOO5VG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AXLXOVNOO5VGD6IB","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AXLXOVNO","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:9d8590831c1c11b595586f2cec4f524176d88a9c541cd140fdd0efb996fe17a0","target":"graph","created_at":"2026-05-18T03:38:24Z","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":"Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts. In addition to their versatility, their balanced shape ensures an overall satisfactory performance. Re- cently, it has been shown that their distributed implementations can be fault-resilient. However, this robustness is achieved at the cost of un-balancing the structure. While the structure remains correct in terms of searchability, its performance can be s","authors_text":"Anissa Lamani (MIS), Evangelos Bampas, Franck Petit (LIP6), INRIA Rocquencourt), Mathieu Valero (LIP6","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-14T09:17:50Z","title":"Self-Stabilizing Balancing Algorithm for Containment-Based Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3418","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:99183cd3e7bb869c34877655e0b85d27a1d230a9023c6040060e98fe696de0d0","target":"record","created_at":"2026-05-18T03:38:24Z","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":"d59317834070de431263281a0ec8bf4380a6076024976d733708277286a9ba00","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-14T09:17:50Z","title_canon_sha256":"5326e1d457ba867da9ad4b059ca9c26664c1e0bae0beddaf9a1e22c73d1b953d"},"schema_version":"1.0","source":{"id":"1212.3418","kind":"arxiv","version":1}},"canonical_sha256":"05d77755ae776a61f9015ff827643d2f7288178ad4fdd1fa38682881b3ca57a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05d77755ae776a61f9015ff827643d2f7288178ad4fdd1fa38682881b3ca57a9","first_computed_at":"2026-05-18T03:38:24.719611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:24.719611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Law79b3OCbhtYxxbEUBrfsl75g6Wk05VWao6Q7hZahry8P1dxJZaWMbmElNQn0Y/oAxzTIkUAxYNZqYM6HVhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:24.720362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99183cd3e7bb869c34877655e0b85d27a1d230a9023c6040060e98fe696de0d0","sha256:9d8590831c1c11b595586f2cec4f524176d88a9c541cd140fdd0efb996fe17a0"],"state_sha256":"40320b9a96c6069b3a1309742c0ad385840b2b0176268b492734cbdcbbc3b883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iigXrLD+r1mEoRckb0D6Lkqh/RI4BvQ1ofH19nTCW/lh9jry6gG3cRn1iujVVm10w5dnyCJd7WIDloiTXDGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:33:44.528735Z","bundle_sha256":"8721f8303351b6c4a459c75117524e14f4afb71e30fd5a519ff4c060c009585a"}}