{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PLKH2GVO2Z6FGOR3DPIG6HEALV","short_pith_number":"pith:PLKH2GVO","canonical_record":{"source":{"id":"2608.04845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T13:40:05Z","cross_cats_sorted":[],"title_canon_sha256":"c2c9328752af588ba6e28b6fec4ecd4eb0632ff7f03d20d3b5887d4ff239ae16","abstract_canon_sha256":"6fb615fcaf2e52d5625c020d8b72d9475d96cfc135e8cc5438adbecd25592d57"},"schema_version":"1.0"},"canonical_sha256":"7ad47d1aaed67c533a3b1bd06f1c805d68d52a75e33cd2944885d45db816b796","source":{"kind":"arxiv","id":"2608.04845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04845","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04845v1","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04845","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"PLKH2GVO2Z6F","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"pith_short_16","alias_value":"PLKH2GVO2Z6FGOR3","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"pith_short_8","alias_value":"PLKH2GVO","created_at":"2026-08-06T01:47:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PLKH2GVO2Z6FGOR3DPIG6HEALV","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T13:40:05Z","cross_cats_sorted":[],"title_canon_sha256":"c2c9328752af588ba6e28b6fec4ecd4eb0632ff7f03d20d3b5887d4ff239ae16","abstract_canon_sha256":"6fb615fcaf2e52d5625c020d8b72d9475d96cfc135e8cc5438adbecd25592d57"},"schema_version":"1.0"},"canonical_sha256":"7ad47d1aaed67c533a3b1bd06f1c805d68d52a75e33cd2944885d45db816b796","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:47:23.596640Z","signature_b64":"fIl+adxkFdoTxelgloBPBPMIqgWdJXuu2E946XKPtpAgYQgdmAWxlS9rt3KM9mTYawRgG44Vk8NAXAC0gcbYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad47d1aaed67c533a3b1bd06f1c805d68d52a75e33cd2944885d45db816b796","last_reissued_at":"2026-08-06T01:47:23.595183Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:47:23.595183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04845","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-08-06T01:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5hIwjaGiJRkhlQstxyrvHxUBVvP3NwXV1Vh2yWUgdBCkWwId39PYrmz5x+gxRXpCxFBG3gkdLQn5/disTstDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:48:17.423264Z"},"content_sha256":"7edd20ed3b791627611eddc241ad1d8333efdf0b630742502ffcfee4f5862c87","schema_version":"1.0","event_id":"sha256:7edd20ed3b791627611eddc241ad1d8333efdf0b630742502ffcfee4f5862c87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PLKH2GVO2Z6FGOR3DPIG6HEALV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy Transference for Rainbow-$H$-Free Colourings of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixiang Zhang, Mei Lu, Mengyu Cao","submitted_at":"2026-08-05T13:40:05Z","abstract_excerpt":"Let $H$ be a fixed graph with $q=e(H)\\ge3$ and containing two adjacent edges, and let $\\ell\\ge q$ be fixed. We establish an entropy-transference principle for rainbow-$H$-free edge-colourings of the binomial random graph at the natural scale $p=n^{-1/m_2(H)}$. Below a sufficiently small constant multiple of this scale, almost all host edges may be coloured freely; above a sufficiently large constant multiple, the exponential counting rate is governed exactly by a deterministic template-entropy optimisation on complete graphs. An exact Hall-palette inequality evaluates this rate throughout the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04845","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/2608.04845/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-08-06T01:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpBLy/9WBZg7n66CurQI+Usf/wqxOeQUhsgVB/akNZIHbGyhNQ4phWo1nmqid7eqAuL7EGOfM/Fd6QTgStJuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:48:17.423676Z"},"content_sha256":"a5496b971b31bb2cad8a25f825aaf45ed192fd0d407f60cb906468f2488fa2d3","schema_version":"1.0","event_id":"sha256:a5496b971b31bb2cad8a25f825aaf45ed192fd0d407f60cb906468f2488fa2d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV/bundle.json","state_url":"https://pith.science/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV/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-08-22T04:48:17Z","links":{"resolver":"https://pith.science/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV","bundle":"https://pith.science/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV/bundle.json","state":"https://pith.science/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLKH2GVO2Z6FGOR3DPIG6HEALV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PLKH2GVO2Z6FGOR3DPIG6HEALV","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":"6fb615fcaf2e52d5625c020d8b72d9475d96cfc135e8cc5438adbecd25592d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T13:40:05Z","title_canon_sha256":"c2c9328752af588ba6e28b6fec4ecd4eb0632ff7f03d20d3b5887d4ff239ae16"},"schema_version":"1.0","source":{"id":"2608.04845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04845","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04845v1","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04845","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"PLKH2GVO2Z6F","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"pith_short_16","alias_value":"PLKH2GVO2Z6FGOR3","created_at":"2026-08-06T01:47:23Z"},{"alias_kind":"pith_short_8","alias_value":"PLKH2GVO","created_at":"2026-08-06T01:47:23Z"}],"graph_snapshots":[{"event_id":"sha256:a5496b971b31bb2cad8a25f825aaf45ed192fd0d407f60cb906468f2488fa2d3","target":"graph","created_at":"2026-08-06T01:47:23Z","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/2608.04845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $H$ be a fixed graph with $q=e(H)\\ge3$ and containing two adjacent edges, and let $\\ell\\ge q$ be fixed. We establish an entropy-transference principle for rainbow-$H$-free edge-colourings of the binomial random graph at the natural scale $p=n^{-1/m_2(H)}$. Below a sufficiently small constant multiple of this scale, almost all host edges may be coloured freely; above a sufficiently large constant multiple, the exponential counting rate is governed exactly by a deterministic template-entropy optimisation on complete graphs. An exact Hall-palette inequality evaluates this rate throughout the ","authors_text":"Haixiang Zhang, Mei Lu, Mengyu Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T13:40:05Z","title":"Entropy Transference for Rainbow-$H$-Free Colourings of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04845","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:7edd20ed3b791627611eddc241ad1d8333efdf0b630742502ffcfee4f5862c87","target":"record","created_at":"2026-08-06T01:47:23Z","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":"6fb615fcaf2e52d5625c020d8b72d9475d96cfc135e8cc5438adbecd25592d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T13:40:05Z","title_canon_sha256":"c2c9328752af588ba6e28b6fec4ecd4eb0632ff7f03d20d3b5887d4ff239ae16"},"schema_version":"1.0","source":{"id":"2608.04845","kind":"arxiv","version":1}},"canonical_sha256":"7ad47d1aaed67c533a3b1bd06f1c805d68d52a75e33cd2944885d45db816b796","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ad47d1aaed67c533a3b1bd06f1c805d68d52a75e33cd2944885d45db816b796","first_computed_at":"2026-08-06T01:47:23.595183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:47:23.595183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fIl+adxkFdoTxelgloBPBPMIqgWdJXuu2E946XKPtpAgYQgdmAWxlS9rt3KM9mTYawRgG44Vk8NAXAC0gcbYDA==","signature_status":"signed_v1","signed_at":"2026-08-06T01:47:23.596640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7edd20ed3b791627611eddc241ad1d8333efdf0b630742502ffcfee4f5862c87","sha256:a5496b971b31bb2cad8a25f825aaf45ed192fd0d407f60cb906468f2488fa2d3"],"state_sha256":"567c14aa34993e4c533acb43a2d2d567462b8d7a780dd77ded13257a2ce51523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoxVxel7FG9ZAYGNUPZvaV053bwf3qtUYN5aYcThMsOUC2nwPMtZJWLSp0RUyzi6FdIDpEdMF0fFpTR72FRKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T04:48:17.426248Z","bundle_sha256":"7fc51834d46fb49b41319e4ffcadc69f0a846b2d1ba843a787932bc4fb469c76"}}