{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LSTOPFINGMZESYZGK4S6PVJ2CV","short_pith_number":"pith:LSTOPFIN","schema_version":"1.0","canonical_sha256":"5ca6e7950d33324963265725e7d53a157f9678fd877a3984efb76c757cea3b35","source":{"kind":"arxiv","id":"2507.13329","version":1},"attestation_state":"computed","paper":{"title":"Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Bal, Patrick Bennett","submitted_at":"2025-07-17T17:47:55Z","abstract_excerpt":"The generalized Ramsey number $r(G, H, q)$ is the minimum number of colors needed to color the edges of $G$ such that every isomorphic copy of $H$ has at least $q$ colors. In this note, we improve the upper and lower bounds on $r(K_{n, n}, C_{2k}, 3)$. Our upper bound answers a question of Lane and Morrison. For $k=3$ we obtain the asymptotically sharp estimate $r(K_{n, n}, C_6, 3) = \\frac{7}{20} n + o(n)$."},"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":"2507.13329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"a8d504c40cad52f604ca117fdef3cc039ef3432291f02eb0269dd12caefa7b04","abstract_canon_sha256":"b4230e2eba456b9c2aa613de6187225a099e7c74d150cb5210e1c0430c0076c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:59.233890Z","signature_b64":"FzkT0c4jfB+K92M3n8o0pjr/I06k9b/+e+g0yi+bM4453GmvQlzLi7SoDZ1stRspNrXkqijD6yNudXLilOKxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ca6e7950d33324963265725e7d53a157f9678fd877a3984efb76c757cea3b35","last_reissued_at":"2026-07-05T11:38:59.233458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:59.233458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Bal, Patrick Bennett","submitted_at":"2025-07-17T17:47:55Z","abstract_excerpt":"The generalized Ramsey number $r(G, H, q)$ is the minimum number of colors needed to color the edges of $G$ such that every isomorphic copy of $H$ has at least $q$ colors. In this note, we improve the upper and lower bounds on $r(K_{n, n}, C_{2k}, 3)$. Our upper bound answers a question of Lane and Morrison. For $k=3$ we obtain the asymptotically sharp estimate $r(K_{n, n}, C_6, 3) = \\frac{7}{20} n + o(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13329","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/2507.13329/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":"2507.13329","created_at":"2026-07-05T11:38:59.233510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13329v1","created_at":"2026-07-05T11:38:59.233510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13329","created_at":"2026-07-05T11:38:59.233510+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSTOPFINGMZE","created_at":"2026-07-05T11:38:59.233510+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSTOPFINGMZESYZG","created_at":"2026-07-05T11:38:59.233510+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSTOPFIN","created_at":"2026-07-05T11:38:59.233510+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/LSTOPFINGMZESYZGK4S6PVJ2CV","json":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV.json","graph_json":"https://pith.science/api/pith-number/LSTOPFINGMZESYZGK4S6PVJ2CV/graph.json","events_json":"https://pith.science/api/pith-number/LSTOPFINGMZESYZGK4S6PVJ2CV/events.json","paper":"https://pith.science/paper/LSTOPFIN"},"agent_actions":{"view_html":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV","download_json":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV.json","view_paper":"https://pith.science/paper/LSTOPFIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13329&json=true","fetch_graph":"https://pith.science/api/pith-number/LSTOPFINGMZESYZGK4S6PVJ2CV/graph.json","fetch_events":"https://pith.science/api/pith-number/LSTOPFINGMZESYZGK4S6PVJ2CV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV/action/storage_attestation","attest_author":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV/action/author_attestation","sign_citation":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV/action/citation_signature","submit_replication":"https://pith.science/pith/LSTOPFINGMZESYZGK4S6PVJ2CV/action/replication_record"}},"created_at":"2026-07-05T11:38:59.233510+00:00","updated_at":"2026-07-05T11:38:59.233510+00:00"}