{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5YSFTD243ESGGMFTGNX5JKD6YM","short_pith_number":"pith:5YSFTD24","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"},"canonical_sha256":"ee24598f5cd9246330b3336fd4a87ec318b29337f10a61419e5b8084a2f43ea0","source":{"kind":"arxiv","id":"2606.24675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24675","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24675v1","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24675","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"5YSFTD243ESG","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_16","alias_value":"5YSFTD243ESGGMFT","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_8","alias_value":"5YSFTD24","created_at":"2026-06-24T01:15:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5YSFTD243ESGGMFTGNX5JKD6YM","target":"record","payload":{"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"},"canonical_sha256":"ee24598f5cd9246330b3336fd4a87ec318b29337f10a61419e5b8084a2f43ea0","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"},"source_kind":"arxiv","source_id":"2606.24675","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-24T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XL3Bqj7CDpGIi2yvnZa94mRXhNZza5NUWqzKzVwvi0D5oOZ34Ljslwo2b5PZiJYfGkEuaa4rD3VKjv0ocbbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:15:31.780591Z"},"content_sha256":"dbb262da7319b488e42091c0096f5e58050f54c3389c3391032417f16bb1e432","schema_version":"1.0","event_id":"sha256:dbb262da7319b488e42091c0096f5e58050f54c3389c3391032417f16bb1e432"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5YSFTD243ESGGMFTGNX5JKD6YM","target":"graph","payload":{"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"},"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-24T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8T0+q6L9i9hnrja1dGCmuPdaE5xocI8ngMs5/dpBLctmxRsf7/wtSK49Nh5a86ZSZLh8lQxdzWJEZXi7YL+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:15:31.780960Z"},"content_sha256":"becacca43bf8cb18105ae48d716112e7a9ed02fbb6fe473004c3da3e12b7a8df","schema_version":"1.0","event_id":"sha256:becacca43bf8cb18105ae48d716112e7a9ed02fbb6fe473004c3da3e12b7a8df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/bundle.json","state_url":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YSFTD243ESGGMFTGNX5JKD6YM/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-06-29T08:15:31Z","links":{"resolver":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM","bundle":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/bundle.json","state":"https://pith.science/pith/5YSFTD243ESGGMFTGNX5JKD6YM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YSFTD243ESGGMFTGNX5JKD6YM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5YSFTD243ESGGMFTGNX5JKD6YM","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":"8ecd00aeaac24425885e161e2d4638f66e6cac27fd319f0b2ceff3bb2001dbc0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-23T15:07:00Z","title_canon_sha256":"d62223c9d6d92256e964afce14ceeb3adbfcf3258d529e841c1bc679ae01c2d5"},"schema_version":"1.0","source":{"id":"2606.24675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24675","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24675v1","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24675","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"5YSFTD243ESG","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_16","alias_value":"5YSFTD243ESGGMFT","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_8","alias_value":"5YSFTD24","created_at":"2026-06-24T01:15:38Z"}],"graph_snapshots":[{"event_id":"sha256:becacca43bf8cb18105ae48d716112e7a9ed02fbb6fe473004c3da3e12b7a8df","target":"graph","created_at":"2026-06-24T01:15:38Z","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.24675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Codaline Bourotte, Gwendal Ducloz, Pekka Orponen, Shinnosuke Seki","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-23T15:07:00Z","title":"A Congestion Parameter for Depth-First Graph Traversals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24675","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:dbb262da7319b488e42091c0096f5e58050f54c3389c3391032417f16bb1e432","target":"record","created_at":"2026-06-24T01:15:38Z","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":"8ecd00aeaac24425885e161e2d4638f66e6cac27fd319f0b2ceff3bb2001dbc0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-23T15:07:00Z","title_canon_sha256":"d62223c9d6d92256e964afce14ceeb3adbfcf3258d529e841c1bc679ae01c2d5"},"schema_version":"1.0","source":{"id":"2606.24675","kind":"arxiv","version":1}},"canonical_sha256":"ee24598f5cd9246330b3336fd4a87ec318b29337f10a61419e5b8084a2f43ea0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee24598f5cd9246330b3336fd4a87ec318b29337f10a61419e5b8084a2f43ea0","first_computed_at":"2026-06-24T01:15:38.933922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:38.933922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5OGx6SJ5W5PKcVavu71KzJFRcnoSkrzjlN4uCtqAJ6hV3Zo4jIsrvi/hJ51gPUhLH8boVndAeILJ/9H2kUSyAg==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:38.934378Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbb262da7319b488e42091c0096f5e58050f54c3389c3391032417f16bb1e432","sha256:becacca43bf8cb18105ae48d716112e7a9ed02fbb6fe473004c3da3e12b7a8df"],"state_sha256":"bd728ec789aebedb09de32dda383c2abdfccbea23506e2bde4a5c0c9f70e5af1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzuKYVTXaVMfKME8X44WVPfS7B35vtMmleGMOG04eEL5dFse7Sb4lm53cDG6X1Se034tR0igwChWeKPc3IbBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:15:31.782874Z","bundle_sha256":"936922a4212c530e3dedc0ca445859810b2e2ec05a595f90ddb84b42a173628e"}}