{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QVX7BGRFYXMRHGLM4G44WTYURM","short_pith_number":"pith:QVX7BGRF","schema_version":"1.0","canonical_sha256":"856ff09a25c5d913996ce1b9cb4f148b3bb66db3421ad61d6b1ba84c1d1476fe","source":{"kind":"arxiv","id":"2505.21367","version":1},"attestation_state":"computed","paper":{"title":"Proof of the KAMAK tree conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Micha Christoph, Raphael Steiner","submitted_at":"2025-05-27T15:57:13Z","abstract_excerpt":"There are many intriguing questions in extremal graph theory that are well-understood in the undirected setting and yet remain elusive for digraphs. A natural instance of such a problem was recently studied by Hons, Klimo\\v{s}ov\\'{a}, Kucheriya, Mik\\v{s}an\\'{i}k, Tkadlec and Tyomkyn: What are the digraphs that have to appear as a subgraph in all digraphs of sufficiently large minimum out-degree? Hons et al. showed that all such digraphs must be oriented forests with a specific structure, and conjectured that vice-versa all oriented forests with this specific structure appear in any digraph of "},"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":"2505.21367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"35306c0403f74b0434f1fd1676b6e33375cbe8be24450161d01aaea6a5cd6788","abstract_canon_sha256":"2526ad3d70b95872acd09733ae46d3e5ec1ed7205aff90e0e959a42cadd8f3f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:40.827742Z","signature_b64":"KsE8vY8kJI3UTGlNGaBmQU7CtiHOD1Y8RsOvTwc3cEtvuCVbxmneVMkBn9re7hBnCdQSyj8+Ar90F0hcHgM4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"856ff09a25c5d913996ce1b9cb4f148b3bb66db3421ad61d6b1ba84c1d1476fe","last_reissued_at":"2026-07-05T11:10:40.827219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:40.827219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of the KAMAK tree conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Micha Christoph, Raphael Steiner","submitted_at":"2025-05-27T15:57:13Z","abstract_excerpt":"There are many intriguing questions in extremal graph theory that are well-understood in the undirected setting and yet remain elusive for digraphs. A natural instance of such a problem was recently studied by Hons, Klimo\\v{s}ov\\'{a}, Kucheriya, Mik\\v{s}an\\'{i}k, Tkadlec and Tyomkyn: What are the digraphs that have to appear as a subgraph in all digraphs of sufficiently large minimum out-degree? Hons et al. showed that all such digraphs must be oriented forests with a specific structure, and conjectured that vice-versa all oriented forests with this specific structure appear in any digraph of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21367","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.21367/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.21367","created_at":"2026-07-05T11:10:40.827281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21367v1","created_at":"2026-07-05T11:10:40.827281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21367","created_at":"2026-07-05T11:10:40.827281+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVX7BGRFYXMR","created_at":"2026-07-05T11:10:40.827281+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVX7BGRFYXMRHGLM","created_at":"2026-07-05T11:10:40.827281+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVX7BGRF","created_at":"2026-07-05T11:10:40.827281+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/QVX7BGRFYXMRHGLM4G44WTYURM","json":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM.json","graph_json":"https://pith.science/api/pith-number/QVX7BGRFYXMRHGLM4G44WTYURM/graph.json","events_json":"https://pith.science/api/pith-number/QVX7BGRFYXMRHGLM4G44WTYURM/events.json","paper":"https://pith.science/paper/QVX7BGRF"},"agent_actions":{"view_html":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM","download_json":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM.json","view_paper":"https://pith.science/paper/QVX7BGRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21367&json=true","fetch_graph":"https://pith.science/api/pith-number/QVX7BGRFYXMRHGLM4G44WTYURM/graph.json","fetch_events":"https://pith.science/api/pith-number/QVX7BGRFYXMRHGLM4G44WTYURM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM/action/storage_attestation","attest_author":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM/action/author_attestation","sign_citation":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM/action/citation_signature","submit_replication":"https://pith.science/pith/QVX7BGRFYXMRHGLM4G44WTYURM/action/replication_record"}},"created_at":"2026-07-05T11:10:40.827281+00:00","updated_at":"2026-07-05T11:10:40.827281+00:00"}