{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QRK2UIYUUNQTZJZJYSF6PVVLUP","short_pith_number":"pith:QRK2UIYU","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"},"canonical_sha256":"8455aa2314a3613ca729c48be7d6aba3d62c3afa301e2ead0026798bcac62a03","source":{"kind":"arxiv","id":"2404.10750","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.10750","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.10750v3","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10750","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"QRK2UIYUUNQT","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"pith_short_16","alias_value":"QRK2UIYUUNQTZJZJ","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"pith_short_8","alias_value":"QRK2UIYU","created_at":"2026-07-05T09:21:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QRK2UIYUUNQTZJZJYSF6PVVLUP","target":"record","payload":{"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"},"canonical_sha256":"8455aa2314a3613ca729c48be7d6aba3d62c3afa301e2ead0026798bcac62a03","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"},"source_kind":"arxiv","source_id":"2404.10750","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oLAbWMwV5IAHvjXflLTFx7Ph9PwKmIULTgVGqCnSgZ6ySIQpO0pwiSYdVWjpdGAmt8PqUzr0IQznP6s9JC+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T00:40:45.271227Z"},"content_sha256":"f46b329136d0dfdc8535a11bf6582487e40497490bb902ebced9f992d682c6e2","schema_version":"1.0","event_id":"sha256:f46b329136d0dfdc8535a11bf6582487e40497490bb902ebced9f992d682c6e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QRK2UIYUUNQTZJZJYSF6PVVLUP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5i5NxcaYWIHYywwL+a7Y9vP/xaOQHyyUJtEwkWMifYiBRk9l4LsAjWQcZK/EFjeRb1TAKU44gh3mnBKR0oBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T00:40:45.271807Z"},"content_sha256":"00807246f02ae718939d4e5de0155d247f844374fea4713fac1d05a0cdf9603f","schema_version":"1.0","event_id":"sha256:00807246f02ae718939d4e5de0155d247f844374fea4713fac1d05a0cdf9603f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/bundle.json","state_url":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T00:40:45Z","links":{"resolver":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP","bundle":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/bundle.json","state":"https://pith.science/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRK2UIYUUNQTZJZJYSF6PVVLUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QRK2UIYUUNQTZJZJYSF6PVVLUP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b1f23aa6b22956c7d774ac79a0d4451d9f9980864fa2a68839c8ed93ad19e054","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-16T17:31:39Z","title_canon_sha256":"4dad194482572972c828c4bc94c021b1476b6552c5022bd361a9a9064f34a410"},"schema_version":"1.0","source":{"id":"2404.10750","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.10750","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.10750v3","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10750","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"QRK2UIYUUNQT","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"pith_short_16","alias_value":"QRK2UIYUUNQTZJZJ","created_at":"2026-07-05T09:21:26Z"},{"alias_kind":"pith_short_8","alias_value":"QRK2UIYU","created_at":"2026-07-05T09:21:26Z"}],"graph_snapshots":[{"event_id":"sha256:00807246f02ae718939d4e5de0155d247f844374fea4713fac1d05a0cdf9603f","target":"graph","created_at":"2026-07-05T09:21:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.10750/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ana Trujillo-Negrete, Maya Stein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-16T17:31:39Z","title":"Antidirected trees in dense digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10750","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f46b329136d0dfdc8535a11bf6582487e40497490bb902ebced9f992d682c6e2","target":"record","created_at":"2026-07-05T09:21:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b1f23aa6b22956c7d774ac79a0d4451d9f9980864fa2a68839c8ed93ad19e054","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-16T17:31:39Z","title_canon_sha256":"4dad194482572972c828c4bc94c021b1476b6552c5022bd361a9a9064f34a410"},"schema_version":"1.0","source":{"id":"2404.10750","kind":"arxiv","version":3}},"canonical_sha256":"8455aa2314a3613ca729c48be7d6aba3d62c3afa301e2ead0026798bcac62a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8455aa2314a3613ca729c48be7d6aba3d62c3afa301e2ead0026798bcac62a03","first_computed_at":"2026-07-05T09:21:26.412387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:21:26.412387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q2l+hEg8ppoizm0kspowQydDPh9SIZEmQKRbm9ZMdADUkM5oDLjbxRT6tOVPtIXkSx5Ie/cQeOerzdyVclZcBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:21:26.412882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.10750","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f46b329136d0dfdc8535a11bf6582487e40497490bb902ebced9f992d682c6e2","sha256:00807246f02ae718939d4e5de0155d247f844374fea4713fac1d05a0cdf9603f"],"state_sha256":"03f2377e838f2eab1b4357969434f446f491abfbd8f8bb1edccf0cedbfee8183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+k0hPteWz4Y5Qb1g4kahqZTJQ7tbcA5m9YR1RmoG+Tez9AqtWrsJ5i5vySyjA2BpfWXyg1+//y7Te/UzOgICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T00:40:45.276224Z","bundle_sha256":"4518d9052f83b3bf243b195a05fcdad12dc031c4a6693324ca9f64459b7e5e0e"}}