{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6MCRYTU3GNOQM3CYW52X7R6CGI","short_pith_number":"pith:6MCRYTU3","canonical_record":{"source":{"id":"1108.5204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T21:24:23Z","cross_cats_sorted":[],"title_canon_sha256":"84947712bd31548e32202622e75bf8cf3e55a739f133349cf9ae2dc72c030a3a","abstract_canon_sha256":"480dbfaac6532aef0e6223483dce7d9365fa3ea8ac21199074b72194864fd20e"},"schema_version":"1.0"},"canonical_sha256":"f3051c4e9b335d066c58b7757fc7c2322da3365c0f7b51e80c736c54ef4dae1e","source":{"kind":"arxiv","id":"1108.5204","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5204","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5204v2","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5204","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"6MCRYTU3GNOQ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6MCRYTU3GNOQM3CY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6MCRYTU3","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6MCRYTU3GNOQM3CYW52X7R6CGI","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T21:24:23Z","cross_cats_sorted":[],"title_canon_sha256":"84947712bd31548e32202622e75bf8cf3e55a739f133349cf9ae2dc72c030a3a","abstract_canon_sha256":"480dbfaac6532aef0e6223483dce7d9365fa3ea8ac21199074b72194864fd20e"},"schema_version":"1.0"},"canonical_sha256":"f3051c4e9b335d066c58b7757fc7c2322da3365c0f7b51e80c736c54ef4dae1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:39.930835Z","signature_b64":"wnGfo3migxuathv4EABdG0PGNTSicUr1lg16Xa5Z69i9MdV1BCD7rmbgWPD5pIrnCawYmSKHTi4846sh1jvhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3051c4e9b335d066c58b7757fc7c2322da3365c0f7b51e80c736c54ef4dae1e","last_reissued_at":"2026-05-18T01:26:39.930113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:39.930113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5204","source_version":2,"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-18T01:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4t9j8d6xdMs+HSbxHvOUWz7L5eC35nc8zBaHp5+ULhKzGI4ZaRCI4HDF/JOdq0t//7DDXtvASHv/BK/nnrbhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T17:43:01.504215Z"},"content_sha256":"bbe3c5cfe4d6537f80ba4f261753fcfe11a911f931d6a1e76ee3587bf8c75836","schema_version":"1.0","event_id":"sha256:bbe3c5cfe4d6537f80ba4f261753fcfe11a911f931d6a1e76ee3587bf8c75836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6MCRYTU3GNOQM3CYW52X7R6CGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On anti-Ramsey numbers for complete bipartite graphs and the Turan function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop, Michelle York","submitted_at":"2011-08-25T21:24:23Z","abstract_excerpt":"Given two graphs $G$ and $H$ with $H\\subseteq G$ we consider the anti-Ramsey function $AR(G,H)$ which is the maximum number of colors in any edge-coloring of $G$ so that every copy of $H$ receives the same color on at least one pair of edges. The classical Tur\\'an function for a graph $G$ and family of graphs $\\mathcal{F}$, written $ex(G,\\mathcal{F})$, is defined as the maximum number of edges of a subgraph of $G$ not containing any member of $\\mathcal{F}$. We show that there exists a constant $c>0$ so that $AR(K_n,K_{s,t})-ex(K_n,K_{s,t})<cn$ and $c$ depends only on $s$ and $t$, which implies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5204","kind":"arxiv","version":2},"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-18T01:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JD6LAo8+Pjr7zpwyJAqSf4YuF0dGoPRBWnkruNIGepZVThIF+PaTm57MOsn6CHa+FSJZoaJsFGI7HDIovLmeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T17:43:01.504573Z"},"content_sha256":"88d5d1b523d77d70229ba35e5d6734f0586b1439c35e1912352c04d74d9c6d35","schema_version":"1.0","event_id":"sha256:88d5d1b523d77d70229ba35e5d6734f0586b1439c35e1912352c04d74d9c6d35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MCRYTU3GNOQM3CYW52X7R6CGI/bundle.json","state_url":"https://pith.science/pith/6MCRYTU3GNOQM3CYW52X7R6CGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MCRYTU3GNOQM3CYW52X7R6CGI/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-01T17:43:01Z","links":{"resolver":"https://pith.science/pith/6MCRYTU3GNOQM3CYW52X7R6CGI","bundle":"https://pith.science/pith/6MCRYTU3GNOQM3CYW52X7R6CGI/bundle.json","state":"https://pith.science/pith/6MCRYTU3GNOQM3CYW52X7R6CGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MCRYTU3GNOQM3CYW52X7R6CGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6MCRYTU3GNOQM3CYW52X7R6CGI","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":"480dbfaac6532aef0e6223483dce7d9365fa3ea8ac21199074b72194864fd20e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T21:24:23Z","title_canon_sha256":"84947712bd31548e32202622e75bf8cf3e55a739f133349cf9ae2dc72c030a3a"},"schema_version":"1.0","source":{"id":"1108.5204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5204","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5204v2","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5204","created_at":"2026-05-18T01:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"6MCRYTU3GNOQ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6MCRYTU3GNOQM3CY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6MCRYTU3","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:88d5d1b523d77d70229ba35e5d6734f0586b1439c35e1912352c04d74d9c6d35","target":"graph","created_at":"2026-05-18T01:26:39Z","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":"Given two graphs $G$ and $H$ with $H\\subseteq G$ we consider the anti-Ramsey function $AR(G,H)$ which is the maximum number of colors in any edge-coloring of $G$ so that every copy of $H$ receives the same color on at least one pair of edges. The classical Tur\\'an function for a graph $G$ and family of graphs $\\mathcal{F}$, written $ex(G,\\mathcal{F})$, is defined as the maximum number of edges of a subgraph of $G$ not containing any member of $\\mathcal{F}$. We show that there exists a constant $c>0$ so that $AR(K_n,K_{s,t})-ex(K_n,K_{s,t})<cn$ and $c$ depends only on $s$ and $t$, which implies","authors_text":"Elliot Krop, Michelle York","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T21:24:23Z","title":"On anti-Ramsey numbers for complete bipartite graphs and the Turan function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5204","kind":"arxiv","version":2},"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:bbe3c5cfe4d6537f80ba4f261753fcfe11a911f931d6a1e76ee3587bf8c75836","target":"record","created_at":"2026-05-18T01:26:39Z","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":"480dbfaac6532aef0e6223483dce7d9365fa3ea8ac21199074b72194864fd20e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T21:24:23Z","title_canon_sha256":"84947712bd31548e32202622e75bf8cf3e55a739f133349cf9ae2dc72c030a3a"},"schema_version":"1.0","source":{"id":"1108.5204","kind":"arxiv","version":2}},"canonical_sha256":"f3051c4e9b335d066c58b7757fc7c2322da3365c0f7b51e80c736c54ef4dae1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3051c4e9b335d066c58b7757fc7c2322da3365c0f7b51e80c736c54ef4dae1e","first_computed_at":"2026-05-18T01:26:39.930113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:39.930113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wnGfo3migxuathv4EABdG0PGNTSicUr1lg16Xa5Z69i9MdV1BCD7rmbgWPD5pIrnCawYmSKHTi4846sh1jvhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:39.930835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbe3c5cfe4d6537f80ba4f261753fcfe11a911f931d6a1e76ee3587bf8c75836","sha256:88d5d1b523d77d70229ba35e5d6734f0586b1439c35e1912352c04d74d9c6d35"],"state_sha256":"a3dee3cc0ca68a241854b56ecdd5c0bc21ebbfb648d6139d4dcee7626cab78b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6Qv6pzUxbjfov6tr1rVRNDdw77oWeDjTjunUm5bWr/a4Zv9sXQD9YSVuN6y+esa9o5N0PcmNkaIGsKu1w92CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T17:43:01.506411Z","bundle_sha256":"44f15ef8c0133d655f161ab65ae689a353789cf6fa9f14912520cf5e461c5528"}}