{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UG3A2SESCLANA3UGLBKLCH2VWW","short_pith_number":"pith:UG3A2SES","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"},"canonical_sha256":"a1b60d489212c0d06e865854b11f55b591e2a6fdfe48ef5d74540556a2c42486","source":{"kind":"arxiv","id":"1811.06383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06383","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06383v1","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06383","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"UG3A2SESCLAN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UG3A2SESCLANA3UG","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UG3A2SES","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UG3A2SESCLANA3UGLBKLCH2VWW","target":"record","payload":{"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"},"canonical_sha256":"a1b60d489212c0d06e865854b11f55b591e2a6fdfe48ef5d74540556a2c42486","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"},"source_kind":"arxiv","source_id":"1811.06383","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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akFh1tJaQtREmabwvS71OwFn7bX1FG2opx3l/4m7tHmpEx3WDmPYXl7s2pMTZOLbXmdsw8t6wmfZg7ESE6OcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:41:03.108373Z"},"content_sha256":"ec70479566c0eabf44b6a5cf884a2df5f77e1700a0936d57048b1a06ab7b0448","schema_version":"1.0","event_id":"sha256:ec70479566c0eabf44b6a5cf884a2df5f77e1700a0936d57048b1a06ab7b0448"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UG3A2SESCLANA3UGLBKLCH2VWW","target":"graph","payload":{"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"},"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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuSvjNy3vKsruvOBY184tOim/Zqw/1nNx1n7cL8MQU0tutiSBBYXmbYOoiCAszhlpPWnR+iwd+ELr6VrDePFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:41:03.108715Z"},"content_sha256":"39b4a8d151b84a6b53197eba44ae3d0c2d3b1c6f2a99add64deb1eaa334094c6","schema_version":"1.0","event_id":"sha256:39b4a8d151b84a6b53197eba44ae3d0c2d3b1c6f2a99add64deb1eaa334094c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/bundle.json","state_url":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UG3A2SESCLANA3UGLBKLCH2VWW/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-07-02T14:41:03Z","links":{"resolver":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW","bundle":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/bundle.json","state":"https://pith.science/pith/UG3A2SESCLANA3UGLBKLCH2VWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UG3A2SESCLANA3UGLBKLCH2VWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UG3A2SESCLANA3UGLBKLCH2VWW","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":"462f72a28499e43917b623aa1143caae22a6c2186b7b46bdb193163022d2ff70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T04:38:16Z","title_canon_sha256":"2d81674dbd48a55dd105262e9e162706174a55118072638ec41dd0d1de7205b0"},"schema_version":"1.0","source":{"id":"1811.06383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06383","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06383v1","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06383","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"UG3A2SESCLAN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UG3A2SESCLANA3UG","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UG3A2SES","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:39b4a8d151b84a6b53197eba44ae3d0c2d3b1c6f2a99add64deb1eaa334094c6","target":"graph","created_at":"2026-05-18T00:00:37Z","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":"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.","authors_text":"Jeremy Ko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T04:38:16Z","title":"The Amortized Analysis of a Non-blocking Chromatic Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06383","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:ec70479566c0eabf44b6a5cf884a2df5f77e1700a0936d57048b1a06ab7b0448","target":"record","created_at":"2026-05-18T00:00:37Z","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":"462f72a28499e43917b623aa1143caae22a6c2186b7b46bdb193163022d2ff70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T04:38:16Z","title_canon_sha256":"2d81674dbd48a55dd105262e9e162706174a55118072638ec41dd0d1de7205b0"},"schema_version":"1.0","source":{"id":"1811.06383","kind":"arxiv","version":1}},"canonical_sha256":"a1b60d489212c0d06e865854b11f55b591e2a6fdfe48ef5d74540556a2c42486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1b60d489212c0d06e865854b11f55b591e2a6fdfe48ef5d74540556a2c42486","first_computed_at":"2026-05-18T00:00:37.852036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:37.852036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xQKixXvEG/zxmqiXYsX4R4K6u7aQtZ7yqarS8dOBreH+SUKcPYcA30UO3zQWgXm88tAhuIn+cADZ/tT3PFIqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:37.852480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec70479566c0eabf44b6a5cf884a2df5f77e1700a0936d57048b1a06ab7b0448","sha256:39b4a8d151b84a6b53197eba44ae3d0c2d3b1c6f2a99add64deb1eaa334094c6"],"state_sha256":"c2873b648d639936d36eaef483e77c3b3cb52b980a6aef5afdf70335c77089b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07/aNSK7e+q6rEiPOoamGD9Ciyqjbj18bJtobJyPmMYSnmv4wK6xgUc+rGm1GXxGNNtEQOxw4c10yuDwnRUuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:41:03.110577Z","bundle_sha256":"b0f768b6d8f468eb7b43181197eedaaaface2d9a54522b370dd98c29d3f20b42"}}