{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M4NR63KDZENPBNLBMGTGZH4HAB","short_pith_number":"pith:M4NR63KD","schema_version":"1.0","canonical_sha256":"671b1f6d43c91af0b56161a66c9f870058fca9f4a65214053becf1463ba4e151","source":{"kind":"arxiv","id":"1310.6208","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of one class of plane weighted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2013-10-23T12:51:25Z","abstract_excerpt":"By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we can color its vertices in two colors, black and white so, that adjacent vertices have different colors. A type is a set of pairwise non-isotopic plane weighted trees with a given list of weights of white vertices and a given list of weights of black vertices. In this work we present a method for computing the cardinality of a given type."},"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":"1310.6208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-23T12:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"fe269a9397bd42d0f3042190721fb6c853e02bd5d6e2b09a565303a9e94416d9","abstract_canon_sha256":"ee16e128fd234fcc3c5526898c1f9f8bd34ecf039ca2d021740ee0410c9dfd40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:21.055440Z","signature_b64":"L7QHyt0Z+KHW4kPzGlMtHgnkGcCshoOvIiYu2XcloOGcQ5OG9zjbvJvW8/eKhamP+PAoWPc9e5JjV2Dr2ZxwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"671b1f6d43c91af0b56161a66c9f870058fca9f4a65214053becf1463ba4e151","last_reissued_at":"2026-05-18T03:09:21.054562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:21.054562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of one class of plane weighted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2013-10-23T12:51:25Z","abstract_excerpt":"By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we can color its vertices in two colors, black and white so, that adjacent vertices have different colors. A type is a set of pairwise non-isotopic plane weighted trees with a given list of weights of white vertices and a given list of weights of black vertices. In this work we present a method for computing the cardinality of a given type."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6208","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":"1310.6208","created_at":"2026-05-18T03:09:21.054710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6208v1","created_at":"2026-05-18T03:09:21.054710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6208","created_at":"2026-05-18T03:09:21.054710+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4NR63KDZENP","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4NR63KDZENPBNLB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4NR63KD","created_at":"2026-05-18T12:27:51.066281+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/M4NR63KDZENPBNLBMGTGZH4HAB","json":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB.json","graph_json":"https://pith.science/api/pith-number/M4NR63KDZENPBNLBMGTGZH4HAB/graph.json","events_json":"https://pith.science/api/pith-number/M4NR63KDZENPBNLBMGTGZH4HAB/events.json","paper":"https://pith.science/paper/M4NR63KD"},"agent_actions":{"view_html":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB","download_json":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB.json","view_paper":"https://pith.science/paper/M4NR63KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6208&json=true","fetch_graph":"https://pith.science/api/pith-number/M4NR63KDZENPBNLBMGTGZH4HAB/graph.json","fetch_events":"https://pith.science/api/pith-number/M4NR63KDZENPBNLBMGTGZH4HAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB/action/storage_attestation","attest_author":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB/action/author_attestation","sign_citation":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB/action/citation_signature","submit_replication":"https://pith.science/pith/M4NR63KDZENPBNLBMGTGZH4HAB/action/replication_record"}},"created_at":"2026-05-18T03:09:21.054710+00:00","updated_at":"2026-05-18T03:09:21.054710+00:00"}