{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FLCWMCR2ILLKAKIMC2HJYRPHSX","short_pith_number":"pith:FLCWMCR2","schema_version":"1.0","canonical_sha256":"2ac5660a3a42d6a0290c168e9c45e795f083922463e608393e0f43a1ea6cf3ad","source":{"kind":"arxiv","id":"1906.05504","version":1},"attestation_state":"computed","paper":{"title":"Fractional cocoloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\\"undgen, John Gimbel, Michael Molloy","submitted_at":"2019-06-13T06:42:34Z","abstract_excerpt":"The cochromatic number $Z(G)$ of a graph $G$ is the fewest number of colors needed to color the vertices of $G$ so that each color class is a clique or an independent set. In a fractional cocoloring of $G$ a non-negative weight is assigned to each clique and independent set so that for each vertex $v$, the sum of the weights of all cliques and independent sets containing $v$ is at least one. The smallest total weight of such a fractional cocoloring of $G$ is the fractional cochromatic number $Z_f(G)$.\n  In this paper we prove results for the fractional cochromatic number $Z_f(G)$ that parallel"},"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":"1906.05504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-13T06:42:34Z","cross_cats_sorted":[],"title_canon_sha256":"bc71809785ab33dbcbe75d04d1d56fc10be194b790c32bc6669a1fc855070a78","abstract_canon_sha256":"c77d5d9985fef85018ae04480c9cfb6d967ab1ae0fdfc70306b8b9399547bec3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:25.206266Z","signature_b64":"MDuy9i1yGdOxI7B9pMrNBjMhZZP0dyMimQXEPBc8+I6HswsJ26YIjCJeHy1j+4ou7fYmC5ATqXHrzCeKrBFkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ac5660a3a42d6a0290c168e9c45e795f083922463e608393e0f43a1ea6cf3ad","last_reissued_at":"2026-05-17T23:43:25.205808Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:25.205808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional cocoloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\\"undgen, John Gimbel, Michael Molloy","submitted_at":"2019-06-13T06:42:34Z","abstract_excerpt":"The cochromatic number $Z(G)$ of a graph $G$ is the fewest number of colors needed to color the vertices of $G$ so that each color class is a clique or an independent set. In a fractional cocoloring of $G$ a non-negative weight is assigned to each clique and independent set so that for each vertex $v$, the sum of the weights of all cliques and independent sets containing $v$ is at least one. The smallest total weight of such a fractional cocoloring of $G$ is the fractional cochromatic number $Z_f(G)$.\n  In this paper we prove results for the fractional cochromatic number $Z_f(G)$ that parallel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05504","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":""},"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":"1906.05504","created_at":"2026-05-17T23:43:25.205886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05504v1","created_at":"2026-05-17T23:43:25.205886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05504","created_at":"2026-05-17T23:43:25.205886+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLCWMCR2ILLK","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLCWMCR2ILLKAKIM","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLCWMCR2","created_at":"2026-05-18T12:33:15.570797+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/FLCWMCR2ILLKAKIMC2HJYRPHSX","json":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX.json","graph_json":"https://pith.science/api/pith-number/FLCWMCR2ILLKAKIMC2HJYRPHSX/graph.json","events_json":"https://pith.science/api/pith-number/FLCWMCR2ILLKAKIMC2HJYRPHSX/events.json","paper":"https://pith.science/paper/FLCWMCR2"},"agent_actions":{"view_html":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX","download_json":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX.json","view_paper":"https://pith.science/paper/FLCWMCR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05504&json=true","fetch_graph":"https://pith.science/api/pith-number/FLCWMCR2ILLKAKIMC2HJYRPHSX/graph.json","fetch_events":"https://pith.science/api/pith-number/FLCWMCR2ILLKAKIMC2HJYRPHSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX/action/storage_attestation","attest_author":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX/action/author_attestation","sign_citation":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX/action/citation_signature","submit_replication":"https://pith.science/pith/FLCWMCR2ILLKAKIMC2HJYRPHSX/action/replication_record"}},"created_at":"2026-05-17T23:43:25.205886+00:00","updated_at":"2026-05-17T23:43:25.205886+00:00"}