{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DBJFB6OV6KIX46MXS36YI7Z4AH","short_pith_number":"pith:DBJFB6OV","schema_version":"1.0","canonical_sha256":"185250f9d5f2917e799796fd847f3c01d1a36e6025ddebe580b3345f114fa35e","source":{"kind":"arxiv","id":"1210.4634","version":2},"attestation_state":"computed","paper":{"title":"On Weak Chromatic Polynomials of Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Blado, Joseph Crawford, Matthias Beck, Michael Young, Taina Jean-Louis","submitted_at":"2012-10-17T06:16:05Z","abstract_excerpt":"A \\emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is an edge, and the color of $u$ is less than or equal to (resp. strictly less than) the color of $v$ if $uv$ is an arc. The weak (resp. strong) chromatic polynomial of a mixed graph counts the number of proper $k$-colorings. Using order polynomials of partially ordered sets, we establish a reciprocity theorem for weak chromatic polynomials giving interpretati"},"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":"1210.4634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-17T06:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"839194b6e48be17d9f196a754339ce119e20a1f5049946a67b1b35939cdce853","abstract_canon_sha256":"30ddf82c88b55ceae0c51e82698d6e43ab5cfdc5ca8952e7230de22295acb61a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:24.423819Z","signature_b64":"qtsZoC/CkOoGUuooiKk1lGiLy792jFahMDZO1d2ovXBbIwYqFIdgYZueya4DWi+wdEzr2bTqRNnyj6D2dKJpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185250f9d5f2917e799796fd847f3c01d1a36e6025ddebe580b3345f114fa35e","last_reissued_at":"2026-05-18T01:15:24.423132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:24.423132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Weak Chromatic Polynomials of Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Blado, Joseph Crawford, Matthias Beck, Michael Young, Taina Jean-Louis","submitted_at":"2012-10-17T06:16:05Z","abstract_excerpt":"A \\emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is an edge, and the color of $u$ is less than or equal to (resp. strictly less than) the color of $v$ if $uv$ is an arc. The weak (resp. strong) chromatic polynomial of a mixed graph counts the number of proper $k$-colorings. Using order polynomials of partially ordered sets, we establish a reciprocity theorem for weak chromatic polynomials giving interpretati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4634","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4634","created_at":"2026-05-18T01:15:24.423238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4634v2","created_at":"2026-05-18T01:15:24.423238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4634","created_at":"2026-05-18T01:15:24.423238+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBJFB6OV6KIX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBJFB6OV6KIX46MX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBJFB6OV","created_at":"2026-05-18T12:27:01.376967+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/DBJFB6OV6KIX46MXS36YI7Z4AH","json":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH.json","graph_json":"https://pith.science/api/pith-number/DBJFB6OV6KIX46MXS36YI7Z4AH/graph.json","events_json":"https://pith.science/api/pith-number/DBJFB6OV6KIX46MXS36YI7Z4AH/events.json","paper":"https://pith.science/paper/DBJFB6OV"},"agent_actions":{"view_html":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH","download_json":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH.json","view_paper":"https://pith.science/paper/DBJFB6OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4634&json=true","fetch_graph":"https://pith.science/api/pith-number/DBJFB6OV6KIX46MXS36YI7Z4AH/graph.json","fetch_events":"https://pith.science/api/pith-number/DBJFB6OV6KIX46MXS36YI7Z4AH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/action/storage_attestation","attest_author":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/action/author_attestation","sign_citation":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/action/citation_signature","submit_replication":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/action/replication_record"}},"created_at":"2026-05-18T01:15:24.423238+00:00","updated_at":"2026-05-18T01:15:24.423238+00:00"}