{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AHKLTRJY7TTCSI627F42U6AGXS","short_pith_number":"pith:AHKLTRJY","schema_version":"1.0","canonical_sha256":"01d4b9c538fce62923daf979aa7806bc98ed27d2e4216fc347257b4ae0e7d6c8","source":{"kind":"arxiv","id":"2310.01186","version":3},"attestation_state":"computed","paper":{"title":"Hypergraph anti-Ramsey theorems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialei Song, Xizhi Liu","submitted_at":"2023-10-02T13:26:14Z","abstract_excerpt":"The anti-Ramsey number $\\mathrm{ar}(n,F)$ of an $r$-graph $F$ is the minimum number of colors needed to color the complete $n$-vertex $r$-graph to ensure the existence of a rainbow copy of $F$. We establish a removal-type result for the anti-Ramsey problem of $F$ when $F$ is the expansion of a hypergraph with a smaller uniformity. We present two applications of this result. First, we refine the general bound $\\mathrm{ar}(n,F) = \\mathrm{ex}(n,F_{-}) + o(n^r)$ proved by Erd{\\H o}s--Simonovits--S{\\' o}s, where $F_{-}$ denotes the family of $r$-graphs obtained from $F$ by removing one edge. Second"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.01186","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T13:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"70b1e4a32a7e652bf0f3ba67207dafc6facf3ade07fe65956ba614af25dadf09","abstract_canon_sha256":"d6cff24631faa7a8b6287cbd41ffb20f0ddf85e868415782992ddaf1f470e062"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:24.443616Z","signature_b64":"zu/mxbQ97nb59qZJ1kziIVVzTgVAyUVNxPYXcQEbdxK9B7qcHJRZ5vRBAcYcnWFwYF58y0MM2uuFic6jJH1XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d4b9c538fce62923daf979aa7806bc98ed27d2e4216fc347257b4ae0e7d6c8","last_reissued_at":"2026-07-05T09:19:24.443189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:24.443189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph anti-Ramsey theorems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialei Song, Xizhi Liu","submitted_at":"2023-10-02T13:26:14Z","abstract_excerpt":"The anti-Ramsey number $\\mathrm{ar}(n,F)$ of an $r$-graph $F$ is the minimum number of colors needed to color the complete $n$-vertex $r$-graph to ensure the existence of a rainbow copy of $F$. We establish a removal-type result for the anti-Ramsey problem of $F$ when $F$ is the expansion of a hypergraph with a smaller uniformity. We present two applications of this result. First, we refine the general bound $\\mathrm{ar}(n,F) = \\mathrm{ex}(n,F_{-}) + o(n^r)$ proved by Erd{\\H o}s--Simonovits--S{\\' o}s, where $F_{-}$ denotes the family of $r$-graphs obtained from $F$ by removing one edge. Second"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01186","kind":"arxiv","version":3},"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/2310.01186/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.01186","created_at":"2026-07-05T09:19:24.443242+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.01186v3","created_at":"2026-07-05T09:19:24.443242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01186","created_at":"2026-07-05T09:19:24.443242+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHKLTRJY7TTC","created_at":"2026-07-05T09:19:24.443242+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHKLTRJY7TTCSI62","created_at":"2026-07-05T09:19:24.443242+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHKLTRJY","created_at":"2026-07-05T09:19:24.443242+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS","json":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS.json","graph_json":"https://pith.science/api/pith-number/AHKLTRJY7TTCSI627F42U6AGXS/graph.json","events_json":"https://pith.science/api/pith-number/AHKLTRJY7TTCSI627F42U6AGXS/events.json","paper":"https://pith.science/paper/AHKLTRJY"},"agent_actions":{"view_html":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS","download_json":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS.json","view_paper":"https://pith.science/paper/AHKLTRJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.01186&json=true","fetch_graph":"https://pith.science/api/pith-number/AHKLTRJY7TTCSI627F42U6AGXS/graph.json","fetch_events":"https://pith.science/api/pith-number/AHKLTRJY7TTCSI627F42U6AGXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/action/storage_attestation","attest_author":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/action/author_attestation","sign_citation":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/action/citation_signature","submit_replication":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/action/replication_record"}},"created_at":"2026-07-05T09:19:24.443242+00:00","updated_at":"2026-07-05T09:19:24.443242+00:00"}