{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DVU3GPWQCQEBKAR4QTAX5ZMFPK","short_pith_number":"pith:DVU3GPWQ","canonical_record":{"source":{"id":"2402.12905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T10:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"448507b57653ada2b9a9f009268a01e1ca63ec3585791e0f11b51b248e40f30a","abstract_canon_sha256":"16aed31156a626e74a677a9132b7b2801ce06133718a8891aed344d350b5ed8d"},"schema_version":"1.0"},"canonical_sha256":"1d69b33ed0140815023c84c17ee5857a87362ce87bf33e0f0c698f1483d306d2","source":{"kind":"arxiv","id":"2402.12905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.12905","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"arxiv_version","alias_value":"2402.12905v1","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12905","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"pith_short_12","alias_value":"DVU3GPWQCQEB","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"pith_short_16","alias_value":"DVU3GPWQCQEBKAR4","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"pith_short_8","alias_value":"DVU3GPWQ","created_at":"2026-07-05T07:47:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DVU3GPWQCQEBKAR4QTAX5ZMFPK","target":"record","payload":{"canonical_record":{"source":{"id":"2402.12905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T10:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"448507b57653ada2b9a9f009268a01e1ca63ec3585791e0f11b51b248e40f30a","abstract_canon_sha256":"16aed31156a626e74a677a9132b7b2801ce06133718a8891aed344d350b5ed8d"},"schema_version":"1.0"},"canonical_sha256":"1d69b33ed0140815023c84c17ee5857a87362ce87bf33e0f0c698f1483d306d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:18.293556Z","signature_b64":"UcyS1M3AL34FehI7MflswltC/+Xy6II2votT79dDhXyNLF+I8t/V1VTpqrMOXPlwlbRQW8qbAPD9+lKobRNNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d69b33ed0140815023c84c17ee5857a87362ce87bf33e0f0c698f1483d306d2","last_reissued_at":"2026-07-05T07:47:18.293040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:18.293040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.12905","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-05T07:47:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWaY9bTBZiXFBMgrwTrjWmoFss7OChY0O2AvUu2LcCU1WuohpRwUpvZ4VAmadoO+xWoGJYgyYfqMhv8sEZg0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:43:41.505608Z"},"content_sha256":"2f6a4da8e9fd9ff6fd4d2b9defdb4dc62762436b46c63a8f52930633a5639c43","schema_version":"1.0","event_id":"sha256:2f6a4da8e9fd9ff6fd4d2b9defdb4dc62762436b46c63a8f52930633a5639c43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DVU3GPWQCQEBKAR4QTAX5ZMFPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locally Rainbow Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Leon Kellerhals, Malte Renken, Till Fluschnik","submitted_at":"2024-02-20T10:50:01Z","abstract_excerpt":"We introduce the algorithmic problem of finding a locally rainbow path of length $\\ell$ connecting two distinguished vertices $s$ and $t$ in a vertex-colored directed graph. Herein, a path is locally rainbow if between any two visits of equally colored vertices, the path traverses consecutively at least $r$ differently colored vertices. This problem generalizes the well-known problem of finding a rainbow path. It finds natural applications whenever there are different types of resources that must be protected from overuse, such as crop sequence optimization or production process scheduling. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12905","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/2402.12905/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-05T07:47:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDrWjoov/xLmq4dSWwO9wKduUxOQIEEvyRoQyTlZ1vF2fTA8Xkrz5UBmcrcplGC+2aGqyPu0VaRQDgZOLJ8EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:43:41.505998Z"},"content_sha256":"0b6e2af27aa183e2c278f036a2b82db79459a1852c367472d47a6bfe7403c63d","schema_version":"1.0","event_id":"sha256:0b6e2af27aa183e2c278f036a2b82db79459a1852c367472d47a6bfe7403c63d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/bundle.json","state_url":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/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-07-06T18:43:41Z","links":{"resolver":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK","bundle":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/bundle.json","state":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DVU3GPWQCQEBKAR4QTAX5ZMFPK","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":"16aed31156a626e74a677a9132b7b2801ce06133718a8891aed344d350b5ed8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T10:50:01Z","title_canon_sha256":"448507b57653ada2b9a9f009268a01e1ca63ec3585791e0f11b51b248e40f30a"},"schema_version":"1.0","source":{"id":"2402.12905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.12905","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"arxiv_version","alias_value":"2402.12905v1","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12905","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"pith_short_12","alias_value":"DVU3GPWQCQEB","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"pith_short_16","alias_value":"DVU3GPWQCQEBKAR4","created_at":"2026-07-05T07:47:18Z"},{"alias_kind":"pith_short_8","alias_value":"DVU3GPWQ","created_at":"2026-07-05T07:47:18Z"}],"graph_snapshots":[{"event_id":"sha256:0b6e2af27aa183e2c278f036a2b82db79459a1852c367472d47a6bfe7403c63d","target":"graph","created_at":"2026-07-05T07:47:18Z","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/2402.12905/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the algorithmic problem of finding a locally rainbow path of length $\\ell$ connecting two distinguished vertices $s$ and $t$ in a vertex-colored directed graph. Herein, a path is locally rainbow if between any two visits of equally colored vertices, the path traverses consecutively at least $r$ differently colored vertices. This problem generalizes the well-known problem of finding a rainbow path. It finds natural applications whenever there are different types of resources that must be protected from overuse, such as crop sequence optimization or production process scheduling. We","authors_text":"Leon Kellerhals, Malte Renken, Till Fluschnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T10:50:01Z","title":"Locally Rainbow Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12905","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:2f6a4da8e9fd9ff6fd4d2b9defdb4dc62762436b46c63a8f52930633a5639c43","target":"record","created_at":"2026-07-05T07:47:18Z","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":"16aed31156a626e74a677a9132b7b2801ce06133718a8891aed344d350b5ed8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T10:50:01Z","title_canon_sha256":"448507b57653ada2b9a9f009268a01e1ca63ec3585791e0f11b51b248e40f30a"},"schema_version":"1.0","source":{"id":"2402.12905","kind":"arxiv","version":1}},"canonical_sha256":"1d69b33ed0140815023c84c17ee5857a87362ce87bf33e0f0c698f1483d306d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d69b33ed0140815023c84c17ee5857a87362ce87bf33e0f0c698f1483d306d2","first_computed_at":"2026-07-05T07:47:18.293040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:47:18.293040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UcyS1M3AL34FehI7MflswltC/+Xy6II2votT79dDhXyNLF+I8t/V1VTpqrMOXPlwlbRQW8qbAPD9+lKobRNNDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:47:18.293556Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.12905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f6a4da8e9fd9ff6fd4d2b9defdb4dc62762436b46c63a8f52930633a5639c43","sha256:0b6e2af27aa183e2c278f036a2b82db79459a1852c367472d47a6bfe7403c63d"],"state_sha256":"db2238c14146c1d554faa52bcde15883cbbabd4674842c5736d083ca22fcacda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EC+8r9qwjCnSrGtk/ws/X81fQwBPQT1IIXNqqINhrebxa00tIeks1mcKWZla5ajqZna8iwFrWQOLcDc/i3VuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:43:41.507876Z","bundle_sha256":"9066d7184813aeb60a2db114a4ea1fe5a5d7d79f07c27afa07f4ad842153d315"}}