{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T3S2DQ275DTXEKQO6RMINA7R5L","short_pith_number":"pith:T3S2DQ27","canonical_record":{"source":{"id":"1508.07222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-28T14:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"177ab9577b8d4e1f8bd6382497ad07ee83fad3fd74c0ffb687dbc029c9bfb44d","abstract_canon_sha256":"47018a028c6bff634ce4f1e1d3dff674476652166a821b424474d002f16d94a2"},"schema_version":"1.0"},"canonical_sha256":"9ee5a1c35fe8e7722a0ef4588683f1eaf74fb3811b4e68947e3b21ac48da5526","source":{"kind":"arxiv","id":"1508.07222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07222","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07222v1","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07222","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"T3S2DQ275DTX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T3S2DQ275DTXEKQO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T3S2DQ27","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T3S2DQ275DTXEKQO6RMINA7R5L","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-28T14:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"177ab9577b8d4e1f8bd6382497ad07ee83fad3fd74c0ffb687dbc029c9bfb44d","abstract_canon_sha256":"47018a028c6bff634ce4f1e1d3dff674476652166a821b424474d002f16d94a2"},"schema_version":"1.0"},"canonical_sha256":"9ee5a1c35fe8e7722a0ef4588683f1eaf74fb3811b4e68947e3b21ac48da5526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:36.576277Z","signature_b64":"tvDpchBHq7eIODyoBssjshq00fB8dkYSXDTWKnlx/OcXeq6TC+P5BHPCFcnGBzzHeV5uvE9bVjsNagduxoIqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ee5a1c35fe8e7722a0ef4588683f1eaf74fb3811b4e68947e3b21ac48da5526","last_reissued_at":"2026-05-18T01:34:36.575631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:36.575631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07222","source_version":1,"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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgPEwKINeA/7pstsPTEcVjIWqYh8aW+GxSeExpJ+UeUG7w+XQnCxbPkkuFsiQAV5cOEWGWYAmndjMfV7OYUWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:29:48.260339Z"},"content_sha256":"8b189fa1a8cfe82d637e0d38d236aa14aa36327f63a7f6118f2dba1027038d63","schema_version":"1.0","event_id":"sha256:8b189fa1a8cfe82d637e0d38d236aa14aa36327f63a7f6118f2dba1027038d63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T3S2DQ275DTXEKQO6RMINA7R5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On chromatic number of colored mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Sagnik Sen, Sandip Das, Soumen Nandi","submitted_at":"2015-08-28T14:17:15Z","abstract_excerpt":"An $(m,n)$-colored mixed graph $G$ is a graph with its arcs having one of the $m$ different colors and edges having one of the $n$ different colors. A homomorphism $f$ of an $(m,n)$-colored mixed graph $G$ to an $(m,n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is an arc (edge) of color $c$ in $H$. The \\textit{$(m,n)$-colored mixed chromatic number} $\\chi_{(m,n)}(G)$ of an $(m,n)$-colored mixed graph $G$ is the order (number of vertices) of the smallest homomorphic image of $G$. This notion was introduced by Ne\\v{s}et\\v{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07222","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"},"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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3Vv1q1Xp3kI83uUBHRBi+KjSEUGV9CppxUacwNgxZdfr7/R2SVcR1Cfgwa9I1N+c27xs4kH/NjDpsRRU4cPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:29:48.260879Z"},"content_sha256":"0782c298174e6382485796261f02cfe2ea587a60ca69df7ea417d68dd8aab1f1","schema_version":"1.0","event_id":"sha256:0782c298174e6382485796261f02cfe2ea587a60ca69df7ea417d68dd8aab1f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3S2DQ275DTXEKQO6RMINA7R5L/bundle.json","state_url":"https://pith.science/pith/T3S2DQ275DTXEKQO6RMINA7R5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3S2DQ275DTXEKQO6RMINA7R5L/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-05-31T04:29:48Z","links":{"resolver":"https://pith.science/pith/T3S2DQ275DTXEKQO6RMINA7R5L","bundle":"https://pith.science/pith/T3S2DQ275DTXEKQO6RMINA7R5L/bundle.json","state":"https://pith.science/pith/T3S2DQ275DTXEKQO6RMINA7R5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3S2DQ275DTXEKQO6RMINA7R5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T3S2DQ275DTXEKQO6RMINA7R5L","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":"47018a028c6bff634ce4f1e1d3dff674476652166a821b424474d002f16d94a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-28T14:17:15Z","title_canon_sha256":"177ab9577b8d4e1f8bd6382497ad07ee83fad3fd74c0ffb687dbc029c9bfb44d"},"schema_version":"1.0","source":{"id":"1508.07222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07222","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07222v1","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07222","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"T3S2DQ275DTX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T3S2DQ275DTXEKQO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T3S2DQ27","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:0782c298174e6382485796261f02cfe2ea587a60ca69df7ea417d68dd8aab1f1","target":"graph","created_at":"2026-05-18T01:34:36Z","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":"An $(m,n)$-colored mixed graph $G$ is a graph with its arcs having one of the $m$ different colors and edges having one of the $n$ different colors. A homomorphism $f$ of an $(m,n)$-colored mixed graph $G$ to an $(m,n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is an arc (edge) of color $c$ in $H$. The \\textit{$(m,n)$-colored mixed chromatic number} $\\chi_{(m,n)}(G)$ of an $(m,n)$-colored mixed graph $G$ is the order (number of vertices) of the smallest homomorphic image of $G$. This notion was introduced by Ne\\v{s}et\\v{","authors_text":"Sagnik Sen, Sandip Das, Soumen Nandi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-28T14:17:15Z","title":"On chromatic number of colored mixed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07222","kind":"arxiv","version":1},"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:8b189fa1a8cfe82d637e0d38d236aa14aa36327f63a7f6118f2dba1027038d63","target":"record","created_at":"2026-05-18T01:34:36Z","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":"47018a028c6bff634ce4f1e1d3dff674476652166a821b424474d002f16d94a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-28T14:17:15Z","title_canon_sha256":"177ab9577b8d4e1f8bd6382497ad07ee83fad3fd74c0ffb687dbc029c9bfb44d"},"schema_version":"1.0","source":{"id":"1508.07222","kind":"arxiv","version":1}},"canonical_sha256":"9ee5a1c35fe8e7722a0ef4588683f1eaf74fb3811b4e68947e3b21ac48da5526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ee5a1c35fe8e7722a0ef4588683f1eaf74fb3811b4e68947e3b21ac48da5526","first_computed_at":"2026-05-18T01:34:36.575631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:36.575631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tvDpchBHq7eIODyoBssjshq00fB8dkYSXDTWKnlx/OcXeq6TC+P5BHPCFcnGBzzHeV5uvE9bVjsNagduxoIqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:36.576277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b189fa1a8cfe82d637e0d38d236aa14aa36327f63a7f6118f2dba1027038d63","sha256:0782c298174e6382485796261f02cfe2ea587a60ca69df7ea417d68dd8aab1f1"],"state_sha256":"7c53a018f5dc33735e702e9d7f7b80d5f4da5edaff40632c1fa54137c9eceda2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXBH7R1NXs0ZJUsumGmXAqpnVMIlk+G2/ym3x+IX6ivPStFU9aAEKIpKk3CTiQaCOdILw8eeDD7WsK63JLSsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:29:48.263631Z","bundle_sha256":"c77419c32352c451a72a41158e202bfcabfffe96242a405ce5a7bd707dce73f7"}}