{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ICZPE5I6F2JQECKISFOF7KDKXV","short_pith_number":"pith:ICZPE5I6","schema_version":"1.0","canonical_sha256":"40b2f2751e2e93020948915c5fa86abd6926b5729736e77e6c9720080f38e01f","source":{"kind":"arxiv","id":"0911.4218","version":1},"attestation_state":"computed","paper":{"title":"Weighted-Set Graph Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.MP"],"primary_cat":"math-ph","authors_text":"Robert Shrock, Yan Xu","submitted_at":"2009-11-22T02:23:25Z","abstract_excerpt":"We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$ colors contained in the set of $q$ colors. We construct and analyze a weighted-set chromatic polynomial $Ph(G,q,s,w)$ associated with this coloring. General properties of this weighted-set chromatic polynomial are proved, and illustrative calculations are presented for various families of graphs. This study extends a previous one for the case $s=1$ and reveal"},"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":"0911.4218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2009-11-22T02:23:25Z","cross_cats_sorted":["cond-mat.stat-mech","math.MP"],"title_canon_sha256":"3368359528b00ae7e1db13dd92f807c77f16ccfe4376625571954573a502b385","abstract_canon_sha256":"7b6d4bb42d997cc428a1819915093e21aeff3c7dcbff228320d7862b771fcf6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:17.087513Z","signature_b64":"Zgm59C0NMP61SPeXlVznTqQZ9GnkjEMIfuVc2L4D72Zw6l8YVC2btVtM6WK6RaYeBHU17mqtnv0MacUxtdQZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40b2f2751e2e93020948915c5fa86abd6926b5729736e77e6c9720080f38e01f","last_reissued_at":"2026-05-18T04:15:17.086978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:17.086978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted-Set Graph Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.MP"],"primary_cat":"math-ph","authors_text":"Robert Shrock, Yan Xu","submitted_at":"2009-11-22T02:23:25Z","abstract_excerpt":"We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$ colors contained in the set of $q$ colors. We construct and analyze a weighted-set chromatic polynomial $Ph(G,q,s,w)$ associated with this coloring. General properties of this weighted-set chromatic polynomial are proved, and illustrative calculations are presented for various families of graphs. This study extends a previous one for the case $s=1$ and reveal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4218","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":"0911.4218","created_at":"2026-05-18T04:15:17.087068+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4218v1","created_at":"2026-05-18T04:15:17.087068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4218","created_at":"2026-05-18T04:15:17.087068+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICZPE5I6F2JQ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICZPE5I6F2JQECKI","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICZPE5I6","created_at":"2026-05-18T12:26:00.592388+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/ICZPE5I6F2JQECKISFOF7KDKXV","json":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV.json","graph_json":"https://pith.science/api/pith-number/ICZPE5I6F2JQECKISFOF7KDKXV/graph.json","events_json":"https://pith.science/api/pith-number/ICZPE5I6F2JQECKISFOF7KDKXV/events.json","paper":"https://pith.science/paper/ICZPE5I6"},"agent_actions":{"view_html":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV","download_json":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV.json","view_paper":"https://pith.science/paper/ICZPE5I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4218&json=true","fetch_graph":"https://pith.science/api/pith-number/ICZPE5I6F2JQECKISFOF7KDKXV/graph.json","fetch_events":"https://pith.science/api/pith-number/ICZPE5I6F2JQECKISFOF7KDKXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV/action/storage_attestation","attest_author":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV/action/author_attestation","sign_citation":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV/action/citation_signature","submit_replication":"https://pith.science/pith/ICZPE5I6F2JQECKISFOF7KDKXV/action/replication_record"}},"created_at":"2026-05-18T04:15:17.087068+00:00","updated_at":"2026-05-18T04:15:17.087068+00:00"}