{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DBJFB6OV6KIX46MXS36YI7Z4AH","short_pith_number":"pith:DBJFB6OV","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"},"canonical_sha256":"185250f9d5f2917e799796fd847f3c01d1a36e6025ddebe580b3345f114fa35e","source":{"kind":"arxiv","id":"1210.4634","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4634","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4634v2","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4634","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"DBJFB6OV6KIX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DBJFB6OV6KIX46MX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DBJFB6OV","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DBJFB6OV6KIX46MXS36YI7Z4AH","target":"record","payload":{"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"},"canonical_sha256":"185250f9d5f2917e799796fd847f3c01d1a36e6025ddebe580b3345f114fa35e","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"},"source_kind":"arxiv","source_id":"1210.4634","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:15:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4riQnybpMU5Qw5NRo5414kxYLAVQSss4CXOiZxu+rxs4SPU6Ga4oN2VhOwoQ9yQ8GGs9HB4yhoh4vgIHFV9vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:58:18.074808Z"},"content_sha256":"09758f361570b36c4a7fb1a243084279022a0a4cff735bc272d1d8ccf8806e51","schema_version":"1.0","event_id":"sha256:09758f361570b36c4a7fb1a243084279022a0a4cff735bc272d1d8ccf8806e51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DBJFB6OV6KIX46MXS36YI7Z4AH","target":"graph","payload":{"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"},"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:15:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUAksyYCEYACe+blxPQwvLqxTSJ35IpF0vldTnlVMxCxEHtp5EEfVI8/mnSaLYTylue/zGx1jbCEKy/feUuzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:58:18.075155Z"},"content_sha256":"d7f89d242b260de9965b441985a83acbbe5d8e22bd0d38e93bfb81b602743cc6","schema_version":"1.0","event_id":"sha256:d7f89d242b260de9965b441985a83acbbe5d8e22bd0d38e93bfb81b602743cc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/bundle.json","state_url":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/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-03T00:58:18Z","links":{"resolver":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH","bundle":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/bundle.json","state":"https://pith.science/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBJFB6OV6KIX46MXS36YI7Z4AH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DBJFB6OV6KIX46MXS36YI7Z4AH","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":"30ddf82c88b55ceae0c51e82698d6e43ab5cfdc5ca8952e7230de22295acb61a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-17T06:16:05Z","title_canon_sha256":"839194b6e48be17d9f196a754339ce119e20a1f5049946a67b1b35939cdce853"},"schema_version":"1.0","source":{"id":"1210.4634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4634","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4634v2","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4634","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"DBJFB6OV6KIX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DBJFB6OV6KIX46MX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DBJFB6OV","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:d7f89d242b260de9965b441985a83acbbe5d8e22bd0d38e93bfb81b602743cc6","target":"graph","created_at":"2026-05-18T01:15:24Z","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":"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","authors_text":"Daniel Blado, Joseph Crawford, Matthias Beck, Michael Young, Taina Jean-Louis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-17T06:16:05Z","title":"On Weak Chromatic Polynomials of Mixed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4634","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:09758f361570b36c4a7fb1a243084279022a0a4cff735bc272d1d8ccf8806e51","target":"record","created_at":"2026-05-18T01:15:24Z","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":"30ddf82c88b55ceae0c51e82698d6e43ab5cfdc5ca8952e7230de22295acb61a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-17T06:16:05Z","title_canon_sha256":"839194b6e48be17d9f196a754339ce119e20a1f5049946a67b1b35939cdce853"},"schema_version":"1.0","source":{"id":"1210.4634","kind":"arxiv","version":2}},"canonical_sha256":"185250f9d5f2917e799796fd847f3c01d1a36e6025ddebe580b3345f114fa35e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"185250f9d5f2917e799796fd847f3c01d1a36e6025ddebe580b3345f114fa35e","first_computed_at":"2026-05-18T01:15:24.423132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:24.423132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtsZoC/CkOoGUuooiKk1lGiLy792jFahMDZO1d2ovXBbIwYqFIdgYZueya4DWi+wdEzr2bTqRNnyj6D2dKJpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:24.423819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09758f361570b36c4a7fb1a243084279022a0a4cff735bc272d1d8ccf8806e51","sha256:d7f89d242b260de9965b441985a83acbbe5d8e22bd0d38e93bfb81b602743cc6"],"state_sha256":"e96fd971652dc996cfb6171d27cca903cb2d8e32f6c8284a1d9ea11e7490b55a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOZr5KsG4lrBKY7YvtKrVksIsEBXTc6AsMf1vyyQ0dGiRr3A7ckZZvvNPyStc9qoa0JdAu7lkui92TAs/sUiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:58:18.077071Z","bundle_sha256":"41f86897c5f8d019142d70094eacaaac106e4b713722990cda64a8c9d532baf9"}}