{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ER245L27CN25PONORQUYQWMOFL","short_pith_number":"pith:ER245L27","canonical_record":{"source":{"id":"2406.14083","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-20T07:59:59Z","cross_cats_sorted":[],"title_canon_sha256":"ddf26b9d34085b07813424de2a371d651da63f59e4910db975987140d72fec2a","abstract_canon_sha256":"53267993ad94d283c0336490a3b986952f71f2bed06ca3fdf59a8dadb37fe117"},"schema_version":"1.0"},"canonical_sha256":"2475ceaf5f1375d7b9ae8c2988598e2ad78e8ef24c9ec57d0991691d9209c66c","source":{"kind":"arxiv","id":"2406.14083","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14083","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14083v2","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14083","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"ER245L27CN25","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"pith_short_16","alias_value":"ER245L27CN25PONO","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"pith_short_8","alias_value":"ER245L27","created_at":"2026-07-05T08:35:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ER245L27CN25PONORQUYQWMOFL","target":"record","payload":{"canonical_record":{"source":{"id":"2406.14083","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-20T07:59:59Z","cross_cats_sorted":[],"title_canon_sha256":"ddf26b9d34085b07813424de2a371d651da63f59e4910db975987140d72fec2a","abstract_canon_sha256":"53267993ad94d283c0336490a3b986952f71f2bed06ca3fdf59a8dadb37fe117"},"schema_version":"1.0"},"canonical_sha256":"2475ceaf5f1375d7b9ae8c2988598e2ad78e8ef24c9ec57d0991691d9209c66c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:04.862175Z","signature_b64":"2CUfnSsKdMha2rjK6vUyX8n2EZTzdkdMhW+HIIZCtbUZ4BRcYINUP1gUwzOCcqmwjw1Tl95CVwa6LOb3Ws8cCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2475ceaf5f1375d7b9ae8c2988598e2ad78e8ef24c9ec57d0991691d9209c66c","last_reissued_at":"2026-07-05T08:35:04.861700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:04.861700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.14083","source_version":2,"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:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuVWkYgP8R1ANEOT/Kt5TK/zBxaM+vVFSw2tmwkVmXOoxCFMnkEAgIUjeRh9HR4CGFeDSBPCoeEvgs2L6RnmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:56:10.796578Z"},"content_sha256":"57ea5a8ddaa19fc8702a0f6bfa0ca1418ee0cbf52ce52656b8fdeae9d3004786","schema_version":"1.0","event_id":"sha256:57ea5a8ddaa19fc8702a0f6bfa0ca1418ee0cbf52ce52656b8fdeae9d3004786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ER245L27CN25PONORQUYQWMOFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight bounds for rainbow partial $F$-tiling in edge-colored complete hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Jianfeng Hou, Jinghua Deng, Xizhi Liu","submitted_at":"2024-06-20T07:59:59Z","abstract_excerpt":"For an $r$-graph $F$ and integers $n,t$ satisfying $t \\le n/v(F)$, let $\\mathrm{ar}(n,tF)$ denote the minimum integer $N$ such that every edge-coloring of $K_{n}^{r}$ using $N$ colors contains a rainbow copy of $tF$, where $tF$ is the $r$-graphs consisting of $t$ vertex-disjoint copies of $F$. The case $t=1$ is the classical anti-Ramsey problem proposed by Erd\\H{o}s--Simonovits--S\\'{o}s~\\cite{ESS75}. When $F$ is a single edge, this becomes the rainbow matching problem introduced by Schiermeyer~\\cite{Sch04} and \\\"{O}zkahya--Young~\\cite{OY13}. We conduct a systematic study of $\\mathrm{ar}(n,tF)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14083","kind":"arxiv","version":2},"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/2406.14083/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:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DPjMX0RGv5g/Afou5NXAh6SmrwOObPl9PR3mv0U7gl0yPHI3A8yWndcKJtKk7RCeHJoTWiukt0d6Mi/X2vBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:56:10.797236Z"},"content_sha256":"de17cd30f494af8164e1604f4d1014df2482efc907c156da50527d2b29541d92","schema_version":"1.0","event_id":"sha256:de17cd30f494af8164e1604f4d1014df2482efc907c156da50527d2b29541d92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ER245L27CN25PONORQUYQWMOFL/bundle.json","state_url":"https://pith.science/pith/ER245L27CN25PONORQUYQWMOFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ER245L27CN25PONORQUYQWMOFL/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-19T21:56:10Z","links":{"resolver":"https://pith.science/pith/ER245L27CN25PONORQUYQWMOFL","bundle":"https://pith.science/pith/ER245L27CN25PONORQUYQWMOFL/bundle.json","state":"https://pith.science/pith/ER245L27CN25PONORQUYQWMOFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ER245L27CN25PONORQUYQWMOFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ER245L27CN25PONORQUYQWMOFL","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":"53267993ad94d283c0336490a3b986952f71f2bed06ca3fdf59a8dadb37fe117","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-20T07:59:59Z","title_canon_sha256":"ddf26b9d34085b07813424de2a371d651da63f59e4910db975987140d72fec2a"},"schema_version":"1.0","source":{"id":"2406.14083","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14083","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14083v2","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14083","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"ER245L27CN25","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"pith_short_16","alias_value":"ER245L27CN25PONO","created_at":"2026-07-05T08:35:04Z"},{"alias_kind":"pith_short_8","alias_value":"ER245L27","created_at":"2026-07-05T08:35:04Z"}],"graph_snapshots":[{"event_id":"sha256:de17cd30f494af8164e1604f4d1014df2482efc907c156da50527d2b29541d92","target":"graph","created_at":"2026-07-05T08:35:04Z","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/2406.14083/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an $r$-graph $F$ and integers $n,t$ satisfying $t \\le n/v(F)$, let $\\mathrm{ar}(n,tF)$ denote the minimum integer $N$ such that every edge-coloring of $K_{n}^{r}$ using $N$ colors contains a rainbow copy of $tF$, where $tF$ is the $r$-graphs consisting of $t$ vertex-disjoint copies of $F$. The case $t=1$ is the classical anti-Ramsey problem proposed by Erd\\H{o}s--Simonovits--S\\'{o}s~\\cite{ESS75}. When $F$ is a single edge, this becomes the rainbow matching problem introduced by Schiermeyer~\\cite{Sch04} and \\\"{O}zkahya--Young~\\cite{OY13}. We conduct a systematic study of $\\mathrm{ar}(n,tF)$","authors_text":"Caihong Yang, Jianfeng Hou, Jinghua Deng, Xizhi Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-20T07:59:59Z","title":"Tight bounds for rainbow partial $F$-tiling in edge-colored complete hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14083","kind":"arxiv","version":2},"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:57ea5a8ddaa19fc8702a0f6bfa0ca1418ee0cbf52ce52656b8fdeae9d3004786","target":"record","created_at":"2026-07-05T08:35:04Z","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":"53267993ad94d283c0336490a3b986952f71f2bed06ca3fdf59a8dadb37fe117","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-20T07:59:59Z","title_canon_sha256":"ddf26b9d34085b07813424de2a371d651da63f59e4910db975987140d72fec2a"},"schema_version":"1.0","source":{"id":"2406.14083","kind":"arxiv","version":2}},"canonical_sha256":"2475ceaf5f1375d7b9ae8c2988598e2ad78e8ef24c9ec57d0991691d9209c66c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2475ceaf5f1375d7b9ae8c2988598e2ad78e8ef24c9ec57d0991691d9209c66c","first_computed_at":"2026-07-05T08:35:04.861700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:35:04.861700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2CUfnSsKdMha2rjK6vUyX8n2EZTzdkdMhW+HIIZCtbUZ4BRcYINUP1gUwzOCcqmwjw1Tl95CVwa6LOb3Ws8cCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:35:04.862175Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.14083","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57ea5a8ddaa19fc8702a0f6bfa0ca1418ee0cbf52ce52656b8fdeae9d3004786","sha256:de17cd30f494af8164e1604f4d1014df2482efc907c156da50527d2b29541d92"],"state_sha256":"a7c1e3ce9dd695972a01c7f27e6d2c214c812ea92f374ed47525e04e7ee01098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxjtWjWDKYwUEzBrV6nqdqu3Mx8pY0Lm75kbykaTO5dmgrbmEtu+l0S7wdmnURvNRiT0PE26XnmqF3TppAJ5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T21:56:10.802627Z","bundle_sha256":"86e37dff1c6b043e00ec631aa6234f989f5b762a418c27487b58570c226d81ce"}}