{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K4SAEZLDWBX5XCKSA4O63TGZSO","short_pith_number":"pith:K4SAEZLD","schema_version":"1.0","canonical_sha256":"5724026563b06fdb8952071dedccd993a18a4ddafa515fa4e5364bfed2dfc973","source":{"kind":"arxiv","id":"1711.03393","version":1},"attestation_state":"computed","paper":{"title":"On arithmetic of plane trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Yury Kochetkov","submitted_at":"2017-11-09T14:43:55Z","abstract_excerpt":"In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a prime number $p$ such, that: a) the number of edges is divisible by $p$, but not by $p^2$; b) for any proper subset of the set of white (or black) vertices the sum of their degrees is not divisible by this $p$."},"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":"1711.03393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-09T14:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"666d0d0d8fc8388f9ca72eee05a060e93087df49f8247e20539abcd27262c21d","abstract_canon_sha256":"ca981e8b284fb7d5c23b1d5f11ba4cbb9d1df6ffbad2135f94bcd08a16051e8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.272552Z","signature_b64":"akHdk3rhVDe0fNc3Fm/0zIED+mIWWWN+laYuscZyDNVheiDyiwCvIOuHODZA9FN+yT3SE9FrTf5pU2+Dq4h1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5724026563b06fdb8952071dedccd993a18a4ddafa515fa4e5364bfed2dfc973","last_reissued_at":"2026-05-18T00:30:56.271886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.271886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On arithmetic of plane trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Yury Kochetkov","submitted_at":"2017-11-09T14:43:55Z","abstract_excerpt":"In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a prime number $p$ such, that: a) the number of edges is divisible by $p$, but not by $p^2$; b) for any proper subset of the set of white (or black) vertices the sum of their degrees is not divisible by this $p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03393","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":"1711.03393","created_at":"2026-05-18T00:30:56.271978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03393v1","created_at":"2026-05-18T00:30:56.271978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03393","created_at":"2026-05-18T00:30:56.271978+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4SAEZLDWBX5","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4SAEZLDWBX5XCKS","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4SAEZLD","created_at":"2026-05-18T12:31:24.725408+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/K4SAEZLDWBX5XCKSA4O63TGZSO","json":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO.json","graph_json":"https://pith.science/api/pith-number/K4SAEZLDWBX5XCKSA4O63TGZSO/graph.json","events_json":"https://pith.science/api/pith-number/K4SAEZLDWBX5XCKSA4O63TGZSO/events.json","paper":"https://pith.science/paper/K4SAEZLD"},"agent_actions":{"view_html":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO","download_json":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO.json","view_paper":"https://pith.science/paper/K4SAEZLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03393&json=true","fetch_graph":"https://pith.science/api/pith-number/K4SAEZLDWBX5XCKSA4O63TGZSO/graph.json","fetch_events":"https://pith.science/api/pith-number/K4SAEZLDWBX5XCKSA4O63TGZSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO/action/storage_attestation","attest_author":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO/action/author_attestation","sign_citation":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO/action/citation_signature","submit_replication":"https://pith.science/pith/K4SAEZLDWBX5XCKSA4O63TGZSO/action/replication_record"}},"created_at":"2026-05-18T00:30:56.271978+00:00","updated_at":"2026-05-18T00:30:56.271978+00:00"}