{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I5ANR2Z4NOHZVTU5KBU6CV3X7T","short_pith_number":"pith:I5ANR2Z4","schema_version":"1.0","canonical_sha256":"4740d8eb3c6b8f9ace9d5069e15777fce2a07e6633d5de3a47eef4618ceccc4f","source":{"kind":"arxiv","id":"1603.00977","version":1},"attestation_state":"computed","paper":{"title":"Generation, Ranking and Unranking of Ordered Trees with Degree Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Abbas Nowzari-Dalini (UT, Iran), Italy), Mahdi Amani (Universit\\`a di Pisa, Pisa, Tehran","submitted_at":"2016-03-03T05:33:50Z","abstract_excerpt":"We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of $\\Delta$. This class of trees represents a generalization of chemical trees. A chemical tree is an unlabeled tree in which no node has degree greater than 4. By allowing up to $\\Delta$ children for each node of chemical tree instead of 4, we will have a generalization of chemical trees. Here, we introduce a new encoding over an alphabet of size 4 for representing unlabeled ordered trees with maximum degree of $\\Delta$. We use this encoding for generating these trees in A-orde"},"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":"1603.00977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-03T05:33:50Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"59d59b85b53649b1e68877a7cc2719fc7df2156a34ff88180eb887ee259424f2","abstract_canon_sha256":"209c6628c2f9dd3e5ba6d05e22bdb77d7579628b9c8c5071515ba6373217d842"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.787994Z","signature_b64":"0ljVyxG+vA6b7EOzIPft3XjlBcXMj4RUDjC8oRAsb1nQSpI5G7458cJ899g5wcWXWgapfGxJnbKwTE0vcintBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4740d8eb3c6b8f9ace9d5069e15777fce2a07e6633d5de3a47eef4618ceccc4f","last_reissued_at":"2026-05-18T01:08:28.787429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.787429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generation, Ranking and Unranking of Ordered Trees with Degree Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Abbas Nowzari-Dalini (UT, Iran), Italy), Mahdi Amani (Universit\\`a di Pisa, Pisa, Tehran","submitted_at":"2016-03-03T05:33:50Z","abstract_excerpt":"We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of $\\Delta$. This class of trees represents a generalization of chemical trees. A chemical tree is an unlabeled tree in which no node has degree greater than 4. By allowing up to $\\Delta$ children for each node of chemical tree instead of 4, we will have a generalization of chemical trees. Here, we introduce a new encoding over an alphabet of size 4 for representing unlabeled ordered trees with maximum degree of $\\Delta$. We use this encoding for generating these trees in A-orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00977","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":"1603.00977","created_at":"2026-05-18T01:08:28.787505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00977v1","created_at":"2026-05-18T01:08:28.787505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00977","created_at":"2026-05-18T01:08:28.787505+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5ANR2Z4NOHZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5ANR2Z4NOHZVTU5","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5ANR2Z4","created_at":"2026-05-18T12:30:22.444734+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/I5ANR2Z4NOHZVTU5KBU6CV3X7T","json":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T.json","graph_json":"https://pith.science/api/pith-number/I5ANR2Z4NOHZVTU5KBU6CV3X7T/graph.json","events_json":"https://pith.science/api/pith-number/I5ANR2Z4NOHZVTU5KBU6CV3X7T/events.json","paper":"https://pith.science/paper/I5ANR2Z4"},"agent_actions":{"view_html":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T","download_json":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T.json","view_paper":"https://pith.science/paper/I5ANR2Z4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00977&json=true","fetch_graph":"https://pith.science/api/pith-number/I5ANR2Z4NOHZVTU5KBU6CV3X7T/graph.json","fetch_events":"https://pith.science/api/pith-number/I5ANR2Z4NOHZVTU5KBU6CV3X7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/action/storage_attestation","attest_author":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/action/author_attestation","sign_citation":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/action/citation_signature","submit_replication":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/action/replication_record"}},"created_at":"2026-05-18T01:08:28.787505+00:00","updated_at":"2026-05-18T01:08:28.787505+00:00"}