{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VO2JSW62QJ5PTOFFWP3ITBVMWU","short_pith_number":"pith:VO2JSW62","canonical_record":{"source":{"id":"1605.08013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T19:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"cddc00032068f7a468836be4fb0b31bd76509eebf2a63281e938f83d0f5d7c2a","abstract_canon_sha256":"fd5b89a3087555d0e04736a061e14e32c26943e652bed05745548ae50a11b22b"},"schema_version":"1.0"},"canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","source":{"kind":"arxiv","id":"1605.08013","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08013","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08013v2","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08013","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"VO2JSW62QJ5P","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VO2JSW62QJ5PTOFF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VO2JSW62","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VO2JSW62QJ5PTOFFWP3ITBVMWU","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T19:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"cddc00032068f7a468836be4fb0b31bd76509eebf2a63281e938f83d0f5d7c2a","abstract_canon_sha256":"fd5b89a3087555d0e04736a061e14e32c26943e652bed05745548ae50a11b22b"},"schema_version":"1.0"},"canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.112832Z","signature_b64":"Iy7MA32M7gRaTbVZH6F49Nw8fFEBRwbbmugBz79G/O2oVuGzrmUpTFqnS6XULKQGtNbr8JhLDp/ZVTAXwkeRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","last_reissued_at":"2026-05-18T01:13:30.112046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.112046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08013","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:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbP9CXq6Sh5MByeoLZGuUSfMJiHoRsxD9gjzC1HU84MeEWyy146gZRmH92506jqUo2yf/ElLMzKn7sObr/+PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:58:12.458251Z"},"content_sha256":"0e51084b865fe4cec4bd37614468fe6a8d66861d76b7ca571d931d23244c92cb","schema_version":"1.0","event_id":"sha256:0e51084b865fe4cec4bd37614468fe6a8d66861d76b7ca571d931d23244c92cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VO2JSW62QJ5PTOFFWP3ITBVMWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-colorings of graphs avoiding complete graphs with a prescribed coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Hoppen, Fabricio S. Benevides, Rudini Menezes Sampaio","submitted_at":"2016-05-25T19:20:09Z","abstract_excerpt":"Given a graph $F$ and an integer $r \\ge 2$, a partition $\\widehat{F}$ of the edge set of $F$ into at most $r$ classes, and a graph $G$, define $c_{r, \\widehat{F}}(G)$ as the number of $r$-colorings of the edges of $G$ that do not contain a copy of $F$ such that the edge partition induced by the coloring is isomorphic to the one of $F$. We think of $\\widehat{F}$ as the pattern of coloring that should be avoided. The main question is, for a large enough $n$, to find the (extremal) graph $G$ on $n$ vertices which maximizes $c_{r, \\widehat{F}}(G)$. This problem generalizes a question of Erd{\\H o}s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08013","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:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fg0tQluAenom3dgMA7OHwrZIAxq5GJQnnV41TCzZYesla9ig9+RZ46fDAvVLq1IiDMqyG1ICB/wu5oZM/3+JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:58:12.458624Z"},"content_sha256":"24ef18d45d40cce554b24e09bfc04781dcf3a7e0538e5bbb97dd7718459218a3","schema_version":"1.0","event_id":"sha256:24ef18d45d40cce554b24e09bfc04781dcf3a7e0538e5bbb97dd7718459218a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/bundle.json","state_url":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/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-06-05T11:58:12Z","links":{"resolver":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU","bundle":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/bundle.json","state":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VO2JSW62QJ5PTOFFWP3ITBVMWU","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":"fd5b89a3087555d0e04736a061e14e32c26943e652bed05745548ae50a11b22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T19:20:09Z","title_canon_sha256":"cddc00032068f7a468836be4fb0b31bd76509eebf2a63281e938f83d0f5d7c2a"},"schema_version":"1.0","source":{"id":"1605.08013","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08013","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08013v2","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08013","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"VO2JSW62QJ5P","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VO2JSW62QJ5PTOFF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VO2JSW62","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:24ef18d45d40cce554b24e09bfc04781dcf3a7e0538e5bbb97dd7718459218a3","target":"graph","created_at":"2026-05-18T01:13:30Z","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 a graph $F$ and an integer $r \\ge 2$, a partition $\\widehat{F}$ of the edge set of $F$ into at most $r$ classes, and a graph $G$, define $c_{r, \\widehat{F}}(G)$ as the number of $r$-colorings of the edges of $G$ that do not contain a copy of $F$ such that the edge partition induced by the coloring is isomorphic to the one of $F$. We think of $\\widehat{F}$ as the pattern of coloring that should be avoided. The main question is, for a large enough $n$, to find the (extremal) graph $G$ on $n$ vertices which maximizes $c_{r, \\widehat{F}}(G)$. This problem generalizes a question of Erd{\\H o}s","authors_text":"Carlos Hoppen, Fabricio S. Benevides, Rudini Menezes Sampaio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T19:20:09Z","title":"Edge-colorings of graphs avoiding complete graphs with a prescribed coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08013","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:0e51084b865fe4cec4bd37614468fe6a8d66861d76b7ca571d931d23244c92cb","target":"record","created_at":"2026-05-18T01:13:30Z","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":"fd5b89a3087555d0e04736a061e14e32c26943e652bed05745548ae50a11b22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T19:20:09Z","title_canon_sha256":"cddc00032068f7a468836be4fb0b31bd76509eebf2a63281e938f83d0f5d7c2a"},"schema_version":"1.0","source":{"id":"1605.08013","kind":"arxiv","version":2}},"canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","first_computed_at":"2026-05-18T01:13:30.112046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:30.112046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iy7MA32M7gRaTbVZH6F49Nw8fFEBRwbbmugBz79G/O2oVuGzrmUpTFqnS6XULKQGtNbr8JhLDp/ZVTAXwkeRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:30.112832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08013","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e51084b865fe4cec4bd37614468fe6a8d66861d76b7ca571d931d23244c92cb","sha256:24ef18d45d40cce554b24e09bfc04781dcf3a7e0538e5bbb97dd7718459218a3"],"state_sha256":"4eb121da5d6d35489894355586deb88a6e1ab993d5840507e43b758867e53f70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjhKlizwH4f/aUGJR4sQk7TmXSeEABNDR/F4J4hTaIufMC0MzctinIbdv2vkAtpRTx2F/lmuMYTlGjQgj2RwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:58:12.460608Z","bundle_sha256":"c8e33fdd606ad9fb11a8d5b60581c2cebc730f5bc24f8a6c126a623a91e73307"}}