{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5WGXG7FVRRV4D6X3UFFHYZ6LH7","short_pith_number":"pith:5WGXG7FV","schema_version":"1.0","canonical_sha256":"ed8d737cb58c6bc1fafba14a7c67cb3fcffc6c092373d8e53850af775e208727","source":{"kind":"arxiv","id":"1412.2472","version":1},"attestation_state":"computed","paper":{"title":"Short catalog of plane ten-edge trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2014-12-08T07:56:58Z","abstract_excerpt":"A type is the set of all pairwise nonisotopic binary trees with the same passport. A type is called decomposable, if it is a union of several Galois orbits. In this work we present the list of all passports of plane binary trees with ten edges and the list of all Galois orbits."},"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":"1412.2472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T07:56:58Z","cross_cats_sorted":[],"title_canon_sha256":"80ed4fcd4368784d1d68ea6c3fe17ad893da6c0a68ab7bba98fdf17dcf21da7e","abstract_canon_sha256":"db18f242fc07f52cd9ec469eb62e30f581efff09950f2b6fa53ee176d12a0ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:57.883097Z","signature_b64":"CSK4OLAfJ9fyWCUNur8GElZUidbx4mKSBw20gDYRmHbV9owj/rgId2URw56Dpav4XikiyReg3j0gy0y5ugA4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed8d737cb58c6bc1fafba14a7c67cb3fcffc6c092373d8e53850af775e208727","last_reissued_at":"2026-05-18T02:31:57.882541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:57.882541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short catalog of plane ten-edge trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yury Kochetkov","submitted_at":"2014-12-08T07:56:58Z","abstract_excerpt":"A type is the set of all pairwise nonisotopic binary trees with the same passport. A type is called decomposable, if it is a union of several Galois orbits. In this work we present the list of all passports of plane binary trees with ten edges and the list of all Galois orbits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2472","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":"1412.2472","created_at":"2026-05-18T02:31:57.882643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2472v1","created_at":"2026-05-18T02:31:57.882643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2472","created_at":"2026-05-18T02:31:57.882643+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WGXG7FVRRV4","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WGXG7FVRRV4D6X3","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WGXG7FV","created_at":"2026-05-18T12:28:16.859392+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/5WGXG7FVRRV4D6X3UFFHYZ6LH7","json":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7.json","graph_json":"https://pith.science/api/pith-number/5WGXG7FVRRV4D6X3UFFHYZ6LH7/graph.json","events_json":"https://pith.science/api/pith-number/5WGXG7FVRRV4D6X3UFFHYZ6LH7/events.json","paper":"https://pith.science/paper/5WGXG7FV"},"agent_actions":{"view_html":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7","download_json":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7.json","view_paper":"https://pith.science/paper/5WGXG7FV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2472&json=true","fetch_graph":"https://pith.science/api/pith-number/5WGXG7FVRRV4D6X3UFFHYZ6LH7/graph.json","fetch_events":"https://pith.science/api/pith-number/5WGXG7FVRRV4D6X3UFFHYZ6LH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7/action/storage_attestation","attest_author":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7/action/author_attestation","sign_citation":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7/action/citation_signature","submit_replication":"https://pith.science/pith/5WGXG7FVRRV4D6X3UFFHYZ6LH7/action/replication_record"}},"created_at":"2026-05-18T02:31:57.882643+00:00","updated_at":"2026-05-18T02:31:57.882643+00:00"}