{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UG3A2SESCLANA3UGLBKLCH2VWW","short_pith_number":"pith:UG3A2SES","schema_version":"1.0","canonical_sha256":"a1b60d489212c0d06e865854b11f55b591e2a6fdfe48ef5d74540556a2c42486","source":{"kind":"arxiv","id":"1811.06383","version":1},"attestation_state":"computed","paper":{"title":"The Amortized Analysis of a Non-blocking Chromatic Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jeremy Ko","submitted_at":"2018-11-14T04:38:16Z","abstract_excerpt":"A non-blocking chromatic tree is a type of balanced binary search tree where multiple processes can concurrently perform search and update operations. We prove that a certain implementation has amortized cost $O(\\dot{c} + \\log n)$ for each operation, where $\\dot{c}$ is the maximum number of concurrent operations during the execution and $n$ is the maximum number of keys in the tree during the operation. This amortized analysis presents new challenges compared to existing analyses of other non-blocking data structures."},"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":"1811.06383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T04:38:16Z","cross_cats_sorted":[],"title_canon_sha256":"2d81674dbd48a55dd105262e9e162706174a55118072638ec41dd0d1de7205b0","abstract_canon_sha256":"462f72a28499e43917b623aa1143caae22a6c2186b7b46bdb193163022d2ff70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:37.852480Z","signature_b64":"xQKixXvEG/zxmqiXYsX4R4K6u7aQtZ7yqarS8dOBreH+SUKcPYcA30UO3zQWgXm88tAhuIn+cADZ/tT3PFIqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b60d489212c0d06e865854b11f55b591e2a6fdfe48ef5d74540556a2c42486","last_reissued_at":"2026-05-18T00:00:37.852036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:37.852036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Amortized Analysis of a Non-blocking Chromatic Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jeremy Ko","submitted_at":"2018-11-14T04:38:16Z","abstract_excerpt":"A non-blocking chromatic tree is a type of balanced binary search tree where multiple processes can concurrently perform search and update operations. We prove that a certain implementation has amortized cost $O(\\dot{c} + \\log n)$ for each operation, where $\\dot{c}$ is the maximum number of concurrent operations during the execution and $n$ is the maximum number of keys in the tree during the operation. This amortized analysis presents new challenges compared to existing analyses of other non-blocking data structures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06383","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":"1811.06383","created_at":"2026-05-18T00:00:37.852097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06383v1","created_at":"2026-05-18T00:00:37.852097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06383","created_at":"2026-05-18T00:00:37.852097+00:00"},{"alias_kind":"pith_short_12","alias_value":"UG3A2SESCLAN","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UG3A2SESCLANA3UG","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UG3A2SES","created_at":"2026-05-18T12:32:56.356000+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/UG3A2SESCLANA3UGLBKLCH2VWW","json":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW.json","graph_json":"https://pith.science/api/pith-number/UG3A2SESCLANA3UGLBKLCH2VWW/graph.json","events_json":"https://pith.science/api/pith-number/UG3A2SESCLANA3UGLBKLCH2VWW/events.json","paper":"https://pith.science/paper/UG3A2SES"},"agent_actions":{"view_html":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW","download_json":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW.json","view_paper":"https://pith.science/paper/UG3A2SES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06383&json=true","fetch_graph":"https://pith.science/api/pith-number/UG3A2SESCLANA3UGLBKLCH2VWW/graph.json","fetch_events":"https://pith.science/api/pith-number/UG3A2SESCLANA3UGLBKLCH2VWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/action/storage_attestation","attest_author":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/action/author_attestation","sign_citation":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/action/citation_signature","submit_replication":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/action/replication_record"}},"created_at":"2026-05-18T00:00:37.852097+00:00","updated_at":"2026-05-18T00:00:37.852097+00:00"}