{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N32NDTNULQMBRUMDV2OWOIXCWG","short_pith_number":"pith:N32NDTNU","canonical_record":{"source":{"id":"1810.05503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T13:47:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1a6143f36a302c610bb4f41ca42536b5bf87fff030570f179bdd73a9ba2bcb16","abstract_canon_sha256":"91360c0b06ed07b9a46c195817ef2fa796497118db8b108184be1117a8af8069"},"schema_version":"1.0"},"canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","source":{"kind":"arxiv","id":"1810.05503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05503","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05503v1","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05503","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"N32NDTNULQMB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N32NDTNULQMBRUMD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N32NDTNU","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N32NDTNULQMBRUMDV2OWOIXCWG","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T13:47:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1a6143f36a302c610bb4f41ca42536b5bf87fff030570f179bdd73a9ba2bcb16","abstract_canon_sha256":"91360c0b06ed07b9a46c195817ef2fa796497118db8b108184be1117a8af8069"},"schema_version":"1.0"},"canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:30.283690Z","signature_b64":"64+xWO92hQTgTbMgJ5ibG8oo5zdLbyJGFYsxFvVgXy52BaCzlYuEKoDddXMdCVxHwwGrUS1eMhHjy+iLIHpaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","last_reissued_at":"2026-05-18T00:03:30.282968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:30.282968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05503","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-18T00:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEaWTt4OMiNP+sIuIrsB1gzER9gUH+rTJE+n0mkH5BXktgn2QyFpyXpaNVI8eweKMre3A/Rm82YoUuaEbNZVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:19:47.367494Z"},"content_sha256":"06e78783500819a5e7ad720b45231a8c552c5498da26ee81de5276755996ad2f","schema_version":"1.0","event_id":"sha256:06e78783500819a5e7ad720b45231a8c552c5498da26ee81de5276755996ad2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N32NDTNULQMBRUMDV2OWOIXCWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On relative clique number of colored mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Debdeep Roy, Sagnik Sen, Sandip Das, Soumen Nandi","submitted_at":"2018-10-12T13:47:01Z","abstract_excerpt":"An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism 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 also an arc (edge) of color $c$. The ($m, n)$-colored mixed chromatic number of an $(m, n)$-colored mixed graph $G$, introduced by Ne\\v{s}et\\v{r}il and Raspaud [J. Combin. Theory Ser. B 2000] is the order (number of vertices) of the smallest homomorphic image of $G$. Later Bensmail, Duffy an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05503","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-18T00:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NX8XL9LOwUN9E8RP4qOiBzJFEOBIxvP4W7+8laojQMHNuADPXQTvhyyx0cywspCeRKQ4NxE+JyFn6uGkgOlSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:19:47.368168Z"},"content_sha256":"d1c6aa6155c8de0070327af49f98d44a4755a474896002c75321fe1a7e7ff8e4","schema_version":"1.0","event_id":"sha256:d1c6aa6155c8de0070327af49f98d44a4755a474896002c75321fe1a7e7ff8e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/bundle.json","state_url":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N32NDTNULQMBRUMDV2OWOIXCWG/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-25T22:19:47Z","links":{"resolver":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG","bundle":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/bundle.json","state":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N32NDTNULQMBRUMDV2OWOIXCWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N32NDTNULQMBRUMDV2OWOIXCWG","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":"91360c0b06ed07b9a46c195817ef2fa796497118db8b108184be1117a8af8069","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T13:47:01Z","title_canon_sha256":"1a6143f36a302c610bb4f41ca42536b5bf87fff030570f179bdd73a9ba2bcb16"},"schema_version":"1.0","source":{"id":"1810.05503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05503","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05503v1","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05503","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"N32NDTNULQMB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N32NDTNULQMBRUMD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N32NDTNU","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:d1c6aa6155c8de0070327af49f98d44a4755a474896002c75321fe1a7e7ff8e4","target":"graph","created_at":"2026-05-18T00:03:30Z","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 is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism 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 also an arc (edge) of color $c$. The ($m, n)$-colored mixed chromatic number of an $(m, n)$-colored mixed graph $G$, introduced by Ne\\v{s}et\\v{r}il and Raspaud [J. Combin. Theory Ser. B 2000] is the order (number of vertices) of the smallest homomorphic image of $G$. Later Bensmail, Duffy an","authors_text":"Debdeep Roy, Sagnik Sen, Sandip Das, Soumen Nandi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T13:47:01Z","title":"On relative clique number of colored mixed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05503","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:06e78783500819a5e7ad720b45231a8c552c5498da26ee81de5276755996ad2f","target":"record","created_at":"2026-05-18T00:03:30Z","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":"91360c0b06ed07b9a46c195817ef2fa796497118db8b108184be1117a8af8069","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T13:47:01Z","title_canon_sha256":"1a6143f36a302c610bb4f41ca42536b5bf87fff030570f179bdd73a9ba2bcb16"},"schema_version":"1.0","source":{"id":"1810.05503","kind":"arxiv","version":1}},"canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","first_computed_at":"2026-05-18T00:03:30.282968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:30.282968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"64+xWO92hQTgTbMgJ5ibG8oo5zdLbyJGFYsxFvVgXy52BaCzlYuEKoDddXMdCVxHwwGrUS1eMhHjy+iLIHpaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:30.283690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06e78783500819a5e7ad720b45231a8c552c5498da26ee81de5276755996ad2f","sha256:d1c6aa6155c8de0070327af49f98d44a4755a474896002c75321fe1a7e7ff8e4"],"state_sha256":"2cdb009405273c0e3051544fb58b09e08260bc000ee864cb26aeb43d9e659666"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzngO411Z8MBLZaaFMXT8eLcynrlziQjgjb/5ux/2+m7t/UseJ9x+IDVNWGNjhznSvy+woFpGxcwmeDkLvuFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:19:47.372753Z","bundle_sha256":"ae4b11f360e09b886c15666306309d85622820abadae8dee4aee3af20c90a472"}}