{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DCCK4TCAAAIEWTANYOHCY4DU5C","short_pith_number":"pith:DCCK4TCA","schema_version":"1.0","canonical_sha256":"1884ae4c4000104b4c0dc38e2c7074e88a5710167e23c9fa8a1f776d62278850","source":{"kind":"arxiv","id":"2507.12697","version":1},"attestation_state":"computed","paper":{"title":"Unavoidable pivot-minors in graphs of large rank-depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jungho Ahn, Kevin Hendrey, O-joung Kwon, Sang-il Oum","submitted_at":"2025-07-17T00:10:48Z","abstract_excerpt":"Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$, every graph of sufficiently large rank-depth contains a pivot-minor isomorphic to a path on $t$ vertices or a graph consisting of two disjoint cliques of size $t$ joined by a half graph. This answers an open problem raised by Kwon, McCarty, Oum, and Wollan in 2021."},"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.12697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T00:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"113c968bbacf785e023592a1fed702ef727820acd086f209d037a5ef21a562c2","abstract_canon_sha256":"614e8522876e4507ceb31058d3800529debf5b9513f91efa2e6a3b3a88cb8ffe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:37.517332Z","signature_b64":"u39NQr/cIx4fdIfViHlrEBNyRY0zPIXNELc1+zPT6/cxBCURttYk279K3JiLpoHxR3TDt5Hxj97IisVYXwXrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1884ae4c4000104b4c0dc38e2c7074e88a5710167e23c9fa8a1f776d62278850","last_reissued_at":"2026-07-05T11:38:37.516802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:37.516802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unavoidable pivot-minors in graphs of large rank-depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jungho Ahn, Kevin Hendrey, O-joung Kwon, Sang-il Oum","submitted_at":"2025-07-17T00:10:48Z","abstract_excerpt":"Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$, every graph of sufficiently large rank-depth contains a pivot-minor isomorphic to a path on $t$ vertices or a graph consisting of two disjoint cliques of size $t$ joined by a half graph. This answers an open problem raised by Kwon, McCarty, Oum, and Wollan in 2021."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12697","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.12697/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.12697","created_at":"2026-07-05T11:38:37.516852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12697v1","created_at":"2026-07-05T11:38:37.516852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12697","created_at":"2026-07-05T11:38:37.516852+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCCK4TCAAAIE","created_at":"2026-07-05T11:38:37.516852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCCK4TCAAAIEWTAN","created_at":"2026-07-05T11:38:37.516852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCCK4TCA","created_at":"2026-07-05T11:38:37.516852+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/DCCK4TCAAAIEWTANYOHCY4DU5C","json":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C.json","graph_json":"https://pith.science/api/pith-number/DCCK4TCAAAIEWTANYOHCY4DU5C/graph.json","events_json":"https://pith.science/api/pith-number/DCCK4TCAAAIEWTANYOHCY4DU5C/events.json","paper":"https://pith.science/paper/DCCK4TCA"},"agent_actions":{"view_html":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C","download_json":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C.json","view_paper":"https://pith.science/paper/DCCK4TCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12697&json=true","fetch_graph":"https://pith.science/api/pith-number/DCCK4TCAAAIEWTANYOHCY4DU5C/graph.json","fetch_events":"https://pith.science/api/pith-number/DCCK4TCAAAIEWTANYOHCY4DU5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C/action/storage_attestation","attest_author":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C/action/author_attestation","sign_citation":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C/action/citation_signature","submit_replication":"https://pith.science/pith/DCCK4TCAAAIEWTANYOHCY4DU5C/action/replication_record"}},"created_at":"2026-07-05T11:38:37.516852+00:00","updated_at":"2026-07-05T11:38:37.516852+00:00"}