{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CGG4S364KK7NULIIBLO62BMYYB","short_pith_number":"pith:CGG4S364","schema_version":"1.0","canonical_sha256":"118dc96fdc52beda2d080added0598c07d87be8343093aca97b2e57d54afad38","source":{"kind":"arxiv","id":"1810.10860","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.10860","created_at":"2026-05-18T00:02:18.981766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10860v1","created_at":"2026-05-18T00:02:18.981766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10860","created_at":"2026-05-18T00:02:18.981766+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGG4S364KK7N","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGG4S364KK7NULII","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGG4S364","created_at":"2026-05-18T12:32:16.446611+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/CGG4S364KK7NULIIBLO62BMYYB","json":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB.json","graph_json":"https://pith.science/api/pith-number/CGG4S364KK7NULIIBLO62BMYYB/graph.json","events_json":"https://pith.science/api/pith-number/CGG4S364KK7NULIIBLO62BMYYB/events.json","paper":"https://pith.science/paper/CGG4S364"},"agent_actions":{"view_html":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB","download_json":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB.json","view_paper":"https://pith.science/paper/CGG4S364","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10860&json=true","fetch_graph":"https://pith.science/api/pith-number/CGG4S364KK7NULIIBLO62BMYYB/graph.json","fetch_events":"https://pith.science/api/pith-number/CGG4S364KK7NULIIBLO62BMYYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/action/storage_attestation","attest_author":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/action/author_attestation","sign_citation":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/action/citation_signature","submit_replication":"https://pith.science/pith/CGG4S364KK7NULIIBLO62BMYYB/action/replication_record"}},"created_at":"2026-05-18T00:02:18.981766+00:00","updated_at":"2026-05-18T00:02:18.981766+00:00"}