{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CGG4S364KK7NULIIBLO62BMYYB","short_pith_number":"pith:CGG4S364","canonical_record":{"source":{"id":"1810.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T13:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"87e2e2ab255d6fc82d6cdb32c8c9c310c3b1fff9f692b729e8c62a95479e4ac3","abstract_canon_sha256":"82f6e94604ff5a5905c5bef16fc31a5f5d3b46c182d4cfebe55f0b67eb2a0ee6"},"schema_version":"1.0"},"canonical_sha256":"118dc96fdc52beda2d080added0598c07d87be8343093aca97b2e57d54afad38","source":{"kind":"arxiv","id":"1810.10860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10860","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10860v1","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10860","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"CGG4S364KK7N","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGG4S364KK7NULII","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGG4S364","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CGG4S364KK7NULIIBLO62BMYYB","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T13:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"87e2e2ab255d6fc82d6cdb32c8c9c310c3b1fff9f692b729e8c62a95479e4ac3","abstract_canon_sha256":"82f6e94604ff5a5905c5bef16fc31a5f5d3b46c182d4cfebe55f0b67eb2a0ee6"},"schema_version":"1.0"},"canonical_sha256":"118dc96fdc52beda2d080added0598c07d87be8343093aca97b2e57d54afad38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.982252Z","signature_b64":"sfL0QM+l4ZBoV+vF47dsXVmv8+1vkTBHyXfctTjxSkRQv8cVCYyibHIb3W7nX8kGCIQZd1bAj4y/JuQEPVOzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118dc96fdc52beda2d080added0598c07d87be8343093aca97b2e57d54afad38","last_reissued_at":"2026-05-18T00:02:18.981685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.981685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10860","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:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACV5k6yUpQ/0rQzgNtKEENnXd8wYy9QDbEEnAW9pgo/V8R7KSvk+rk6UrfbpawRW0Je5a05OBld/H+GmH429Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:51:01.683149Z"},"content_sha256":"ecf1230305622992794214b3d7779cb3c5cc866584d2286e250be0f6e4b5e1af","schema_version":"1.0","event_id":"sha256:ecf1230305622992794214b3d7779cb3c5cc866584d2286e250be0f6e4b5e1af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CGG4S364KK7NULIIBLO62BMYYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of trees by self-nested trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christophe Godin, Jean-Baptiste Durand, Romain Aza\\\"is","submitted_at":"2018-10-25T13:14:32Z","abstract_excerpt":"The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of trees. In particular, we show from both theoretical and practical viewpoints that complex queries can be quickly answered in self-nested trees compared to general trees. We also present an approximation algorithm of a tree by a self-nested one that can be used in fast prediction of edit distance between two trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10860","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:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEOVH4T1j7nyp6oqo30DFXCj6mMRdA+IOJQ3703AltSJMNI8FTz8GkfyKMu4FMwGGRyAvyPxd2PmkygXGbAsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:51:01.683854Z"},"content_sha256":"94b7be925a2f9412efd8f061c1963c915c0765a3e17cc18ba4e06a4b5738adef","schema_version":"1.0","event_id":"sha256:94b7be925a2f9412efd8f061c1963c915c0765a3e17cc18ba4e06a4b5738adef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/bundle.json","state_url":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGG4S364KK7NULIIBLO62BMYYB/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-31T06:51:01Z","links":{"resolver":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB","bundle":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/bundle.json","state":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGG4S364KK7NULIIBLO62BMYYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CGG4S364KK7NULIIBLO62BMYYB","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":"82f6e94604ff5a5905c5bef16fc31a5f5d3b46c182d4cfebe55f0b67eb2a0ee6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T13:14:32Z","title_canon_sha256":"87e2e2ab255d6fc82d6cdb32c8c9c310c3b1fff9f692b729e8c62a95479e4ac3"},"schema_version":"1.0","source":{"id":"1810.10860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10860","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10860v1","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10860","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"CGG4S364KK7N","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGG4S364KK7NULII","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGG4S364","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:94b7be925a2f9412efd8f061c1963c915c0765a3e17cc18ba4e06a4b5738adef","target":"graph","created_at":"2026-05-18T00:02:18Z","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 class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of trees. In particular, we show from both theoretical and practical viewpoints that complex queries can be quickly answered in self-nested trees compared to general trees. We also present an approximation algorithm of a tree by a self-nested one that can be used in fast prediction of edit distance between two trees.","authors_text":"Christophe Godin, Jean-Baptiste Durand, Romain Aza\\\"is","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T13:14:32Z","title":"Approximation of trees by self-nested trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10860","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:ecf1230305622992794214b3d7779cb3c5cc866584d2286e250be0f6e4b5e1af","target":"record","created_at":"2026-05-18T00:02:18Z","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":"82f6e94604ff5a5905c5bef16fc31a5f5d3b46c182d4cfebe55f0b67eb2a0ee6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T13:14:32Z","title_canon_sha256":"87e2e2ab255d6fc82d6cdb32c8c9c310c3b1fff9f692b729e8c62a95479e4ac3"},"schema_version":"1.0","source":{"id":"1810.10860","kind":"arxiv","version":1}},"canonical_sha256":"118dc96fdc52beda2d080added0598c07d87be8343093aca97b2e57d54afad38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"118dc96fdc52beda2d080added0598c07d87be8343093aca97b2e57d54afad38","first_computed_at":"2026-05-18T00:02:18.981685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:18.981685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfL0QM+l4ZBoV+vF47dsXVmv8+1vkTBHyXfctTjxSkRQv8cVCYyibHIb3W7nX8kGCIQZd1bAj4y/JuQEPVOzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:18.982252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecf1230305622992794214b3d7779cb3c5cc866584d2286e250be0f6e4b5e1af","sha256:94b7be925a2f9412efd8f061c1963c915c0765a3e17cc18ba4e06a4b5738adef"],"state_sha256":"5637aafa593ea1907ce433e2308715f665e8e0a7fb5593871970847936784eef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lyx3klYJrYetJSKzh25yxQp7kS4xNoBV6xRPQcZLMgHL5JMOAv72h3if5L+d4V/cI3RsAwJmRYFKkMHE0hHmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:51:01.688293Z","bundle_sha256":"579a7b5429c5d258bdfaf191b73e0d71735eab27caba503408586e8fcc812342"}}