{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AXLXOVNOO5VGD6IBL74COZB5F5","short_pith_number":"pith:AXLXOVNO","schema_version":"1.0","canonical_sha256":"05d77755ae776a61f9015ff827643d2f7288178ad4fdd1fa38682881b3ca57a9","source":{"kind":"arxiv","id":"1212.3418","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.3418","created_at":"2026-05-18T03:38:24.719735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3418v1","created_at":"2026-05-18T03:38:24.719735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3418","created_at":"2026-05-18T03:38:24.719735+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXLXOVNOO5VG","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXLXOVNOO5VGD6IB","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXLXOVNO","created_at":"2026-05-18T12:26:58.693483+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/AXLXOVNOO5VGD6IBL74COZB5F5","json":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5.json","graph_json":"https://pith.science/api/pith-number/AXLXOVNOO5VGD6IBL74COZB5F5/graph.json","events_json":"https://pith.science/api/pith-number/AXLXOVNOO5VGD6IBL74COZB5F5/events.json","paper":"https://pith.science/paper/AXLXOVNO"},"agent_actions":{"view_html":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5","download_json":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5.json","view_paper":"https://pith.science/paper/AXLXOVNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3418&json=true","fetch_graph":"https://pith.science/api/pith-number/AXLXOVNOO5VGD6IBL74COZB5F5/graph.json","fetch_events":"https://pith.science/api/pith-number/AXLXOVNOO5VGD6IBL74COZB5F5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/action/storage_attestation","attest_author":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/action/author_attestation","sign_citation":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/action/citation_signature","submit_replication":"https://pith.science/pith/AXLXOVNOO5VGD6IBL74COZB5F5/action/replication_record"}},"created_at":"2026-05-18T03:38:24.719735+00:00","updated_at":"2026-05-18T03:38:24.719735+00:00"}