{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D2VC6R3MKMA37GB667TT32SLQL","short_pith_number":"pith:D2VC6R3M","schema_version":"1.0","canonical_sha256":"1eaa2f476c5301bf983ef7e73dea4b82d28ee1fc7dc76efaca314885ae86422f","source":{"kind":"arxiv","id":"2507.11814","version":1},"attestation_state":"computed","paper":{"title":"Unavoidable butterfly minors in digraphs of large cycle rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Meike Hatzel, Myounghwan Lee, O-joung Kwon, Sebastian Wiederrecht","submitted_at":"2025-07-16T00:24:53Z","abstract_excerpt":"Cycle rank is one of the depth parameters for digraphs introduced by Eggan in 1963. We show that there exists a function $f:\\mathbb{N}\\to \\mathbb{N}$ such that every digraph of cycle rank at least $f(k)$ contains a directed cycle chain, a directed ladder, or a directed tree chain of order $k$ as a butterfly minor. We also investigate a new connection between cycle rank and a directed analogue of the weak coloring number of graphs."},"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":"2507.11814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T00:24:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f82da0633617fffda07d11a1b60d1810c0d4fda650a266eeea827ed7a39e1748","abstract_canon_sha256":"ebf8d9c246c2d18cad7b21de5ff6fe3c30bbfaa71919a56f010e5bbfea59fb2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:51.343480Z","signature_b64":"zom/+MlAunyifEgXPQU1aqE3hwb5soRv3Fv7AuibQHnDmEKIZE7blr7B6p3cRK8IIKZSXv5Gh2CLXMHKrLUEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eaa2f476c5301bf983ef7e73dea4b82d28ee1fc7dc76efaca314885ae86422f","last_reissued_at":"2026-07-05T11:37:51.342926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:51.342926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unavoidable butterfly minors in digraphs of large cycle rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Meike Hatzel, Myounghwan Lee, O-joung Kwon, Sebastian Wiederrecht","submitted_at":"2025-07-16T00:24:53Z","abstract_excerpt":"Cycle rank is one of the depth parameters for digraphs introduced by Eggan in 1963. We show that there exists a function $f:\\mathbb{N}\\to \\mathbb{N}$ such that every digraph of cycle rank at least $f(k)$ contains a directed cycle chain, a directed ladder, or a directed tree chain of order $k$ as a butterfly minor. We also investigate a new connection between cycle rank and a directed analogue of the weak coloring number of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11814","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/2507.11814/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":"2507.11814","created_at":"2026-07-05T11:37:51.342998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11814v1","created_at":"2026-07-05T11:37:51.342998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11814","created_at":"2026-07-05T11:37:51.342998+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2VC6R3MKMA3","created_at":"2026-07-05T11:37:51.342998+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2VC6R3MKMA37GB6","created_at":"2026-07-05T11:37:51.342998+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2VC6R3M","created_at":"2026-07-05T11:37:51.342998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29336","citing_title":"An FPT algorithm for cycle rank on semi-complete digraphs","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL","json":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL.json","graph_json":"https://pith.science/api/pith-number/D2VC6R3MKMA37GB667TT32SLQL/graph.json","events_json":"https://pith.science/api/pith-number/D2VC6R3MKMA37GB667TT32SLQL/events.json","paper":"https://pith.science/paper/D2VC6R3M"},"agent_actions":{"view_html":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL","download_json":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL.json","view_paper":"https://pith.science/paper/D2VC6R3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11814&json=true","fetch_graph":"https://pith.science/api/pith-number/D2VC6R3MKMA37GB667TT32SLQL/graph.json","fetch_events":"https://pith.science/api/pith-number/D2VC6R3MKMA37GB667TT32SLQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/action/storage_attestation","attest_author":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/action/author_attestation","sign_citation":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/action/citation_signature","submit_replication":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/action/replication_record"}},"created_at":"2026-07-05T11:37:51.342998+00:00","updated_at":"2026-07-05T11:37:51.342998+00:00"}