{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MOYMCSBPLUUSWYRO5AUWEDEEAO","short_pith_number":"pith:MOYMCSBP","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"},"canonical_sha256":"63b0c1482f5d292b622ee829620c8403adc6646bdc8083304f0355f81aae067b","source":{"kind":"arxiv","id":"2605.31398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.31398","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.31398v1","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31398","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"MOYMCSBPLUUS","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"MOYMCSBPLUUSWYRO","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"MOYMCSBP","created_at":"2026-06-01T02:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MOYMCSBPLUUSWYRO5AUWEDEEAO","target":"record","payload":{"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"},"canonical_sha256":"63b0c1482f5d292b622ee829620c8403adc6646bdc8083304f0355f81aae067b","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"},"source_kind":"arxiv","source_id":"2605.31398","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-01T02:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCW5wZjWETejvt4egRMeSR8btiAOihVkG6Vsr50DyHt5Nb0q7MmSe8DPj3pyRcVU3XklXI/GjpoT5ziNVq3yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:37.339693Z"},"content_sha256":"dbee97a6c52474a7490d10dcde0903e54313741fdc17991559950b8e6fbfb208","schema_version":"1.0","event_id":"sha256:dbee97a6c52474a7490d10dcde0903e54313741fdc17991559950b8e6fbfb208"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MOYMCSBPLUUSWYRO5AUWEDEEAO","target":"graph","payload":{"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"},"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-01T02:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hT2wb0KZ/z2SCubhdLCvslrMurtG2DKlvGo7wzNYHcPdsXCAZfe8Zax70Eo4act1rDUvgCJdW7IfF4q9G/LDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:41:37.340081Z"},"content_sha256":"612de2c773b705a8315f97a1bf3a3b8592d00f2878d44b0d1b4cc3485f6da2bf","schema_version":"1.0","event_id":"sha256:612de2c773b705a8315f97a1bf3a3b8592d00f2878d44b0d1b4cc3485f6da2bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/bundle.json","state_url":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/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-24T05:41:37Z","links":{"resolver":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO","bundle":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/bundle.json","state":"https://pith.science/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOYMCSBPLUUSWYRO5AUWEDEEAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MOYMCSBPLUUSWYRO5AUWEDEEAO","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":"8a3ec7904c26dd46ccccc4b67dbb5ea5153e322b67b8761bdb4b6cca41a82bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T15:03:44Z","title_canon_sha256":"4a339d9293e67162cb1ffdbfd304d0a545eff760a5cfd12452d8875621ee2f62"},"schema_version":"1.0","source":{"id":"2605.31398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.31398","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.31398v1","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31398","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"MOYMCSBPLUUS","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"MOYMCSBPLUUSWYRO","created_at":"2026-06-01T02:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"MOYMCSBP","created_at":"2026-06-01T02:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:612de2c773b705a8315f97a1bf3a3b8592d00f2878d44b0d1b4cc3485f6da2bf","target":"graph","created_at":"2026-06-01T02:04:03Z","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/2605.31398/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Staudinger, Robert A. Krueger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T15:03:44Z","title":"Universality for rainbow oriented cycles in perturbed digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31398","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:dbee97a6c52474a7490d10dcde0903e54313741fdc17991559950b8e6fbfb208","target":"record","created_at":"2026-06-01T02:04:03Z","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":"8a3ec7904c26dd46ccccc4b67dbb5ea5153e322b67b8761bdb4b6cca41a82bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T15:03:44Z","title_canon_sha256":"4a339d9293e67162cb1ffdbfd304d0a545eff760a5cfd12452d8875621ee2f62"},"schema_version":"1.0","source":{"id":"2605.31398","kind":"arxiv","version":1}},"canonical_sha256":"63b0c1482f5d292b622ee829620c8403adc6646bdc8083304f0355f81aae067b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63b0c1482f5d292b622ee829620c8403adc6646bdc8083304f0355f81aae067b","first_computed_at":"2026-06-01T02:04:03.188401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T02:04:03.188401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8iNYJcgYwWzOcORLKCJH0jAZ+6Xlsoxf9+CkBjv7e9EN09wuo5kuEhVtVJqid6vkR9bzn+UhdoAL2RxW8NveBA==","signature_status":"signed_v1","signed_at":"2026-06-01T02:04:03.189171Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.31398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbee97a6c52474a7490d10dcde0903e54313741fdc17991559950b8e6fbfb208","sha256:612de2c773b705a8315f97a1bf3a3b8592d00f2878d44b0d1b4cc3485f6da2bf"],"state_sha256":"70cedb1dcff46182ade95227a3c6d8293c3519cbe28bd5a22faa81a88dad96a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6W8JDchzdkN8JSJtaHBqwEyB1Q7AyySnFbsS8iluG+LykzZ2RcJHqa0Ykg8gfza7gXlXvB9MFlK8CS6HHNBkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:41:37.342126Z","bundle_sha256":"0e48523ff380f95dcc8d65644728fba924171ac93cfc4ccca4d27a60f7749178"}}