{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LSTOPFINGMZESYZGK4S6PVJ2CV","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":"b4230e2eba456b9c2aa613de6187225a099e7c74d150cb5210e1c0430c0076c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:47:55Z","title_canon_sha256":"a8d504c40cad52f604ca117fdef3cc039ef3432291f02eb0269dd12caefa7b04"},"schema_version":"1.0","source":{"id":"2507.13329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13329","created_at":"2026-07-05T11:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13329v1","created_at":"2026-07-05T11:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13329","created_at":"2026-07-05T11:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"LSTOPFINGMZE","created_at":"2026-07-05T11:38:59Z"},{"alias_kind":"pith_short_16","alias_value":"LSTOPFINGMZESYZG","created_at":"2026-07-05T11:38:59Z"},{"alias_kind":"pith_short_8","alias_value":"LSTOPFIN","created_at":"2026-07-05T11:38:59Z"}],"graph_snapshots":[{"event_id":"sha256:57282eacfe6eab67cee01eb8dd57e9aa0964de581d03c627de5449dd0b454d2d","target":"graph","created_at":"2026-07-05T11:38:59Z","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/2507.13329/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)$.","authors_text":"Deepak Bal, Patrick Bennett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:47:55Z","title":"Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13329","kind":"arxiv","version":1},"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:7829e2763467da7694571ad389a45c8d33359d29f30677433d83e88b32e8bca1","target":"record","created_at":"2026-07-05T11:38:59Z","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":"b4230e2eba456b9c2aa613de6187225a099e7c74d150cb5210e1c0430c0076c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:47:55Z","title_canon_sha256":"a8d504c40cad52f604ca117fdef3cc039ef3432291f02eb0269dd12caefa7b04"},"schema_version":"1.0","source":{"id":"2507.13329","kind":"arxiv","version":1}},"canonical_sha256":"5ca6e7950d33324963265725e7d53a157f9678fd877a3984efb76c757cea3b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ca6e7950d33324963265725e7d53a157f9678fd877a3984efb76c757cea3b35","first_computed_at":"2026-07-05T11:38:59.233458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:59.233458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzkT0c4jfB+K92M3n8o0pjr/I06k9b/+e+g0yi+bM4453GmvQlzLi7SoDZ1stRspNrXkqijD6yNudXLilOKxAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:59.233890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.13329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7829e2763467da7694571ad389a45c8d33359d29f30677433d83e88b32e8bca1","sha256:57282eacfe6eab67cee01eb8dd57e9aa0964de581d03c627de5449dd0b454d2d"],"state_sha256":"9aee22e72c044382f29fa929c6e4a2aebd140de4a13738a8342ef2dcf52b5a7e"}