{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:USDFNFEXTBKRUVZIHHPPBOG74U","short_pith_number":"pith:USDFNFEX","canonical_record":{"source":{"id":"2606.31376","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T09:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"ce9dff0ade3676bf23bbb3938e7da7f4512474114cd505750f44f76cf3e2ed24","abstract_canon_sha256":"38d7af153bafd6eb9dc99a716f74e2b95648ba2347f41032bb6c04304965529e"},"schema_version":"1.0"},"canonical_sha256":"a48656949798551a572839def0b8dfe53f6978e7055adc18f51556f88e16a2c5","source":{"kind":"arxiv","id":"2606.31376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31376","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31376v1","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31376","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"USDFNFEXTBKR","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"pith_short_16","alias_value":"USDFNFEXTBKRUVZI","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"pith_short_8","alias_value":"USDFNFEX","created_at":"2026-07-01T01:18:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:USDFNFEXTBKRUVZIHHPPBOG74U","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31376","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T09:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"ce9dff0ade3676bf23bbb3938e7da7f4512474114cd505750f44f76cf3e2ed24","abstract_canon_sha256":"38d7af153bafd6eb9dc99a716f74e2b95648ba2347f41032bb6c04304965529e"},"schema_version":"1.0"},"canonical_sha256":"a48656949798551a572839def0b8dfe53f6978e7055adc18f51556f88e16a2c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:01.189370Z","signature_b64":"vh4VCBHEalC4RocLzSN+7gvEJwcrRgpdfcV4DtNsB3ZrrNaOBr+BoXh7/HGHA+8VKdfb0AKfDbPngR6VRcIbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a48656949798551a572839def0b8dfe53f6978e7055adc18f51556f88e16a2c5","last_reissued_at":"2026-07-01T01:18:01.188957Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:01.188957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31376","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-01T01:18:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EP2EJE6b0b6kOOJgwjZa4rllgF0klah0s1gn2dlbKy+/bBpV4jHZ/Vc6Sq3tzBht3+TIRuTcwujvC+56ubbODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:43:14.011720Z"},"content_sha256":"6113821ad904ed3d3994923ca6bfaa15565dd0951b40695d949bbd7f31d7b6ac","schema_version":"1.0","event_id":"sha256:6113821ad904ed3d3994923ca6bfaa15565dd0951b40695d949bbd7f31d7b6ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:USDFNFEXTBKRUVZIHHPPBOG74U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The sharp threshold for rainbow stackings of random edge-colourings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guorui Ma, Hong Liu, Yangrui Xiang, Zhifei Yan","submitted_at":"2026-06-30T09:06:47Z","abstract_excerpt":"A rainbow stacking of $m$ independent, uniformly random $r$-edge-colourings of $K_n$ is a tuple of vertex permutations that superimposes the colourings such that no two edges of the same colour overlap. The study of the critical palette size $r$ required for the existence of such stackings was recently initiated by Alon, Defant, and Kravitz [Bull. Lond. Math. Soc., 57, 2025], who bounded the phase transition within a constant-order window around $\\frac{m\\binom{n}{2}}{2\\log(n!)}$.\n  We determine the constant term in this transition. For every fixed $m\\ge2$ and every function $\\omega(n)\\to\\infty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31376","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.31376/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-01T01:18:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4v/snJWP13ujeUNHsM+8wLIP/Nfl6BszDtQqiIDcB20FTqMaPq0YYA8O+rMMm76IPLD1l/WSGeGlUP1zIkqpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:43:14.012094Z"},"content_sha256":"53b930476d043e602651ec45f3562e595a446de8d202e029128f92bdde3f0ac7","schema_version":"1.0","event_id":"sha256:53b930476d043e602651ec45f3562e595a446de8d202e029128f92bdde3f0ac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USDFNFEXTBKRUVZIHHPPBOG74U/bundle.json","state_url":"https://pith.science/pith/USDFNFEXTBKRUVZIHHPPBOG74U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USDFNFEXTBKRUVZIHHPPBOG74U/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-04T11:43:14Z","links":{"resolver":"https://pith.science/pith/USDFNFEXTBKRUVZIHHPPBOG74U","bundle":"https://pith.science/pith/USDFNFEXTBKRUVZIHHPPBOG74U/bundle.json","state":"https://pith.science/pith/USDFNFEXTBKRUVZIHHPPBOG74U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USDFNFEXTBKRUVZIHHPPBOG74U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:USDFNFEXTBKRUVZIHHPPBOG74U","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":"38d7af153bafd6eb9dc99a716f74e2b95648ba2347f41032bb6c04304965529e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T09:06:47Z","title_canon_sha256":"ce9dff0ade3676bf23bbb3938e7da7f4512474114cd505750f44f76cf3e2ed24"},"schema_version":"1.0","source":{"id":"2606.31376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31376","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31376v1","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31376","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"USDFNFEXTBKR","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"pith_short_16","alias_value":"USDFNFEXTBKRUVZI","created_at":"2026-07-01T01:18:01Z"},{"alias_kind":"pith_short_8","alias_value":"USDFNFEX","created_at":"2026-07-01T01:18:01Z"}],"graph_snapshots":[{"event_id":"sha256:53b930476d043e602651ec45f3562e595a446de8d202e029128f92bdde3f0ac7","target":"graph","created_at":"2026-07-01T01:18:01Z","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.31376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A rainbow stacking of $m$ independent, uniformly random $r$-edge-colourings of $K_n$ is a tuple of vertex permutations that superimposes the colourings such that no two edges of the same colour overlap. The study of the critical palette size $r$ required for the existence of such stackings was recently initiated by Alon, Defant, and Kravitz [Bull. Lond. Math. Soc., 57, 2025], who bounded the phase transition within a constant-order window around $\\frac{m\\binom{n}{2}}{2\\log(n!)}$.\n  We determine the constant term in this transition. For every fixed $m\\ge2$ and every function $\\omega(n)\\to\\infty","authors_text":"Guorui Ma, Hong Liu, Yangrui Xiang, Zhifei Yan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T09:06:47Z","title":"The sharp threshold for rainbow stackings of random edge-colourings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31376","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:6113821ad904ed3d3994923ca6bfaa15565dd0951b40695d949bbd7f31d7b6ac","target":"record","created_at":"2026-07-01T01:18:01Z","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":"38d7af153bafd6eb9dc99a716f74e2b95648ba2347f41032bb6c04304965529e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T09:06:47Z","title_canon_sha256":"ce9dff0ade3676bf23bbb3938e7da7f4512474114cd505750f44f76cf3e2ed24"},"schema_version":"1.0","source":{"id":"2606.31376","kind":"arxiv","version":1}},"canonical_sha256":"a48656949798551a572839def0b8dfe53f6978e7055adc18f51556f88e16a2c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a48656949798551a572839def0b8dfe53f6978e7055adc18f51556f88e16a2c5","first_computed_at":"2026-07-01T01:18:01.188957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:01.188957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vh4VCBHEalC4RocLzSN+7gvEJwcrRgpdfcV4DtNsB3ZrrNaOBr+BoXh7/HGHA+8VKdfb0AKfDbPngR6VRcIbDg==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:01.189370Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6113821ad904ed3d3994923ca6bfaa15565dd0951b40695d949bbd7f31d7b6ac","sha256:53b930476d043e602651ec45f3562e595a446de8d202e029128f92bdde3f0ac7"],"state_sha256":"89d63fa493a29389468c3c6062aed007a27682c0958f260846475d5def1d86f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVQxcA++qY7vBwdvcm8viH0VVIzf1l0Z7x5Zq/HZCgQzzYZ6niT2hyOCHVSi8na3rk866kj3dnlM53Z3otRbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:43:14.014121Z","bundle_sha256":"3acf76adfb3e68b4e266d1d71edf6cb21af4b4cdb3e9e71ebc0c116415953f0d"}}