{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TX57Q27BKUJ3ZGERCRELALQ23K","short_pith_number":"pith:TX57Q27B","schema_version":"1.0","canonical_sha256":"9dfbf86be15513bc98911448b02e1adab97affc63e625f8dc0ec3cd1b9db5c5c","source":{"kind":"arxiv","id":"2607.05896","version":1},"attestation_state":"computed","paper":{"title":"On the maximal anti-Ramsey problem of Burr, Erd\\H{o}s, Graham, and S\\'{o}s for $P_4$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zixuan Yang","submitted_at":"2026-07-07T06:47:41Z","abstract_excerpt":"Given a graph $L$, the maximal anti-Ramsey function $\\chiS(n,e,L)$ denotes the minimum integer $\\chiS$ for which there exists an $n$-vertex graph $G$ with at least $e$ edges admitting an edge-coloring with $\\chiS$ colors in which each copy of $L$ in $G$ is rainbow. In 1989, Burr, Erd\\H{o}s, Graham, and S\\'{o}s posed the following problem: Is it true that for all $\\epsilon>0$, there exists $c(\\epsilon)>0$ such that for all sufficiently large $n$, $\n\\chiS\\left(n,\\binom{n}{2}-\\lfloor n^{2-\\epsilon}\\rfloor,P_4\\right)>c(\\epsilon)n^2. $\nVery recently, Li, Ning, and Xie gave a negative answer to the "},"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":"2607.05896","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-07T06:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"1f351d35e998a2e4b05af77ab06c61be0341a6d12beef5449fc4f846b15d8f89","abstract_canon_sha256":"da11fe8a42a5d5da44b6346fbb8aab0985cb1347335b708e536adc212c467068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:49.578176Z","signature_b64":"btCbshuotFNiDBB0f93uGpGPvRsrdpo11ArKPDoMQ84WIUm2zJeEdApwNNi+5XZDFiG3xjCoYQVtOyctn5v7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dfbf86be15513bc98911448b02e1adab97affc63e625f8dc0ec3cd1b9db5c5c","last_reissued_at":"2026-07-08T01:18:49.577750Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:49.577750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximal anti-Ramsey problem of Burr, Erd\\H{o}s, Graham, and S\\'{o}s for $P_4$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zixuan Yang","submitted_at":"2026-07-07T06:47:41Z","abstract_excerpt":"Given a graph $L$, the maximal anti-Ramsey function $\\chiS(n,e,L)$ denotes the minimum integer $\\chiS$ for which there exists an $n$-vertex graph $G$ with at least $e$ edges admitting an edge-coloring with $\\chiS$ colors in which each copy of $L$ in $G$ is rainbow. In 1989, Burr, Erd\\H{o}s, Graham, and S\\'{o}s posed the following problem: Is it true that for all $\\epsilon>0$, there exists $c(\\epsilon)>0$ such that for all sufficiently large $n$, $\n\\chiS\\left(n,\\binom{n}{2}-\\lfloor n^{2-\\epsilon}\\rfloor,P_4\\right)>c(\\epsilon)n^2. $\nVery recently, Li, Ning, and Xie gave a negative answer to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05896","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/2607.05896/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":"2607.05896","created_at":"2026-07-08T01:18:49.577814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05896v1","created_at":"2026-07-08T01:18:49.577814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05896","created_at":"2026-07-08T01:18:49.577814+00:00"},{"alias_kind":"pith_short_12","alias_value":"TX57Q27BKUJ3","created_at":"2026-07-08T01:18:49.577814+00:00"},{"alias_kind":"pith_short_16","alias_value":"TX57Q27BKUJ3ZGER","created_at":"2026-07-08T01:18:49.577814+00:00"},{"alias_kind":"pith_short_8","alias_value":"TX57Q27B","created_at":"2026-07-08T01:18:49.577814+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/TX57Q27BKUJ3ZGERCRELALQ23K","json":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K.json","graph_json":"https://pith.science/api/pith-number/TX57Q27BKUJ3ZGERCRELALQ23K/graph.json","events_json":"https://pith.science/api/pith-number/TX57Q27BKUJ3ZGERCRELALQ23K/events.json","paper":"https://pith.science/paper/TX57Q27B"},"agent_actions":{"view_html":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K","download_json":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K.json","view_paper":"https://pith.science/paper/TX57Q27B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/TX57Q27BKUJ3ZGERCRELALQ23K/graph.json","fetch_events":"https://pith.science/api/pith-number/TX57Q27BKUJ3ZGERCRELALQ23K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K/action/storage_attestation","attest_author":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K/action/author_attestation","sign_citation":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K/action/citation_signature","submit_replication":"https://pith.science/pith/TX57Q27BKUJ3ZGERCRELALQ23K/action/replication_record"}},"created_at":"2026-07-08T01:18:49.577814+00:00","updated_at":"2026-07-08T01:18:49.577814+00:00"}