{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JLYGQYWZ7RR2TOH6UUNVWZCCJ6","short_pith_number":"pith:JLYGQYWZ","canonical_record":{"source":{"id":"2408.10651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-20T08:46:01Z","cross_cats_sorted":[],"title_canon_sha256":"a19bea9ba65de0b0ae78b5d9fa90ebbe388a82c1729af8c45ebb6ed991bef22b","abstract_canon_sha256":"62a5584fade8f36abeb450758ffa11d142f2240f72e23cef5a2cdc2fe2656af9"},"schema_version":"1.0"},"canonical_sha256":"4af06862d9fc63a9b8fea51b5b64424f95263c7643823dea9e01d53d698e4a62","source":{"kind":"arxiv","id":"2408.10651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10651","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10651v1","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10651","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"JLYGQYWZ7RR2","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"pith_short_16","alias_value":"JLYGQYWZ7RR2TOH6","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"pith_short_8","alias_value":"JLYGQYWZ","created_at":"2026-07-05T08:57:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JLYGQYWZ7RR2TOH6UUNVWZCCJ6","target":"record","payload":{"canonical_record":{"source":{"id":"2408.10651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-20T08:46:01Z","cross_cats_sorted":[],"title_canon_sha256":"a19bea9ba65de0b0ae78b5d9fa90ebbe388a82c1729af8c45ebb6ed991bef22b","abstract_canon_sha256":"62a5584fade8f36abeb450758ffa11d142f2240f72e23cef5a2cdc2fe2656af9"},"schema_version":"1.0"},"canonical_sha256":"4af06862d9fc63a9b8fea51b5b64424f95263c7643823dea9e01d53d698e4a62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:15.204020Z","signature_b64":"Hih/UL9shSingLNGLBbuU00ct9UY7V+POhB4IJEb6cEp8UIYpEOHTnSE9aiT8PnYZkfOv8OgrdjVD4jJB0iGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af06862d9fc63a9b8fea51b5b64424f95263c7643823dea9e01d53d698e4a62","last_reissued_at":"2026-07-05T08:57:15.203670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:15.203670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.10651","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-05T08:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+09HdAzNCKA7jbA/WcSs5GKkf3l+tFQHUIgW66uiSEsYoGPVWNwqFEY3f/JUagh7voOe47DikxPYQxAI9izAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:43:51.671740Z"},"content_sha256":"c0356ace41a4d4351acf287461ce74d8bb99dce0e7da671a5259cf86af6d3e19","schema_version":"1.0","event_id":"sha256:c0356ace41a4d4351acf287461ce74d8bb99dce0e7da671a5259cf86af6d3e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JLYGQYWZ7RR2TOH6UUNVWZCCJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an edge-coloured Corr\\'adi--Hajnal theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Ella Williams","submitted_at":"2024-08-20T08:46:01Z","abstract_excerpt":"A classical result of Corr\\'adi and Hajnal states that every graph $G$ on $n$ vertices with $n\\in 3\\mathbb{N}$ and $\\delta(G) \\ge 2n/3$ contains a perfect triangle-tiling, i.e.,\\ a spanning set of vertex-disjoint triangles. We explore a generalisation of this result to edge-coloured graphs. Let $G$ be an edge-coloured graph on $n$ vertices. The minimum colour degree $\\delta^c(G)$ of $G$ is the largest integer $k$ such that, for every vertex $v \\in V(G)$, there are at least $k$ distinct colours on edges incident to $v$. We show that if $\\delta^c(G) \\ge (5/6 + \\varepsilon) n$, then $G$ has a spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10651","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/2408.10651/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-05T08:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hgx2CsePDn51z+sXBG03zdyRh/NXRXI4+Fn5fNX346IeHgyPbPp1AFhDu21LmbymheCGLhe0WcwlXUivP8aqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:43:51.672321Z"},"content_sha256":"9888271e38e597b9fb16a9ec74d199d6fa7fed3a0d1ff553be72f52e073d3ff2","schema_version":"1.0","event_id":"sha256:9888271e38e597b9fb16a9ec74d199d6fa7fed3a0d1ff553be72f52e073d3ff2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6/bundle.json","state_url":"https://pith.science/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6/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-16T19:43:51Z","links":{"resolver":"https://pith.science/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6","bundle":"https://pith.science/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6/bundle.json","state":"https://pith.science/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLYGQYWZ7RR2TOH6UUNVWZCCJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JLYGQYWZ7RR2TOH6UUNVWZCCJ6","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":"62a5584fade8f36abeb450758ffa11d142f2240f72e23cef5a2cdc2fe2656af9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-20T08:46:01Z","title_canon_sha256":"a19bea9ba65de0b0ae78b5d9fa90ebbe388a82c1729af8c45ebb6ed991bef22b"},"schema_version":"1.0","source":{"id":"2408.10651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10651","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10651v1","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10651","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"JLYGQYWZ7RR2","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"pith_short_16","alias_value":"JLYGQYWZ7RR2TOH6","created_at":"2026-07-05T08:57:15Z"},{"alias_kind":"pith_short_8","alias_value":"JLYGQYWZ","created_at":"2026-07-05T08:57:15Z"}],"graph_snapshots":[{"event_id":"sha256:9888271e38e597b9fb16a9ec74d199d6fa7fed3a0d1ff553be72f52e073d3ff2","target":"graph","created_at":"2026-07-05T08:57:15Z","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/2408.10651/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A classical result of Corr\\'adi and Hajnal states that every graph $G$ on $n$ vertices with $n\\in 3\\mathbb{N}$ and $\\delta(G) \\ge 2n/3$ contains a perfect triangle-tiling, i.e.,\\ a spanning set of vertex-disjoint triangles. We explore a generalisation of this result to edge-coloured graphs. Let $G$ be an edge-coloured graph on $n$ vertices. The minimum colour degree $\\delta^c(G)$ of $G$ is the largest integer $k$ such that, for every vertex $v \\in V(G)$, there are at least $k$ distinct colours on edges incident to $v$. We show that if $\\delta^c(G) \\ge (5/6 + \\varepsilon) n$, then $G$ has a spa","authors_text":"Allan Lo, Ella Williams","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-20T08:46:01Z","title":"Towards an edge-coloured Corr\\'adi--Hajnal theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10651","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:c0356ace41a4d4351acf287461ce74d8bb99dce0e7da671a5259cf86af6d3e19","target":"record","created_at":"2026-07-05T08:57:15Z","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":"62a5584fade8f36abeb450758ffa11d142f2240f72e23cef5a2cdc2fe2656af9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-20T08:46:01Z","title_canon_sha256":"a19bea9ba65de0b0ae78b5d9fa90ebbe388a82c1729af8c45ebb6ed991bef22b"},"schema_version":"1.0","source":{"id":"2408.10651","kind":"arxiv","version":1}},"canonical_sha256":"4af06862d9fc63a9b8fea51b5b64424f95263c7643823dea9e01d53d698e4a62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4af06862d9fc63a9b8fea51b5b64424f95263c7643823dea9e01d53d698e4a62","first_computed_at":"2026-07-05T08:57:15.203670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:57:15.203670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hih/UL9shSingLNGLBbuU00ct9UY7V+POhB4IJEb6cEp8UIYpEOHTnSE9aiT8PnYZkfOv8OgrdjVD4jJB0iGAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:57:15.204020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.10651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0356ace41a4d4351acf287461ce74d8bb99dce0e7da671a5259cf86af6d3e19","sha256:9888271e38e597b9fb16a9ec74d199d6fa7fed3a0d1ff553be72f52e073d3ff2"],"state_sha256":"ee583cb3bd022596e5663c4c5890e3c673dfada2d6d227d5d78c369aec8de9fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JVvBv+yIIB4D9Bo9mAs4uvkd9mi8VoAOFJBvMmCvkJvOpmyIoSB5hb3x2ly1FFScIIOl4aGFhIl79HSjByEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:43:51.676071Z","bundle_sha256":"27cd88abc935e56ef16ab24dd2c858fdf0f49a4b19c08a1fd639f5de7471c7b2"}}