{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DVU3GPWQCQEBKAR4QTAX5ZMFPK","short_pith_number":"pith:DVU3GPWQ","schema_version":"1.0","canonical_sha256":"1d69b33ed0140815023c84c17ee5857a87362ce87bf33e0f0c698f1483d306d2","source":{"kind":"arxiv","id":"2402.12905","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.12905","created_at":"2026-07-05T07:47:18.293100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12905v1","created_at":"2026-07-05T07:47:18.293100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12905","created_at":"2026-07-05T07:47:18.293100+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVU3GPWQCQEB","created_at":"2026-07-05T07:47:18.293100+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVU3GPWQCQEBKAR4","created_at":"2026-07-05T07:47:18.293100+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVU3GPWQ","created_at":"2026-07-05T07:47:18.293100+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/DVU3GPWQCQEBKAR4QTAX5ZMFPK","json":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK.json","graph_json":"https://pith.science/api/pith-number/DVU3GPWQCQEBKAR4QTAX5ZMFPK/graph.json","events_json":"https://pith.science/api/pith-number/DVU3GPWQCQEBKAR4QTAX5ZMFPK/events.json","paper":"https://pith.science/paper/DVU3GPWQ"},"agent_actions":{"view_html":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK","download_json":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK.json","view_paper":"https://pith.science/paper/DVU3GPWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12905&json=true","fetch_graph":"https://pith.science/api/pith-number/DVU3GPWQCQEBKAR4QTAX5ZMFPK/graph.json","fetch_events":"https://pith.science/api/pith-number/DVU3GPWQCQEBKAR4QTAX5ZMFPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/action/storage_attestation","attest_author":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/action/author_attestation","sign_citation":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/action/citation_signature","submit_replication":"https://pith.science/pith/DVU3GPWQCQEBKAR4QTAX5ZMFPK/action/replication_record"}},"created_at":"2026-07-05T07:47:18.293100+00:00","updated_at":"2026-07-05T07:47:18.293100+00:00"}