{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JEOQVZX3RC22M7HLJ55TGYWJAP","short_pith_number":"pith:JEOQVZX3","canonical_record":{"source":{"id":"1404.4692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-18T05:41:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"62fd4dda640be188b39e214829eed6029f57a15c3232bebb85f271c74b356dd8","abstract_canon_sha256":"b588d1e7012de7b0eb126c76dc1e8890bf9984cf7703858e77cc67ec2ff4651b"},"schema_version":"1.0"},"canonical_sha256":"491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82","source":{"kind":"arxiv","id":"1404.4692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4692","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4692v1","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4692","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"JEOQVZX3RC22","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JEOQVZX3RC22M7HL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JEOQVZX3","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JEOQVZX3RC22M7HLJ55TGYWJAP","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-18T05:41:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"62fd4dda640be188b39e214829eed6029f57a15c3232bebb85f271c74b356dd8","abstract_canon_sha256":"b588d1e7012de7b0eb126c76dc1e8890bf9984cf7703858e77cc67ec2ff4651b"},"schema_version":"1.0"},"canonical_sha256":"491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.391151Z","signature_b64":"flo0ortpRdcYNUOv/aXJgECVoeby8ptgqw9gxcjSPKjMo/JRneR/bqDnpsX2vUZEDwRxFLIUmOVYD13oXIoHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82","last_reissued_at":"2026-05-18T02:53:55.390270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.390270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4692","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-18T02:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuW0LROQsrNzOWdzp5cF1rTzmD5gZ97BG4ksSKib5Q/YFekzpoOGCI++UmNnlpFLvaPGqN7VKRPabkvzkmDkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:37:33.920333Z"},"content_sha256":"5782b2117f621c89a62551d0d6554ad08cc69a1390569fb4d72e9f5ebf9e1bda","schema_version":"1.0","event_id":"sha256:5782b2117f621c89a62551d0d6554ad08cc69a1390569fb4d72e9f5ebf9e1bda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JEOQVZX3RC22M7HLJ55TGYWJAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation for the Path Complexity of Binary Search Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Nishant Doshi","submitted_at":"2014-04-18T05:41:46Z","abstract_excerpt":"The complexity of an algorithm is an important parameter to determine its effi-ciency. They are of different types viz. Time complexity, Space complexity, etc. However, none of them consider the execution path as a complexity measure. Ashok et al, firstly proposed the notion of the Path Complexity of a pro-gram/algorithm, which defined based on the number of execution paths as a function of the input size. However, the notion of path complexity of the pro-gram, cannot apply to the object-oriented environment. Therefore, Anupam et al, has extended the notion of path complexity to the class as f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4692","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-18T02:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBzcZYrpoEN7gLxHzVxyIPR7Ke4eTyDryt3XuHodrWruvD0HUzpl1Mu6etCHcKxx2hpaxuoJ3YXHZ9dterGDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:37:33.921062Z"},"content_sha256":"cd40ffc00279dc91faba3f4e3804e01088454ce2619d8560624b88fa5de6db98","schema_version":"1.0","event_id":"sha256:cd40ffc00279dc91faba3f4e3804e01088454ce2619d8560624b88fa5de6db98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEOQVZX3RC22M7HLJ55TGYWJAP/bundle.json","state_url":"https://pith.science/pith/JEOQVZX3RC22M7HLJ55TGYWJAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEOQVZX3RC22M7HLJ55TGYWJAP/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-09T17:37:33Z","links":{"resolver":"https://pith.science/pith/JEOQVZX3RC22M7HLJ55TGYWJAP","bundle":"https://pith.science/pith/JEOQVZX3RC22M7HLJ55TGYWJAP/bundle.json","state":"https://pith.science/pith/JEOQVZX3RC22M7HLJ55TGYWJAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEOQVZX3RC22M7HLJ55TGYWJAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JEOQVZX3RC22M7HLJ55TGYWJAP","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":"b588d1e7012de7b0eb126c76dc1e8890bf9984cf7703858e77cc67ec2ff4651b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-18T05:41:46Z","title_canon_sha256":"62fd4dda640be188b39e214829eed6029f57a15c3232bebb85f271c74b356dd8"},"schema_version":"1.0","source":{"id":"1404.4692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4692","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4692v1","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4692","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"JEOQVZX3RC22","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JEOQVZX3RC22M7HL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JEOQVZX3","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:cd40ffc00279dc91faba3f4e3804e01088454ce2619d8560624b88fa5de6db98","target":"graph","created_at":"2026-05-18T02:53:55Z","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":"The complexity of an algorithm is an important parameter to determine its effi-ciency. They are of different types viz. Time complexity, Space complexity, etc. However, none of them consider the execution path as a complexity measure. Ashok et al, firstly proposed the notion of the Path Complexity of a pro-gram/algorithm, which defined based on the number of execution paths as a function of the input size. However, the notion of path complexity of the pro-gram, cannot apply to the object-oriented environment. Therefore, Anupam et al, has extended the notion of path complexity to the class as f","authors_text":"Nishant Doshi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-18T05:41:46Z","title":"Approximation for the Path Complexity of Binary Search Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4692","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:5782b2117f621c89a62551d0d6554ad08cc69a1390569fb4d72e9f5ebf9e1bda","target":"record","created_at":"2026-05-18T02:53:55Z","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":"b588d1e7012de7b0eb126c76dc1e8890bf9984cf7703858e77cc67ec2ff4651b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-18T05:41:46Z","title_canon_sha256":"62fd4dda640be188b39e214829eed6029f57a15c3232bebb85f271c74b356dd8"},"schema_version":"1.0","source":{"id":"1404.4692","kind":"arxiv","version":1}},"canonical_sha256":"491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82","first_computed_at":"2026-05-18T02:53:55.390270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:55.390270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"flo0ortpRdcYNUOv/aXJgECVoeby8ptgqw9gxcjSPKjMo/JRneR/bqDnpsX2vUZEDwRxFLIUmOVYD13oXIoHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:55.391151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5782b2117f621c89a62551d0d6554ad08cc69a1390569fb4d72e9f5ebf9e1bda","sha256:cd40ffc00279dc91faba3f4e3804e01088454ce2619d8560624b88fa5de6db98"],"state_sha256":"604a5808acdd8c385946cfa1b0de8b73d9c24ab1b756bf94cf7430c9878f989d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WePRR7jZctgfXN9jm4nWNidf6Aj30lGW/6BuM+A7MVuJJ8dDKMIWnp/+oJExM/y67kQfO1KTzAdFqyYVhBxHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:37:33.925198Z","bundle_sha256":"26c8e2d4b5e3f99fe76ed13d448378fb2d19bda9cd35b04266962c2c9e663be4"}}