{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WYCBFJGWJUHKCKMJ2BXMUR33TJ","short_pith_number":"pith:WYCBFJGW","schema_version":"1.0","canonical_sha256":"b60412a4d64d0ea12989d06eca477b9a404e024f056a25d87b7387392bddf62a","source":{"kind":"arxiv","id":"1711.08555","version":1},"attestation_state":"computed","paper":{"title":"Counting paths in perfect trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Peter J. Humphries","submitted_at":"2017-11-23T02:33:02Z","abstract_excerpt":"We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted $m$-ary trees, extending a known result for binary trees."},"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.08555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-23T02:33:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fc23a624ac08eac4c6bc3ff61c9a1e86682fc618dc9336e5f06dfc7b64b9816e","abstract_canon_sha256":"eacaef4dc894c320addf39f58dc0fedc6fcb8856daf7b363484dce75cb720521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:44.719727Z","signature_b64":"EfCI9hxp/Qg4uPARKjfagkuXSn8A0wm8+7QYdeZZ3r0nOXa9nAY+rKifTcBknSzVk6m4/fKmshgWKgFBNWnBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b60412a4d64d0ea12989d06eca477b9a404e024f056a25d87b7387392bddf62a","last_reissued_at":"2026-05-18T00:29:44.719129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:44.719129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting paths in perfect trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Peter J. Humphries","submitted_at":"2017-11-23T02:33:02Z","abstract_excerpt":"We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted $m$-ary trees, extending a known result for binary trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08555","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.08555","created_at":"2026-05-18T00:29:44.719204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08555v1","created_at":"2026-05-18T00:29:44.719204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08555","created_at":"2026-05-18T00:29:44.719204+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYCBFJGWJUHK","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYCBFJGWJUHKCKMJ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYCBFJGW","created_at":"2026-05-18T12:31:53.515858+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/WYCBFJGWJUHKCKMJ2BXMUR33TJ","json":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ.json","graph_json":"https://pith.science/api/pith-number/WYCBFJGWJUHKCKMJ2BXMUR33TJ/graph.json","events_json":"https://pith.science/api/pith-number/WYCBFJGWJUHKCKMJ2BXMUR33TJ/events.json","paper":"https://pith.science/paper/WYCBFJGW"},"agent_actions":{"view_html":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ","download_json":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ.json","view_paper":"https://pith.science/paper/WYCBFJGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08555&json=true","fetch_graph":"https://pith.science/api/pith-number/WYCBFJGWJUHKCKMJ2BXMUR33TJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WYCBFJGWJUHKCKMJ2BXMUR33TJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ/action/storage_attestation","attest_author":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ/action/author_attestation","sign_citation":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ/action/citation_signature","submit_replication":"https://pith.science/pith/WYCBFJGWJUHKCKMJ2BXMUR33TJ/action/replication_record"}},"created_at":"2026-05-18T00:29:44.719204+00:00","updated_at":"2026-05-18T00:29:44.719204+00:00"}