{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:AHKLTRJY7TTCSI627F42U6AGXS","short_pith_number":"pith:AHKLTRJY","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"},"canonical_sha256":"01d4b9c538fce62923daf979aa7806bc98ed27d2e4216fc347257b4ae0e7d6c8","source":{"kind":"arxiv","id":"2310.01186","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01186","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01186v3","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01186","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"AHKLTRJY7TTC","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHKLTRJY7TTCSI62","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHKLTRJY","created_at":"2026-07-05T09:19:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:AHKLTRJY7TTCSI627F42U6AGXS","target":"record","payload":{"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"},"canonical_sha256":"01d4b9c538fce62923daf979aa7806bc98ed27d2e4216fc347257b4ae0e7d6c8","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"},"source_kind":"arxiv","source_id":"2310.01186","source_version":3,"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-05T09:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efYrB7r+fp+2TrB7we3H69Ky/wCYdwaTIcOyn6q1G6N+rXOheHANPnyEPH2ZeAc+Jrh4kLlMH+YFiO5y1wqeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:24:11.420965Z"},"content_sha256":"751f4b240ada3d298d99d0397d494895c456cbce22f79e752664c828068a8514","schema_version":"1.0","event_id":"sha256:751f4b240ada3d298d99d0397d494895c456cbce22f79e752664c828068a8514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:AHKLTRJY7TTCSI627F42U6AGXS","target":"graph","payload":{"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"},"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-05T09:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFjM1iiWem66oM+GONV/K/pNJfT37iobYd77ivZ6b/ujp73HVJ+bIU4uZ3DVQJhl9zVwVrk1cHvE5j6+WH7bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:24:11.421350Z"},"content_sha256":"1e789c3bcbbfdc90c9a020fd2ba482dba141516cc9a2619e1c770f9938086246","schema_version":"1.0","event_id":"sha256:1e789c3bcbbfdc90c9a020fd2ba482dba141516cc9a2619e1c770f9938086246"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/bundle.json","state_url":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHKLTRJY7TTCSI627F42U6AGXS/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-03T19:24:11Z","links":{"resolver":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS","bundle":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/bundle.json","state":"https://pith.science/pith/AHKLTRJY7TTCSI627F42U6AGXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHKLTRJY7TTCSI627F42U6AGXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:AHKLTRJY7TTCSI627F42U6AGXS","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":"d6cff24631faa7a8b6287cbd41ffb20f0ddf85e868415782992ddaf1f470e062","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T13:26:14Z","title_canon_sha256":"70b1e4a32a7e652bf0f3ba67207dafc6facf3ade07fe65956ba614af25dadf09"},"schema_version":"1.0","source":{"id":"2310.01186","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01186","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01186v3","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01186","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"AHKLTRJY7TTC","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHKLTRJY7TTCSI62","created_at":"2026-07-05T09:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHKLTRJY","created_at":"2026-07-05T09:19:24Z"}],"graph_snapshots":[{"event_id":"sha256:1e789c3bcbbfdc90c9a020fd2ba482dba141516cc9a2619e1c770f9938086246","target":"graph","created_at":"2026-07-05T09:19:24Z","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/2310.01186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jialei Song, Xizhi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T13:26:14Z","title":"Hypergraph anti-Ramsey theorems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01186","kind":"arxiv","version":3},"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:751f4b240ada3d298d99d0397d494895c456cbce22f79e752664c828068a8514","target":"record","created_at":"2026-07-05T09:19:24Z","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":"d6cff24631faa7a8b6287cbd41ffb20f0ddf85e868415782992ddaf1f470e062","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T13:26:14Z","title_canon_sha256":"70b1e4a32a7e652bf0f3ba67207dafc6facf3ade07fe65956ba614af25dadf09"},"schema_version":"1.0","source":{"id":"2310.01186","kind":"arxiv","version":3}},"canonical_sha256":"01d4b9c538fce62923daf979aa7806bc98ed27d2e4216fc347257b4ae0e7d6c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d4b9c538fce62923daf979aa7806bc98ed27d2e4216fc347257b4ae0e7d6c8","first_computed_at":"2026-07-05T09:19:24.443189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:19:24.443189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zu/mxbQ97nb59qZJ1kziIVVzTgVAyUVNxPYXcQEbdxK9B7qcHJRZ5vRBAcYcnWFwYF58y0MM2uuFic6jJH1XDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:19:24.443616Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.01186","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:751f4b240ada3d298d99d0397d494895c456cbce22f79e752664c828068a8514","sha256:1e789c3bcbbfdc90c9a020fd2ba482dba141516cc9a2619e1c770f9938086246"],"state_sha256":"db02de145fc7b50204ffbac80263185c191ea01b433ebe463242aa39bb0586fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlpQuUXfeq+bmlrFCL/TJhxYVmN0KDQ/vnTSGENSIG3BShgXaB2aSNo9FXLEQnmOUmYgovPHc6xW4agWbnqZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:24:11.423646Z","bundle_sha256":"d3a0c18069b56974914c6b3f4eaa9d04b1d9f7886269637e013ddd0be3d6ef21"}}