{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:D2VC6R3MKMA37GB667TT32SLQL","short_pith_number":"pith:D2VC6R3M","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"},"canonical_sha256":"1eaa2f476c5301bf983ef7e73dea4b82d28ee1fc7dc76efaca314885ae86422f","source":{"kind":"arxiv","id":"2507.11814","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11814","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11814v1","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11814","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"D2VC6R3MKMA3","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"pith_short_16","alias_value":"D2VC6R3MKMA37GB6","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"pith_short_8","alias_value":"D2VC6R3M","created_at":"2026-07-05T11:37:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:D2VC6R3MKMA37GB667TT32SLQL","target":"record","payload":{"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"},"canonical_sha256":"1eaa2f476c5301bf983ef7e73dea4b82d28ee1fc7dc76efaca314885ae86422f","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"},"source_kind":"arxiv","source_id":"2507.11814","source_version":1,"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-05T11:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KwckTMqMJ1w9j+kPuIsCmuh91LR5cA5VtAwOlW/NFY3gmsHBGbvSxfVrEU7P3fFA5L4D4mHHOIAPmIiOCF/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:37:02.677820Z"},"content_sha256":"4e146d816dbff93ccedfc8264c1b3da4f9e6d01492f08ba97fcca9f8ff3df1aa","schema_version":"1.0","event_id":"sha256:4e146d816dbff93ccedfc8264c1b3da4f9e6d01492f08ba97fcca9f8ff3df1aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:D2VC6R3MKMA37GB667TT32SLQL","target":"graph","payload":{"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"},"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-05T11:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQKNjQz3RH4y+7V+2jk0Rji2TuNAf1cnN3giPyd3m32mEcGbq9/zV4xkZRFc774siKho6PCrjMHOd6kqRibADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:37:02.678409Z"},"content_sha256":"262d8d9a36859fe9d856e5809d98d1633b21cb84aa0213e4f7f742425c2c6b2d","schema_version":"1.0","event_id":"sha256:262d8d9a36859fe9d856e5809d98d1633b21cb84aa0213e4f7f742425c2c6b2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/bundle.json","state_url":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2VC6R3MKMA37GB667TT32SLQL/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-08T00:37:02Z","links":{"resolver":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL","bundle":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/bundle.json","state":"https://pith.science/pith/D2VC6R3MKMA37GB667TT32SLQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2VC6R3MKMA37GB667TT32SLQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:D2VC6R3MKMA37GB667TT32SLQL","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":"ebf8d9c246c2d18cad7b21de5ff6fe3c30bbfaa71919a56f010e5bbfea59fb2e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T00:24:53Z","title_canon_sha256":"f82da0633617fffda07d11a1b60d1810c0d4fda650a266eeea827ed7a39e1748"},"schema_version":"1.0","source":{"id":"2507.11814","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11814","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11814v1","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11814","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"D2VC6R3MKMA3","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"pith_short_16","alias_value":"D2VC6R3MKMA37GB6","created_at":"2026-07-05T11:37:51Z"},{"alias_kind":"pith_short_8","alias_value":"D2VC6R3M","created_at":"2026-07-05T11:37:51Z"}],"graph_snapshots":[{"event_id":"sha256:262d8d9a36859fe9d856e5809d98d1633b21cb84aa0213e4f7f742425c2c6b2d","target":"graph","created_at":"2026-07-05T11:37:51Z","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/2507.11814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Meike Hatzel, Myounghwan Lee, O-joung Kwon, Sebastian Wiederrecht","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T00:24:53Z","title":"Unavoidable butterfly minors in digraphs of large cycle rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11814","kind":"arxiv","version":1},"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:4e146d816dbff93ccedfc8264c1b3da4f9e6d01492f08ba97fcca9f8ff3df1aa","target":"record","created_at":"2026-07-05T11:37:51Z","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":"ebf8d9c246c2d18cad7b21de5ff6fe3c30bbfaa71919a56f010e5bbfea59fb2e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T00:24:53Z","title_canon_sha256":"f82da0633617fffda07d11a1b60d1810c0d4fda650a266eeea827ed7a39e1748"},"schema_version":"1.0","source":{"id":"2507.11814","kind":"arxiv","version":1}},"canonical_sha256":"1eaa2f476c5301bf983ef7e73dea4b82d28ee1fc7dc76efaca314885ae86422f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eaa2f476c5301bf983ef7e73dea4b82d28ee1fc7dc76efaca314885ae86422f","first_computed_at":"2026-07-05T11:37:51.342926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:51.342926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zom/+MlAunyifEgXPQU1aqE3hwb5soRv3Fv7AuibQHnDmEKIZE7blr7B6p3cRK8IIKZSXv5Gh2CLXMHKrLUEDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:51.343480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11814","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e146d816dbff93ccedfc8264c1b3da4f9e6d01492f08ba97fcca9f8ff3df1aa","sha256:262d8d9a36859fe9d856e5809d98d1633b21cb84aa0213e4f7f742425c2c6b2d"],"state_sha256":"014c288dad0b3c8ffa4e2591cfdd7152d3cb4459bd9112f189a43bc4e298f530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"watxY0fq8tqHTuouPEhYvDiln2pcI/hVFwbPyzwiYdhqcyB8HzM+rNFIaiZ/N4N1bGLx29BAPdLDT4rQWItGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:37:02.681278Z","bundle_sha256":"2b2c04725844cc33fb92075707806dfc3fbc312e316e88030d583e2af9240015"}}