{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HXJ52RNKZERFBTZT2OKGJRH5ED","short_pith_number":"pith:HXJ52RNK","canonical_record":{"source":{"id":"2606.29336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-28T11:09:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a6a2bb88379675f9f965e5e9a8cdbd628417dd6ab9c7b262b14a2855e388b782","abstract_canon_sha256":"0084dc365aa6eeb3b4960895420e87e37f7bd09d59dcee93fc5d7e9cb67a33d9"},"schema_version":"1.0"},"canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","source":{"kind":"arxiv","id":"2606.29336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29336","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29336v1","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29336","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"HXJ52RNKZERF","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"pith_short_16","alias_value":"HXJ52RNKZERFBTZT","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"pith_short_8","alias_value":"HXJ52RNK","created_at":"2026-06-30T01:18:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HXJ52RNKZERFBTZT2OKGJRH5ED","target":"record","payload":{"canonical_record":{"source":{"id":"2606.29336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-28T11:09:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a6a2bb88379675f9f965e5e9a8cdbd628417dd6ab9c7b262b14a2855e388b782","abstract_canon_sha256":"0084dc365aa6eeb3b4960895420e87e37f7bd09d59dcee93fc5d7e9cb67a33d9"},"schema_version":"1.0"},"canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:02.015956Z","signature_b64":"38KLFooj+hwDa4YTK75qDn1tlYBNmADacOTc/IWaugH1Pf62VIW21GKUtYotZYnbOFBX4U2EB5OmYK74tzJ1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","last_reissued_at":"2026-06-30T01:18:02.015236Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:02.015236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.29336","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-06-30T01:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJOvrrEVYyW7pzk4Sm2P1xiVlVlzhC15O1IAZ0Z1giZZN953ziFe+vgN7iCnStOZplo1qa2rlO6kA1c219ekAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:14:40.841175Z"},"content_sha256":"e8a073e3358e6174285280ef3a5ab11a60e286c294a69c870d895ab0bf62debe","schema_version":"1.0","event_id":"sha256:e8a073e3358e6174285280ef3a5ab11a60e286c294a69c870d895ab0bf62debe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HXJ52RNKZERFBTZT2OKGJRH5ED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An FPT algorithm for cycle rank on semi-complete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Myounghwan Lee, O-joung Kwon, Seokbeom Kim","submitted_at":"2026-06-28T11:09:28Z","abstract_excerpt":"Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determining if a given digraph has cycle rank at most $w$ is fixed-parameter tractable parameterized by $w$. We provide such algorithms for semi-complete digraphs, and for digraphs of bounded directed clique-width. Specifically, we show that given an $n$-vertex semi-complete digraph $G$ and an integer $w$, one can in time $\\mathcal{O}(9^{(w+1)4^{w+2}} \\cdot n^2)$ determine whether $G$ has cycle rank at most $w$. The proof i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29336","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/2606.29336/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-06-30T01:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1B6DOuIIdn1grGd+wPrMddOt5NiTqml3MmYVJu96m6lQhC8J+xwIQuDp6+h6JcASvGmEekYBoWuNQQzTEZZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:14:40.841689Z"},"content_sha256":"a3d901497a99415d03e5c3967aa5402a6ffc7d7bd00d05238d220c2f91850fad","schema_version":"1.0","event_id":"sha256:a3d901497a99415d03e5c3967aa5402a6ffc7d7bd00d05238d220c2f91850fad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/bundle.json","state_url":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/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-07T10:14:40Z","links":{"resolver":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED","bundle":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/bundle.json","state":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HXJ52RNKZERFBTZT2OKGJRH5ED","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":"0084dc365aa6eeb3b4960895420e87e37f7bd09d59dcee93fc5d7e9cb67a33d9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-28T11:09:28Z","title_canon_sha256":"a6a2bb88379675f9f965e5e9a8cdbd628417dd6ab9c7b262b14a2855e388b782"},"schema_version":"1.0","source":{"id":"2606.29336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29336","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29336v1","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29336","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"HXJ52RNKZERF","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"pith_short_16","alias_value":"HXJ52RNKZERFBTZT","created_at":"2026-06-30T01:18:02Z"},{"alias_kind":"pith_short_8","alias_value":"HXJ52RNK","created_at":"2026-06-30T01:18:02Z"}],"graph_snapshots":[{"event_id":"sha256:a3d901497a99415d03e5c3967aa5402a6ffc7d7bd00d05238d220c2f91850fad","target":"graph","created_at":"2026-06-30T01:18:02Z","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/2606.29336/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determining if a given digraph has cycle rank at most $w$ is fixed-parameter tractable parameterized by $w$. We provide such algorithms for semi-complete digraphs, and for digraphs of bounded directed clique-width. Specifically, we show that given an $n$-vertex semi-complete digraph $G$ and an integer $w$, one can in time $\\mathcal{O}(9^{(w+1)4^{w+2}} \\cdot n^2)$ determine whether $G$ has cycle rank at most $w$. The proof i","authors_text":"Myounghwan Lee, O-joung Kwon, Seokbeom Kim","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29336","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:e8a073e3358e6174285280ef3a5ab11a60e286c294a69c870d895ab0bf62debe","target":"record","created_at":"2026-06-30T01:18:02Z","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":"0084dc365aa6eeb3b4960895420e87e37f7bd09d59dcee93fc5d7e9cb67a33d9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-28T11:09:28Z","title_canon_sha256":"a6a2bb88379675f9f965e5e9a8cdbd628417dd6ab9c7b262b14a2855e388b782"},"schema_version":"1.0","source":{"id":"2606.29336","kind":"arxiv","version":1}},"canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","first_computed_at":"2026-06-30T01:18:02.015236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:18:02.015236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"38KLFooj+hwDa4YTK75qDn1tlYBNmADacOTc/IWaugH1Pf62VIW21GKUtYotZYnbOFBX4U2EB5OmYK74tzJ1Bw==","signature_status":"signed_v1","signed_at":"2026-06-30T01:18:02.015956Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.29336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8a073e3358e6174285280ef3a5ab11a60e286c294a69c870d895ab0bf62debe","sha256:a3d901497a99415d03e5c3967aa5402a6ffc7d7bd00d05238d220c2f91850fad"],"state_sha256":"fed19076be0ad266a783a9ad95f14883d220376ab3d63304d2e8acec2e28946d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DZ7b780FDvz5G7LSfhuhJQmS7s8VZujsw5XuNJC2EGh8ogYSOcuLCve2AcoNBsdNRepMi/vXqJrcxZhJoQoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:14:40.846468Z","bundle_sha256":"a099a31a9d3e72308f969c767fe3d319ecc67dbc1537b0a416716ea3a73d41ad"}}