{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SWDT5D5AAKCTKHA2ITS4XXU3SL","short_pith_number":"pith:SWDT5D5A","canonical_record":{"source":{"id":"1410.4963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-18T14:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"c5c46c9e80848327b727be0a3945533d55fb9eba25a0102b318189b30277c12a","abstract_canon_sha256":"63c1bd422c94ba934311611599055927dc072f180d5fc7b7d9c79345ca2eafed"},"schema_version":"1.0"},"canonical_sha256":"95873e8fa00285351c1a44e5cbde9b92f85acc484e92f952b98689ae4484ef7c","source":{"kind":"arxiv","id":"1410.4963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4963","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4963v1","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4963","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"SWDT5D5AAKCT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SWDT5D5AAKCTKHA2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SWDT5D5A","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SWDT5D5AAKCTKHA2ITS4XXU3SL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-18T14:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"c5c46c9e80848327b727be0a3945533d55fb9eba25a0102b318189b30277c12a","abstract_canon_sha256":"63c1bd422c94ba934311611599055927dc072f180d5fc7b7d9c79345ca2eafed"},"schema_version":"1.0"},"canonical_sha256":"95873e8fa00285351c1a44e5cbde9b92f85acc484e92f952b98689ae4484ef7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:47.354844Z","signature_b64":"0F7Rg9CGU0Md9hdZuLifI0GcQlsod2xnr5mHIuUpjmwR7T68jNKC4uX37/Al8iWIsKqt2Ti5eB3BVHnS6EkcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95873e8fa00285351c1a44e5cbde9b92f85acc484e92f952b98689ae4484ef7c","last_reissued_at":"2026-05-18T02:39:47.354382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:47.354382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4963","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:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H69HIekNSPC9VBNOjlpqTW7tSFxjKFRdbBQ3z1/b7x3dz4B5QJapP40XbeosbRqoAHqA0StjuUL1yN9fcAjBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:13:44.900665Z"},"content_sha256":"d8c7315929d04dc85a50540ae8ca88b78b84ebedb08a9f1213a0deb63560a575","schema_version":"1.0","event_id":"sha256:d8c7315929d04dc85a50540ae8ca88b78b84ebedb08a9f1213a0deb63560a575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SWDT5D5AAKCTKHA2ITS4XXU3SL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Succinct Representations of Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti","submitted_at":"2014-10-18T14:43:10Z","abstract_excerpt":"We observe that a standard transformation between \\emph{ordinal} trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree representations. There are four symmetric versions of these transformations. Via these transformations we get four succinct representations of $n$-node binary trees that use $2n + n/(\\log n)^{O(1)}$ bits and support (among other operations) navigation, inorder numbering, one of pre- or post-order numbering, subtree size and lowest common ancestor (LCA) queries. The ability to support inorder numbering is crucial for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4963","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:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDaJiYjZl2pCFDGHv7KVsEuO0EwEaeiffVyQrC3N3NolT7ddcWb1i2+tzsZLi3dtWgPmj2UafvOsAp1uTlv7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:13:44.901369Z"},"content_sha256":"1b77571300cb4137f169151d1d4b14341a30af39fe4c584ed9b9250d5c6b5fed","schema_version":"1.0","event_id":"sha256:1b77571300cb4137f169151d1d4b14341a30af39fe4c584ed9b9250d5c6b5fed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL/bundle.json","state_url":"https://pith.science/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL/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-30T01:13:44Z","links":{"resolver":"https://pith.science/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL","bundle":"https://pith.science/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL/bundle.json","state":"https://pith.science/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWDT5D5AAKCTKHA2ITS4XXU3SL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SWDT5D5AAKCTKHA2ITS4XXU3SL","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":"63c1bd422c94ba934311611599055927dc072f180d5fc7b7d9c79345ca2eafed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-18T14:43:10Z","title_canon_sha256":"c5c46c9e80848327b727be0a3945533d55fb9eba25a0102b318189b30277c12a"},"schema_version":"1.0","source":{"id":"1410.4963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4963","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4963v1","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4963","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"SWDT5D5AAKCT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SWDT5D5AAKCTKHA2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SWDT5D5A","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:1b77571300cb4137f169151d1d4b14341a30af39fe4c584ed9b9250d5c6b5fed","target":"graph","created_at":"2026-05-18T02:39:47Z","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":"We observe that a standard transformation between \\emph{ordinal} trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree representations. There are four symmetric versions of these transformations. Via these transformations we get four succinct representations of $n$-node binary trees that use $2n + n/(\\log n)^{O(1)}$ bits and support (among other operations) navigation, inorder numbering, one of pre- or post-order numbering, subtree size and lowest common ancestor (LCA) queries. The ability to support inorder numbering is crucial for the","authors_text":"Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-18T14:43:10Z","title":"On Succinct Representations of Binary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4963","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:d8c7315929d04dc85a50540ae8ca88b78b84ebedb08a9f1213a0deb63560a575","target":"record","created_at":"2026-05-18T02:39:47Z","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":"63c1bd422c94ba934311611599055927dc072f180d5fc7b7d9c79345ca2eafed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-18T14:43:10Z","title_canon_sha256":"c5c46c9e80848327b727be0a3945533d55fb9eba25a0102b318189b30277c12a"},"schema_version":"1.0","source":{"id":"1410.4963","kind":"arxiv","version":1}},"canonical_sha256":"95873e8fa00285351c1a44e5cbde9b92f85acc484e92f952b98689ae4484ef7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95873e8fa00285351c1a44e5cbde9b92f85acc484e92f952b98689ae4484ef7c","first_computed_at":"2026-05-18T02:39:47.354382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:47.354382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0F7Rg9CGU0Md9hdZuLifI0GcQlsod2xnr5mHIuUpjmwR7T68jNKC4uX37/Al8iWIsKqt2Ti5eB3BVHnS6EkcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:47.354844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8c7315929d04dc85a50540ae8ca88b78b84ebedb08a9f1213a0deb63560a575","sha256:1b77571300cb4137f169151d1d4b14341a30af39fe4c584ed9b9250d5c6b5fed"],"state_sha256":"48a1c60e6f36dc6d827d3dcfebb3ab8b0f1552b5a9cd144aa996d3e7942ee0b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+h6hw3EaN4pTY/RVng1sRR0J8wflnqhXLh6pXG03QkRANpe0J6OlSc+J6C9KsGLG6rFUVddTiiSm36d9O+CAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:13:44.904940Z","bundle_sha256":"96ee79f461ad1ecae37a7ce5115817c35c4c102312273609f4da8b9f4315110d"}}