{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I5ANR2Z4NOHZVTU5KBU6CV3X7T","short_pith_number":"pith:I5ANR2Z4","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"},"canonical_sha256":"4740d8eb3c6b8f9ace9d5069e15777fce2a07e6633d5de3a47eef4618ceccc4f","source":{"kind":"arxiv","id":"1603.00977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00977","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00977v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00977","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"I5ANR2Z4NOHZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I5ANR2Z4NOHZVTU5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I5ANR2Z4","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I5ANR2Z4NOHZVTU5KBU6CV3X7T","target":"record","payload":{"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"},"canonical_sha256":"4740d8eb3c6b8f9ace9d5069e15777fce2a07e6633d5de3a47eef4618ceccc4f","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"},"source_kind":"arxiv","source_id":"1603.00977","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuhHKZyJR989M/zf+wmYpiuup0Zgu7ZQWTSfAamFG+IOLvKwkoauBHriq1I/WhydGRMZc2kByUUnV54OtyT/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:30:54.334538Z"},"content_sha256":"6b60483ecc67e91bc596000dee01103b4a082e7a6c2d70700dfe1a30122a63ab","schema_version":"1.0","event_id":"sha256:6b60483ecc67e91bc596000dee01103b4a082e7a6c2d70700dfe1a30122a63ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I5ANR2Z4NOHZVTU5KBU6CV3X7T","target":"graph","payload":{"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"},"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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soDOUycH+3vpsTY+muAGLHeyncT0po/Yu0HhmPjsqyQlaIeP1z7HABygiip17YWaux7dOEMGdDmsvN06xn/JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:30:54.334901Z"},"content_sha256":"2e4f77f20a37820777239a1aed6b1984f9c30d39854067dd646c3f172b8fa232","schema_version":"1.0","event_id":"sha256:2e4f77f20a37820777239a1aed6b1984f9c30d39854067dd646c3f172b8fa232"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/bundle.json","state_url":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/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-27T23:30:54Z","links":{"resolver":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T","bundle":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/bundle.json","state":"https://pith.science/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5ANR2Z4NOHZVTU5KBU6CV3X7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I5ANR2Z4NOHZVTU5KBU6CV3X7T","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":"209c6628c2f9dd3e5ba6d05e22bdb77d7579628b9c8c5071515ba6373217d842","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-03T05:33:50Z","title_canon_sha256":"59d59b85b53649b1e68877a7cc2719fc7df2156a34ff88180eb887ee259424f2"},"schema_version":"1.0","source":{"id":"1603.00977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00977","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00977v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00977","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"I5ANR2Z4NOHZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I5ANR2Z4NOHZVTU5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I5ANR2Z4","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:2e4f77f20a37820777239a1aed6b1984f9c30d39854067dd646c3f172b8fa232","target":"graph","created_at":"2026-05-18T01:08:28Z","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 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","authors_text":"Abbas Nowzari-Dalini (UT, Iran), Italy), Mahdi Amani (Universit\\`a di Pisa, Pisa, Tehran","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-03T05:33:50Z","title":"Generation, Ranking and Unranking of Ordered Trees with Degree Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00977","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:6b60483ecc67e91bc596000dee01103b4a082e7a6c2d70700dfe1a30122a63ab","target":"record","created_at":"2026-05-18T01:08:28Z","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":"209c6628c2f9dd3e5ba6d05e22bdb77d7579628b9c8c5071515ba6373217d842","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-03T05:33:50Z","title_canon_sha256":"59d59b85b53649b1e68877a7cc2719fc7df2156a34ff88180eb887ee259424f2"},"schema_version":"1.0","source":{"id":"1603.00977","kind":"arxiv","version":1}},"canonical_sha256":"4740d8eb3c6b8f9ace9d5069e15777fce2a07e6633d5de3a47eef4618ceccc4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4740d8eb3c6b8f9ace9d5069e15777fce2a07e6633d5de3a47eef4618ceccc4f","first_computed_at":"2026-05-18T01:08:28.787429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.787429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ljVyxG+vA6b7EOzIPft3XjlBcXMj4RUDjC8oRAsb1nQSpI5G7458cJ899g5wcWXWgapfGxJnbKwTE0vcintBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.787994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b60483ecc67e91bc596000dee01103b4a082e7a6c2d70700dfe1a30122a63ab","sha256:2e4f77f20a37820777239a1aed6b1984f9c30d39854067dd646c3f172b8fa232"],"state_sha256":"2d0322eb6b62a6bf90c8a567e45e13d7f0b94ca15a348b387d1da02927bdbadb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXAxlUm5H9Ceca7uobjSTLDyosdYbBGC/7+xa2iOkiSqwTBvfuJEG93IQjctnNnM0XV28zinXvZkqgJp+/KeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:30:54.337426Z","bundle_sha256":"8f6e603a98c57bedec6ab1b4b3e31ddee060f5350359b73f2f30b55e3611c622"}}