{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VIZEGJHYWHSSGBCRDIU55VATCR","short_pith_number":"pith:VIZEGJHY","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"},"canonical_sha256":"aa324324f8b1e52304511a29ded4131448369c5be311900c28d50755cf753423","source":{"kind":"arxiv","id":"2401.09764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.09764","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"2401.09764v1","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09764","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"VIZEGJHYWHSS","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"pith_short_16","alias_value":"VIZEGJHYWHSSGBCR","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"pith_short_8","alias_value":"VIZEGJHY","created_at":"2026-07-05T07:35:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VIZEGJHYWHSSGBCRDIU55VATCR","target":"record","payload":{"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"},"canonical_sha256":"aa324324f8b1e52304511a29ded4131448369c5be311900c28d50755cf753423","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"},"source_kind":"arxiv","source_id":"2401.09764","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-07-05T07:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLUdWR7oiEy5PixPZPyiH6XYhJzRLq6U7RIqsAETXZ4aj1jASP9chIs8XLPnP/Kk3ET+NZar5rsqWICLvr2YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:53:07.980974Z"},"content_sha256":"99f3013238a3e010bf164941022ec8a3bb6df947c5752da45e465e8a8c35c669","schema_version":"1.0","event_id":"sha256:99f3013238a3e010bf164941022ec8a3bb6df947c5752da45e465e8a8c35c669"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VIZEGJHYWHSSGBCRDIU55VATCR","target":"graph","payload":{"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"},"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-07-05T07:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Re7FuwQXjlfdlGRrr1tfEitkwhDcmV6g5/7ZWnbbW0fqNiiJ6Wm2sbDGfc9s9/9X/b0nPq29boHSnlON/EhFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:53:07.981490Z"},"content_sha256":"4759a694d4a6391f6284db04d73efc85d56430df71fbb45d2e7d5261f79c7a8e","schema_version":"1.0","event_id":"sha256:4759a694d4a6391f6284db04d73efc85d56430df71fbb45d2e7d5261f79c7a8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/bundle.json","state_url":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIZEGJHYWHSSGBCRDIU55VATCR/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-08-08T20:53:07Z","links":{"resolver":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR","bundle":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/bundle.json","state":"https://pith.science/pith/VIZEGJHYWHSSGBCRDIU55VATCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIZEGJHYWHSSGBCRDIU55VATCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VIZEGJHYWHSSGBCRDIU55VATCR","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":"95b27fbd4b15b321b4618e1a45031cca8713fae20a44414bc583d84ddd46a9e9","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-01-18T07:29:54Z","title_canon_sha256":"6afd170aa98661ae11e53a84bcac0d2bebec5cfb1e5bf09c55e8124bc3f0e453"},"schema_version":"1.0","source":{"id":"2401.09764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.09764","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"2401.09764v1","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09764","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"VIZEGJHYWHSS","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"pith_short_16","alias_value":"VIZEGJHYWHSSGBCR","created_at":"2026-07-05T07:35:01Z"},{"alias_kind":"pith_short_8","alias_value":"VIZEGJHY","created_at":"2026-07-05T07:35:01Z"}],"graph_snapshots":[{"event_id":"sha256:4759a694d4a6391f6284db04d73efc85d56430df71fbb45d2e7d5261f79c7a8e","target":"graph","created_at":"2026-07-05T07:35:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.09764/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mehmet Aziz Yirik, Mordechai Shalom, T{\\i}naz Ekim","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-01-18T07:29:54Z","title":"Generation of weighted trees, block trees and block graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09764","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:99f3013238a3e010bf164941022ec8a3bb6df947c5752da45e465e8a8c35c669","target":"record","created_at":"2026-07-05T07:35:01Z","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":"95b27fbd4b15b321b4618e1a45031cca8713fae20a44414bc583d84ddd46a9e9","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-01-18T07:29:54Z","title_canon_sha256":"6afd170aa98661ae11e53a84bcac0d2bebec5cfb1e5bf09c55e8124bc3f0e453"},"schema_version":"1.0","source":{"id":"2401.09764","kind":"arxiv","version":1}},"canonical_sha256":"aa324324f8b1e52304511a29ded4131448369c5be311900c28d50755cf753423","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa324324f8b1e52304511a29ded4131448369c5be311900c28d50755cf753423","first_computed_at":"2026-07-05T07:35:01.945400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:01.945400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"479GiNSR9WAtJj1mYZzxh/GqaA7sTftwIeUE7qlbhq8221yfJ2ITwX2tnWTngI8T0tD3OoBaRRJg/iPcT1TXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:01.945769Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.09764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99f3013238a3e010bf164941022ec8a3bb6df947c5752da45e465e8a8c35c669","sha256:4759a694d4a6391f6284db04d73efc85d56430df71fbb45d2e7d5261f79c7a8e"],"state_sha256":"f7ab095d82d4918fa16a69215dbc0d68b4b2f7874fb3ff9d66d65822d46d0206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ir9jvcNeYvbVsBsksugt4CshvjeNsCYNQCYnzuYZAj4P9PSRNGMq6LdsiMzq/e0iKIPLGBo9w6cpZNyCIxWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:53:07.985213Z","bundle_sha256":"a4b1b2d3b9f8ff53b70e09130ddbff6666eba66fb6a95180a5dbd09f1bcffee3"}}