{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5YSFTD243ESGGMFTGNX5JKD6YM","short_pith_number":"pith:5YSFTD24","schema_version":"1.0","canonical_sha256":"ee24598f5cd9246330b3336fd4a87ec318b29337f10a61419e5b8084a2f43ea0","source":{"kind":"arxiv","id":"2606.24675","version":1},"attestation_state":"computed","paper":{"title":"A Congestion Parameter for Depth-First Graph Traversals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Codaline Bourotte, Gwendal Ducloz, Pekka Orponen, Shinnosuke Seki","submitted_at":"2026-06-23T15:07:00Z","abstract_excerpt":"We explore a new graph parameter, the KLX number, which quantifies the minimum edge congestion of depth-first search (DFS) traversals of a given graph. Originally motivated by a problem in RNA nanostructure design, this parameter is also of independent theoretical interest. Informally, the KLX number of a graph is defined as the minimum, over all its DFS traversals, of the maximum number of back edges that are simultaneously open during the traversal.\n  We provide full characterisations and linear-time recognition algorithms for graphs with KLX numbers 0, 1 and 2. We also relate KLX to tree-wi"},"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":"2606.24675","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-23T15:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"d62223c9d6d92256e964afce14ceeb3adbfcf3258d529e841c1bc679ae01c2d5","abstract_canon_sha256":"8ecd00aeaac24425885e161e2d4638f66e6cac27fd319f0b2ceff3bb2001dbc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:38.934378Z","signature_b64":"5OGx6SJ5W5PKcVavu71KzJFRcnoSkrzjlN4uCtqAJ6hV3Zo4jIsrvi/hJ51gPUhLH8boVndAeILJ/9H2kUSyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee24598f5cd9246330b3336fd4a87ec318b29337f10a61419e5b8084a2f43ea0","last_reissued_at":"2026-06-24T01:15:38.933922Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:38.933922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Congestion Parameter for Depth-First Graph Traversals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Codaline Bourotte, Gwendal Ducloz, Pekka Orponen, Shinnosuke Seki","submitted_at":"2026-06-23T15:07:00Z","abstract_excerpt":"We explore a new graph parameter, the KLX number, which quantifies the minimum edge congestion of depth-first search (DFS) traversals of a given graph. Originally motivated by a problem in RNA nanostructure design, this parameter is also of independent theoretical interest. Informally, the KLX number of a graph is defined as the minimum, over all its DFS traversals, of the maximum number of back edges that are simultaneously open during the traversal.\n  We provide full characterisations and linear-time recognition algorithms for graphs with KLX numbers 0, 1 and 2. We also relate KLX to tree-wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24675","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.24675/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":"2606.24675","created_at":"2026-06-24T01:15:38.934003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24675v1","created_at":"2026-06-24T01:15:38.934003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24675","created_at":"2026-06-24T01:15:38.934003+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YSFTD243ESG","created_at":"2026-06-24T01:15:38.934003+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YSFTD243ESGGMFT","created_at":"2026-06-24T01:15:38.934003+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YSFTD24","created_at":"2026-06-24T01:15:38.934003+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/5YSFTD243ESGGMFTGNX5JKD6YM","json":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM.json","graph_json":"https://pith.science/api/pith-number/5YSFTD243ESGGMFTGNX5JKD6YM/graph.json","events_json":"https://pith.science/api/pith-number/5YSFTD243ESGGMFTGNX5JKD6YM/events.json","paper":"https://pith.science/paper/5YSFTD24"},"agent_actions":{"view_html":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM","download_json":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM.json","view_paper":"https://pith.science/paper/5YSFTD24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24675&json=true","fetch_graph":"https://pith.science/api/pith-number/5YSFTD243ESGGMFTGNX5JKD6YM/graph.json","fetch_events":"https://pith.science/api/pith-number/5YSFTD243ESGGMFTGNX5JKD6YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/action/storage_attestation","attest_author":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/action/author_attestation","sign_citation":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/action/citation_signature","submit_replication":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/action/replication_record"}},"created_at":"2026-06-24T01:15:38.934003+00:00","updated_at":"2026-06-24T01:15:38.934003+00:00"}