{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:I3LJ7UEQNPXADXCRDJX3NYQ3DY","short_pith_number":"pith:I3LJ7UEQ","schema_version":"1.0","canonical_sha256":"46d69fd0906bee01dc511a6fb6e21b1e04ab3988b2b362554d8a524a6160375b","source":{"kind":"arxiv","id":"1108.5757","version":1},"attestation_state":"computed","paper":{"title":"Optimal k-fold colorings of webs and antiwebs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Manoel Camp\\^elo, Marcio C. Santos, Phablo F. S. Moura, Ricardo C. Corr\\^ea","submitted_at":"2011-08-29T21:22:34Z","abstract_excerpt":"A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The smallest number x such that G admits a k-fold x-coloring is the k-th chromatic number of G, denoted by \\chi_k(G). We determine the exact value of this parameter when G is a web or an antiweb. Our results generalize the known corresponding results for odd cycles and imply necessary and sufficient conditions under which \\chi_k(G) attains its lower and upper bounds based on the clique, the fractiona"},"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":"1108.5757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-08-29T21:22:34Z","cross_cats_sorted":[],"title_canon_sha256":"4d0919d29d4e716bc7b9bfd63c68b0ce45627ddfbb984c4bd0d4e70e1d899f07","abstract_canon_sha256":"8f29e3eca5fd753bf3663b27e27c0c453201c7eaf16db43dcb1a72e6ec42edd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:42.583309Z","signature_b64":"wYgu7P7t2f/JERcmJ5FkzuPg14MQZ3KNV+0obq8lQO7n6zHOUIHJlcdLhCAB5lw2+3f7ZOin3WDpgXYSErsABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d69fd0906bee01dc511a6fb6e21b1e04ab3988b2b362554d8a524a6160375b","last_reissued_at":"2026-05-18T00:59:42.582783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:42.582783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal k-fold colorings of webs and antiwebs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Manoel Camp\\^elo, Marcio C. Santos, Phablo F. S. Moura, Ricardo C. Corr\\^ea","submitted_at":"2011-08-29T21:22:34Z","abstract_excerpt":"A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The smallest number x such that G admits a k-fold x-coloring is the k-th chromatic number of G, denoted by \\chi_k(G). We determine the exact value of this parameter when G is a web or an antiweb. Our results generalize the known corresponding results for odd cycles and imply necessary and sufficient conditions under which \\chi_k(G) attains its lower and upper bounds based on the clique, the fractiona"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5757","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":"1108.5757","created_at":"2026-05-18T00:59:42.582853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5757v1","created_at":"2026-05-18T00:59:42.582853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5757","created_at":"2026-05-18T00:59:42.582853+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3LJ7UEQNPXA","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3LJ7UEQNPXADXCR","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3LJ7UEQ","created_at":"2026-05-18T12:26:30.835961+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/I3LJ7UEQNPXADXCRDJX3NYQ3DY","json":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY.json","graph_json":"https://pith.science/api/pith-number/I3LJ7UEQNPXADXCRDJX3NYQ3DY/graph.json","events_json":"https://pith.science/api/pith-number/I3LJ7UEQNPXADXCRDJX3NYQ3DY/events.json","paper":"https://pith.science/paper/I3LJ7UEQ"},"agent_actions":{"view_html":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY","download_json":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY.json","view_paper":"https://pith.science/paper/I3LJ7UEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5757&json=true","fetch_graph":"https://pith.science/api/pith-number/I3LJ7UEQNPXADXCRDJX3NYQ3DY/graph.json","fetch_events":"https://pith.science/api/pith-number/I3LJ7UEQNPXADXCRDJX3NYQ3DY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY/action/storage_attestation","attest_author":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY/action/author_attestation","sign_citation":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY/action/citation_signature","submit_replication":"https://pith.science/pith/I3LJ7UEQNPXADXCRDJX3NYQ3DY/action/replication_record"}},"created_at":"2026-05-18T00:59:42.582853+00:00","updated_at":"2026-05-18T00:59:42.582853+00:00"}