{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XKRJ4DDLCYUFDNDFAEJ25ZGZKJ","short_pith_number":"pith:XKRJ4DDL","schema_version":"1.0","canonical_sha256":"baa29e0c6b162851b4650113aee4d9525b7200a6f042dc558e8c8ab73d390c09","source":{"kind":"arxiv","id":"1607.00804","version":1},"attestation_state":"computed","paper":{"title":"Counting Contours on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Ossami Endo, Noga Alon, Rodrigo Bissacot","submitted_at":"2016-07-04T09:54:18Z","abstract_excerpt":"We calculate the exact number of contours of size $n$ containing a fixed vertex in $d$-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex."},"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":"1607.00804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-04T09:54:18Z","cross_cats_sorted":[],"title_canon_sha256":"7cd33b817ab9f693435da7f18566b6bd7949e9c95c04e5d62c380f747a671d42","abstract_canon_sha256":"2fd1d7c48484b25ee919d7bb584f167afadfc075cd760a323f7d8c4179c225c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:35.794032Z","signature_b64":"J3NkXxJ8SrPKRQkwJDbTUvxwnsoRmsg8smC6xeHma7UnI+3ACAWJkIAH9EpuJbaublGcCxcGyaYT3qGM5zmvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baa29e0c6b162851b4650113aee4d9525b7200a6f042dc558e8c8ab73d390c09","last_reissued_at":"2026-05-18T00:54:35.793430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:35.793430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Contours on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Ossami Endo, Noga Alon, Rodrigo Bissacot","submitted_at":"2016-07-04T09:54:18Z","abstract_excerpt":"We calculate the exact number of contours of size $n$ containing a fixed vertex in $d$-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with infinitely many contours of the same size containing a fixed vertex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00804","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":"1607.00804","created_at":"2026-05-18T00:54:35.793511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00804v1","created_at":"2026-05-18T00:54:35.793511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00804","created_at":"2026-05-18T00:54:35.793511+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKRJ4DDLCYUF","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKRJ4DDLCYUFDNDF","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKRJ4DDL","created_at":"2026-05-18T12:30:51.357362+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/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ","json":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ.json","graph_json":"https://pith.science/api/pith-number/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/graph.json","events_json":"https://pith.science/api/pith-number/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/events.json","paper":"https://pith.science/paper/XKRJ4DDL"},"agent_actions":{"view_html":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ","download_json":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ.json","view_paper":"https://pith.science/paper/XKRJ4DDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00804&json=true","fetch_graph":"https://pith.science/api/pith-number/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/action/storage_attestation","attest_author":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/action/author_attestation","sign_citation":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/action/citation_signature","submit_replication":"https://pith.science/pith/XKRJ4DDLCYUFDNDFAEJ25ZGZKJ/action/replication_record"}},"created_at":"2026-05-18T00:54:35.793511+00:00","updated_at":"2026-05-18T00:54:35.793511+00:00"}