{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M3JFCLWPDBO3PRF77IFWETBKB6","short_pith_number":"pith:M3JFCLWP","schema_version":"1.0","canonical_sha256":"66d2512ecf185db7c4bffa0b624c2a0f9db96c24f4783c2f4496d1cd41cf711d","source":{"kind":"arxiv","id":"1611.01010","version":1},"attestation_state":"computed","paper":{"title":"Even and odd plane labelled bipartite trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2016-11-03T13:44:45Z","abstract_excerpt":"Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od \"even\" trees and subset of \"odd\" trees. This partition has a clear geometric meaning."},"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":"1611.01010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T13:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"5e83f4890f0cf55137f17fb3bccf8cf91b17938a03ae59fe5754d7c2ab025999","abstract_canon_sha256":"a2c54fa9616da9aa0604d6d42a3699475aa9b25774edf95b1def4d9fca18f57b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:17.930828Z","signature_b64":"tqDML0DLEyLRYOuD3PGWPrSju3uHdO+8bLQnbrBc+2+SgeGSsq1GVRP+tUJj6pWC2JuWMpcJPWGRYwHpYY+XCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d2512ecf185db7c4bffa0b624c2a0f9db96c24f4783c2f4496d1cd41cf711d","last_reissued_at":"2026-05-18T01:00:17.930122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:17.930122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even and odd plane labelled bipartite trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2016-11-03T13:44:45Z","abstract_excerpt":"Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od \"even\" trees and subset of \"odd\" trees. This partition has a clear geometric meaning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01010","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":"1611.01010","created_at":"2026-05-18T01:00:17.930226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01010v1","created_at":"2026-05-18T01:00:17.930226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01010","created_at":"2026-05-18T01:00:17.930226+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3JFCLWPDBO3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3JFCLWPDBO3PRF7","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3JFCLWP","created_at":"2026-05-18T12:30:29.479603+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/M3JFCLWPDBO3PRF77IFWETBKB6","json":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6.json","graph_json":"https://pith.science/api/pith-number/M3JFCLWPDBO3PRF77IFWETBKB6/graph.json","events_json":"https://pith.science/api/pith-number/M3JFCLWPDBO3PRF77IFWETBKB6/events.json","paper":"https://pith.science/paper/M3JFCLWP"},"agent_actions":{"view_html":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6","download_json":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6.json","view_paper":"https://pith.science/paper/M3JFCLWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01010&json=true","fetch_graph":"https://pith.science/api/pith-number/M3JFCLWPDBO3PRF77IFWETBKB6/graph.json","fetch_events":"https://pith.science/api/pith-number/M3JFCLWPDBO3PRF77IFWETBKB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6/action/storage_attestation","attest_author":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6/action/author_attestation","sign_citation":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6/action/citation_signature","submit_replication":"https://pith.science/pith/M3JFCLWPDBO3PRF77IFWETBKB6/action/replication_record"}},"created_at":"2026-05-18T01:00:17.930226+00:00","updated_at":"2026-05-18T01:00:17.930226+00:00"}