{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YKL2OOSY76LPBLTKUO4QUZYUHR","short_pith_number":"pith:YKL2OOSY","schema_version":"1.0","canonical_sha256":"c297a73a58ff96f0ae6aa3b90a67143c61f2a2316ea6807b4713df7c421fb59d","source":{"kind":"arxiv","id":"2603.18542","version":2},"attestation_state":"computed","paper":{"title":"A container theorem for general digraphs with forbidden subdigraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianxi Liu, Meili Liang, Ruiling Zheng, Yue Guan","submitted_at":"2026-03-19T06:57:40Z","abstract_excerpt":"In a seminal work, K\\\"uhn, Osthus, Townsend, and Zhao used the hypergraph container method to determine the typical structure of oriented graphs and digraphs avoiding a fixed tournament or cycle. Their main tool, a container theorem for oriented graphs, does not directly extend to all digraphs due to the existence of counterexamples such as the double triangle $DK_3$. In this paper we prove a container theorem for general digraphs under a natural sparsity condition. For the edge-weight parameter $a=2$, this condition permits digraphs with $2$-cycles (density at most $1$) but excludes denser ob"},"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":"2603.18542","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-19T06:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"66b0b64eab579ad19726e2445fe6c38fcff83db8c6fd162af37a134ffcfc421d","abstract_canon_sha256":"d74c68748558cc4305a066f9e0745e6f57988dd8d315adc6768f7a66b5bc9408"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:11.508991Z","signature_b64":"cHSBYXmeZoxQc1r6xZrK7OHw/YaxmwiDAdIVFecIULNBin1cLdm4k1HW7FmXYkYnCRpxldDrIF10chAYf28BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c297a73a58ff96f0ae6aa3b90a67143c61f2a2316ea6807b4713df7c421fb59d","last_reissued_at":"2026-05-20T01:05:11.508250Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:11.508250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A container theorem for general digraphs with forbidden subdigraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianxi Liu, Meili Liang, Ruiling Zheng, Yue Guan","submitted_at":"2026-03-19T06:57:40Z","abstract_excerpt":"In a seminal work, K\\\"uhn, Osthus, Townsend, and Zhao used the hypergraph container method to determine the typical structure of oriented graphs and digraphs avoiding a fixed tournament or cycle. Their main tool, a container theorem for oriented graphs, does not directly extend to all digraphs due to the existence of counterexamples such as the double triangle $DK_3$. In this paper we prove a container theorem for general digraphs under a natural sparsity condition. For the edge-weight parameter $a=2$, this condition permits digraphs with $2$-cycles (density at most $1$) but excludes denser ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.18542","kind":"arxiv","version":2},"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/2603.18542/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":"2603.18542","created_at":"2026-05-20T01:05:11.508379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.18542v2","created_at":"2026-05-20T01:05:11.508379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18542","created_at":"2026-05-20T01:05:11.508379+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKL2OOSY76LP","created_at":"2026-05-20T01:05:11.508379+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKL2OOSY76LPBLTK","created_at":"2026-05-20T01:05:11.508379+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKL2OOSY","created_at":"2026-05-20T01:05:11.508379+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/YKL2OOSY76LPBLTKUO4QUZYUHR","json":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR.json","graph_json":"https://pith.science/api/pith-number/YKL2OOSY76LPBLTKUO4QUZYUHR/graph.json","events_json":"https://pith.science/api/pith-number/YKL2OOSY76LPBLTKUO4QUZYUHR/events.json","paper":"https://pith.science/paper/YKL2OOSY"},"agent_actions":{"view_html":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR","download_json":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR.json","view_paper":"https://pith.science/paper/YKL2OOSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.18542&json=true","fetch_graph":"https://pith.science/api/pith-number/YKL2OOSY76LPBLTKUO4QUZYUHR/graph.json","fetch_events":"https://pith.science/api/pith-number/YKL2OOSY76LPBLTKUO4QUZYUHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR/action/storage_attestation","attest_author":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR/action/author_attestation","sign_citation":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR/action/citation_signature","submit_replication":"https://pith.science/pith/YKL2OOSY76LPBLTKUO4QUZYUHR/action/replication_record"}},"created_at":"2026-05-20T01:05:11.508379+00:00","updated_at":"2026-05-20T01:05:11.508379+00:00"}