{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MOYMCSBPLUUSWYRO5AUWEDEEAO","short_pith_number":"pith:MOYMCSBP","schema_version":"1.0","canonical_sha256":"63b0c1482f5d292b622ee829620c8403adc6646bdc8083304f0355f81aae067b","source":{"kind":"arxiv","id":"2605.31398","version":1},"attestation_state":"computed","paper":{"title":"Universality for rainbow oriented cycles in perturbed digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Staudinger, Robert A. Krueger","submitted_at":"2026-05-29T15:03:44Z","abstract_excerpt":"A randomly perturbed digraph is an $n$-vertex directed graph with all out- and in-degrees linear in $n$, to which a linear number (depending on the degree) of random edges have been randomly added. We show that randomly perturbed digraphs whose edges have been colored uniformly with $n$ colors have a rainbow copy of every orientation of every possible length cycle, simultaneously, with high probability. This is a common generalization of work of Araujo, Balogh, Krueger, Piga, and Treglown in the uncolored setting and Katsamaktsis, Letzter, and Sgueglia for consistently oriented spanning cycles"},"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":"2605.31398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T15:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"4a339d9293e67162cb1ffdbfd304d0a545eff760a5cfd12452d8875621ee2f62","abstract_canon_sha256":"8a3ec7904c26dd46ccccc4b67dbb5ea5153e322b67b8761bdb4b6cca41a82bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:03.189171Z","signature_b64":"8iNYJcgYwWzOcORLKCJH0jAZ+6Xlsoxf9+CkBjv7e9EN09wuo5kuEhVtVJqid6vkR9bzn+UhdoAL2RxW8NveBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63b0c1482f5d292b622ee829620c8403adc6646bdc8083304f0355f81aae067b","last_reissued_at":"2026-06-01T02:04:03.188401Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:03.188401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality for rainbow oriented cycles in perturbed digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Staudinger, Robert A. Krueger","submitted_at":"2026-05-29T15:03:44Z","abstract_excerpt":"A randomly perturbed digraph is an $n$-vertex directed graph with all out- and in-degrees linear in $n$, to which a linear number (depending on the degree) of random edges have been randomly added. We show that randomly perturbed digraphs whose edges have been colored uniformly with $n$ colors have a rainbow copy of every orientation of every possible length cycle, simultaneously, with high probability. This is a common generalization of work of Araujo, Balogh, Krueger, Piga, and Treglown in the uncolored setting and Katsamaktsis, Letzter, and Sgueglia for consistently oriented spanning cycles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31398","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/2605.31398/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":"2605.31398","created_at":"2026-06-01T02:04:03.188526+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31398v1","created_at":"2026-06-01T02:04:03.188526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31398","created_at":"2026-06-01T02:04:03.188526+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOYMCSBPLUUS","created_at":"2026-06-01T02:04:03.188526+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOYMCSBPLUUSWYRO","created_at":"2026-06-01T02:04:03.188526+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOYMCSBP","created_at":"2026-06-01T02:04:03.188526+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/MOYMCSBPLUUSWYRO5AUWEDEEAO","json":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO.json","graph_json":"https://pith.science/api/pith-number/MOYMCSBPLUUSWYRO5AUWEDEEAO/graph.json","events_json":"https://pith.science/api/pith-number/MOYMCSBPLUUSWYRO5AUWEDEEAO/events.json","paper":"https://pith.science/paper/MOYMCSBP"},"agent_actions":{"view_html":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO","download_json":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO.json","view_paper":"https://pith.science/paper/MOYMCSBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31398&json=true","fetch_graph":"https://pith.science/api/pith-number/MOYMCSBPLUUSWYRO5AUWEDEEAO/graph.json","fetch_events":"https://pith.science/api/pith-number/MOYMCSBPLUUSWYRO5AUWEDEEAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/action/storage_attestation","attest_author":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/action/author_attestation","sign_citation":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/action/citation_signature","submit_replication":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/action/replication_record"}},"created_at":"2026-06-01T02:04:03.188526+00:00","updated_at":"2026-06-01T02:04:03.188526+00:00"}