{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VIZEGJHYWHSSGBCRDIU55VATCR","short_pith_number":"pith:VIZEGJHY","schema_version":"1.0","canonical_sha256":"aa324324f8b1e52304511a29ded4131448369c5be311900c28d50755cf753423","source":{"kind":"arxiv","id":"2401.09764","version":1},"attestation_state":"computed","paper":{"title":"Generation of weighted trees, block trees and block graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Mehmet Aziz Yirik, Mordechai Shalom, T{\\i}naz Ekim","submitted_at":"2024-01-18T07:29:54Z","abstract_excerpt":"We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and colors of other vertices. We first extend the enumeration algorithms of unweighted trees given in [19, 20] to generate weighted trees that allow zero weight. We avoid isomorphisms by generalizing the concept of centroids to weighted trees and then using the so-called centroid-rooted canonical weighted trees. We provide a time complexity analysis of unranking algorithms and also show that the output delay complexity of"},"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":"2401.09764","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-01-18T07:29:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6afd170aa98661ae11e53a84bcac0d2bebec5cfb1e5bf09c55e8124bc3f0e453","abstract_canon_sha256":"95b27fbd4b15b321b4618e1a45031cca8713fae20a44414bc583d84ddd46a9e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:01.945769Z","signature_b64":"479GiNSR9WAtJj1mYZzxh/GqaA7sTftwIeUE7qlbhq8221yfJ2ITwX2tnWTngI8T0tD3OoBaRRJg/iPcT1TXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa324324f8b1e52304511a29ded4131448369c5be311900c28d50755cf753423","last_reissued_at":"2026-07-05T07:35:01.945400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:01.945400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generation of weighted trees, block trees and block graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Mehmet Aziz Yirik, Mordechai Shalom, T{\\i}naz Ekim","submitted_at":"2024-01-18T07:29:54Z","abstract_excerpt":"We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and colors of other vertices. We first extend the enumeration algorithms of unweighted trees given in [19, 20] to generate weighted trees that allow zero weight. We avoid isomorphisms by generalizing the concept of centroids to weighted trees and then using the so-called centroid-rooted canonical weighted trees. We provide a time complexity analysis of unranking algorithms and also show that the output delay complexity of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09764","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.09764/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.09764","created_at":"2026-07-05T07:35:01.945464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09764v1","created_at":"2026-07-05T07:35:01.945464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09764","created_at":"2026-07-05T07:35:01.945464+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIZEGJHYWHSS","created_at":"2026-07-05T07:35:01.945464+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIZEGJHYWHSSGBCR","created_at":"2026-07-05T07:35:01.945464+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIZEGJHY","created_at":"2026-07-05T07:35:01.945464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20825","citing_title":"Computer-assisted graph theory: a survey","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR","json":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR.json","graph_json":"https://pith.science/api/pith-number/VIZEGJHYWHSSGBCRDIU55VATCR/graph.json","events_json":"https://pith.science/api/pith-number/VIZEGJHYWHSSGBCRDIU55VATCR/events.json","paper":"https://pith.science/paper/VIZEGJHY"},"agent_actions":{"view_html":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR","download_json":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR.json","view_paper":"https://pith.science/paper/VIZEGJHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09764&json=true","fetch_graph":"https://pith.science/api/pith-number/VIZEGJHYWHSSGBCRDIU55VATCR/graph.json","fetch_events":"https://pith.science/api/pith-number/VIZEGJHYWHSSGBCRDIU55VATCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/action/storage_attestation","attest_author":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/action/author_attestation","sign_citation":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/action/citation_signature","submit_replication":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/action/replication_record"}},"created_at":"2026-07-05T07:35:01.945464+00:00","updated_at":"2026-07-05T07:35:01.945464+00:00"}