{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QRK2UIYUUNQTZJZJYSF6PVVLUP","short_pith_number":"pith:QRK2UIYU","schema_version":"1.0","canonical_sha256":"8455aa2314a3613ca729c48be7d6aba3d62c3afa301e2ead0026798bcac62a03","source":{"kind":"arxiv","id":"2404.10750","version":3},"attestation_state":"computed","paper":{"title":"Antidirected trees in dense digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ana Trujillo-Negrete, Maya Stein","submitted_at":"2024-04-16T17:31:39Z","abstract_excerpt":"We show that if $D$ is an $n$-vertex digraph with more than $(k-1)n$ arcs that does not contain any of three forbidden digraphs, then $D$ contains every antidirected tree on $k$ arcs. The forbidden digraphs are those orientations of $K_{2, \\lceil k/12\\rceil}$ where each of the vertices in the class of size two has either out-degree $0$ or in-degree $0$. This proves a conjecture of Addario-Berry et al. for a broad class of digraphs, and generalises a result for $K_{2, \\lfloor k/12\\rfloor}$-free graphs by Balasubramanian and Dobson.\n  We also show that every digraph $D$ on $n$ vertices with more"},"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":"2404.10750","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-16T17:31:39Z","cross_cats_sorted":[],"title_canon_sha256":"4dad194482572972c828c4bc94c021b1476b6552c5022bd361a9a9064f34a410","abstract_canon_sha256":"b1f23aa6b22956c7d774ac79a0d4451d9f9980864fa2a68839c8ed93ad19e054"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:26.412882Z","signature_b64":"q2l+hEg8ppoizm0kspowQydDPh9SIZEmQKRbm9ZMdADUkM5oDLjbxRT6tOVPtIXkSx5Ie/cQeOerzdyVclZcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8455aa2314a3613ca729c48be7d6aba3d62c3afa301e2ead0026798bcac62a03","last_reissued_at":"2026-07-05T09:21:26.412387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:26.412387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Antidirected trees in dense digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ana Trujillo-Negrete, Maya Stein","submitted_at":"2024-04-16T17:31:39Z","abstract_excerpt":"We show that if $D$ is an $n$-vertex digraph with more than $(k-1)n$ arcs that does not contain any of three forbidden digraphs, then $D$ contains every antidirected tree on $k$ arcs. The forbidden digraphs are those orientations of $K_{2, \\lceil k/12\\rceil}$ where each of the vertices in the class of size two has either out-degree $0$ or in-degree $0$. This proves a conjecture of Addario-Berry et al. for a broad class of digraphs, and generalises a result for $K_{2, \\lfloor k/12\\rfloor}$-free graphs by Balasubramanian and Dobson.\n  We also show that every digraph $D$ on $n$ vertices with more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10750","kind":"arxiv","version":3},"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/2404.10750/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":"2404.10750","created_at":"2026-07-05T09:21:26.412449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.10750v3","created_at":"2026-07-05T09:21:26.412449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10750","created_at":"2026-07-05T09:21:26.412449+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRK2UIYUUNQT","created_at":"2026-07-05T09:21:26.412449+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRK2UIYUUNQTZJZJ","created_at":"2026-07-05T09:21:26.412449+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRK2UIYU","created_at":"2026-07-05T09:21:26.412449+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13483","citing_title":"Oriented Trees in Digraphs without Oriented $4$-cycles","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP","json":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP.json","graph_json":"https://pith.science/api/pith-number/QRK2UIYUUNQTZJZJYSF6PVVLUP/graph.json","events_json":"https://pith.science/api/pith-number/QRK2UIYUUNQTZJZJYSF6PVVLUP/events.json","paper":"https://pith.science/paper/QRK2UIYU"},"agent_actions":{"view_html":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP","download_json":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP.json","view_paper":"https://pith.science/paper/QRK2UIYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.10750&json=true","fetch_graph":"https://pith.science/api/pith-number/QRK2UIYUUNQTZJZJYSF6PVVLUP/graph.json","fetch_events":"https://pith.science/api/pith-number/QRK2UIYUUNQTZJZJYSF6PVVLUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/action/storage_attestation","attest_author":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/action/author_attestation","sign_citation":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/action/citation_signature","submit_replication":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/action/replication_record"}},"created_at":"2026-07-05T09:21:26.412449+00:00","updated_at":"2026-07-05T09:21:26.412449+00:00"}