{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GQV3NMDONESOZ6EIDSQYEQP4WX","short_pith_number":"pith:GQV3NMDO","canonical_record":{"source":{"id":"0803.0572","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-04T23:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"33cf79b7480738ef277e090232a10e1f5f3672f655a2aabe64788e1803456801","abstract_canon_sha256":"39c5e7b131a2ce4b062a6de99db779e2875bf940ba33ee5cc22209ae8054111e"},"schema_version":"1.0"},"canonical_sha256":"342bb6b06e6924ecf8881ca18241fcb5fb42efd83dd8f43a2162257a979bf65b","source":{"kind":"arxiv","id":"0803.0572","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0572","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0572v3","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0572","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"GQV3NMDONESO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GQV3NMDONESOZ6EI","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GQV3NMDO","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GQV3NMDONESOZ6EIDSQYEQP4WX","target":"record","payload":{"canonical_record":{"source":{"id":"0803.0572","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-04T23:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"33cf79b7480738ef277e090232a10e1f5f3672f655a2aabe64788e1803456801","abstract_canon_sha256":"39c5e7b131a2ce4b062a6de99db779e2875bf940ba33ee5cc22209ae8054111e"},"schema_version":"1.0"},"canonical_sha256":"342bb6b06e6924ecf8881ca18241fcb5fb42efd83dd8f43a2162257a979bf65b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:27.634146Z","signature_b64":"wwU03RQSEkPqo8L+rZ9319pnCH5YFXT/MKiczZOcqSBt0zlSX9jvdxkacz/INXQsq4206rpim2q5POScmODADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"342bb6b06e6924ecf8881ca18241fcb5fb42efd83dd8f43a2162257a979bf65b","last_reissued_at":"2026-05-18T03:00:27.633344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:27.633344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0803.0572","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-05-18T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8WdMkZxUA80EdBypmnHp2hEKfyeeZYLbvxmeD6gzoNtVhOMx+eJbz1BNIb/bgtmaHG+EiBd0I3UK+FYbKGGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:46:18.196575Z"},"content_sha256":"3949cd4cedf06161930b860a8a02389916cbbac30c8d33e175168935b5a44ca4","schema_version":"1.0","event_id":"sha256:3949cd4cedf06161930b860a8a02389916cbbac30c8d33e175168935b5a44ca4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GQV3NMDONESOZ6EIDSQYEQP4WX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-rainbow edge-colorings of some small subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop, Irina Krop","submitted_at":"2008-03-04T23:44:41Z","abstract_excerpt":"Let $f(n,p,q)$ be the minimum number of colors necessary to color the edges of $K_n$ so that every $K_p$ is at least $q$-colored. We improve current bounds on the {7/4}n-3$, slightly improving the bound of Axenovich. We make small improvements on bounds of Erd\\H os and Gy\\'arf\\'as by showing ${5/6}n+1\\leq f(n,4,5)$ and for all even $n\\not\\equiv 1 \\pmod 3$, $f(n,4,5)\\leq n-1$ . For a complete bipartite graph $G=K_{n,n}$, we show an n-color construction to color the edges of $G$ so that every $C_4\\subseteq G$ is colored by at least three colors. This improves the best known upper bound of M. Axe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0572","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":""},"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-05-18T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYrq00sc/VntyumzTmPs1IoSh2b66PwYkzqcRY6SHxWYrL6aggYP+xvpixCPJ36cGEBsgrS3Kjn4Jl2WFMYxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:46:18.196923Z"},"content_sha256":"5d946189bd3ee7158ea949d94a1869c7bd797f448a165dfd2d98cf28b076a657","schema_version":"1.0","event_id":"sha256:5d946189bd3ee7158ea949d94a1869c7bd797f448a165dfd2d98cf28b076a657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQV3NMDONESOZ6EIDSQYEQP4WX/bundle.json","state_url":"https://pith.science/pith/GQV3NMDONESOZ6EIDSQYEQP4WX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQV3NMDONESOZ6EIDSQYEQP4WX/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-07-01T15:46:18Z","links":{"resolver":"https://pith.science/pith/GQV3NMDONESOZ6EIDSQYEQP4WX","bundle":"https://pith.science/pith/GQV3NMDONESOZ6EIDSQYEQP4WX/bundle.json","state":"https://pith.science/pith/GQV3NMDONESOZ6EIDSQYEQP4WX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQV3NMDONESOZ6EIDSQYEQP4WX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GQV3NMDONESOZ6EIDSQYEQP4WX","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":"39c5e7b131a2ce4b062a6de99db779e2875bf940ba33ee5cc22209ae8054111e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-04T23:44:41Z","title_canon_sha256":"33cf79b7480738ef277e090232a10e1f5f3672f655a2aabe64788e1803456801"},"schema_version":"1.0","source":{"id":"0803.0572","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0572","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0572v3","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0572","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"GQV3NMDONESO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GQV3NMDONESOZ6EI","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GQV3NMDO","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:5d946189bd3ee7158ea949d94a1869c7bd797f448a165dfd2d98cf28b076a657","target":"graph","created_at":"2026-05-18T03:00:27Z","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"},"paper":{"abstract_excerpt":"Let $f(n,p,q)$ be the minimum number of colors necessary to color the edges of $K_n$ so that every $K_p$ is at least $q$-colored. We improve current bounds on the {7/4}n-3$, slightly improving the bound of Axenovich. We make small improvements on bounds of Erd\\H os and Gy\\'arf\\'as by showing ${5/6}n+1\\leq f(n,4,5)$ and for all even $n\\not\\equiv 1 \\pmod 3$, $f(n,4,5)\\leq n-1$ . For a complete bipartite graph $G=K_{n,n}$, we show an n-color construction to color the edges of $G$ so that every $C_4\\subseteq G$ is colored by at least three colors. This improves the best known upper bound of M. Axe","authors_text":"Elliot Krop, Irina Krop","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-04T23:44:41Z","title":"Almost-rainbow edge-colorings of some small subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0572","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:3949cd4cedf06161930b860a8a02389916cbbac30c8d33e175168935b5a44ca4","target":"record","created_at":"2026-05-18T03:00:27Z","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":"39c5e7b131a2ce4b062a6de99db779e2875bf940ba33ee5cc22209ae8054111e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-04T23:44:41Z","title_canon_sha256":"33cf79b7480738ef277e090232a10e1f5f3672f655a2aabe64788e1803456801"},"schema_version":"1.0","source":{"id":"0803.0572","kind":"arxiv","version":3}},"canonical_sha256":"342bb6b06e6924ecf8881ca18241fcb5fb42efd83dd8f43a2162257a979bf65b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"342bb6b06e6924ecf8881ca18241fcb5fb42efd83dd8f43a2162257a979bf65b","first_computed_at":"2026-05-18T03:00:27.633344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:27.633344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wwU03RQSEkPqo8L+rZ9319pnCH5YFXT/MKiczZOcqSBt0zlSX9jvdxkacz/INXQsq4206rpim2q5POScmODADg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:27.634146Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.0572","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3949cd4cedf06161930b860a8a02389916cbbac30c8d33e175168935b5a44ca4","sha256:5d946189bd3ee7158ea949d94a1869c7bd797f448a165dfd2d98cf28b076a657"],"state_sha256":"c4c7e669e1617eef2d872cb7bac9646015878a09d6835b97bdc7c5892ef4e4e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztOzfO9A3g3NSTcvZl/bJ2IMba82PvuNHP/Nzb6h4VjSap7ZFdcyBRdPtx41nYCv8YTHnfjTEMkrLKvclxZ/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:46:18.198820Z","bundle_sha256":"863faec8211051203a7af0d4939cbfc12d7b4e4c6bd205e99202144721fc7516"}}