{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:74A6YIXXNTFCDMYDOFH5KZUFOA","short_pith_number":"pith:74A6YIXX","canonical_record":{"source":{"id":"2103.12899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-24T00:15:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d09798d27295818c61f867708e62e99982c83a581d050a45d69e289f96f5fb90","abstract_canon_sha256":"60a3f9dd7897317a4c3842ad47be27170fa32ca617e17b848cef2363e8f969e8"},"schema_version":"1.0"},"canonical_sha256":"ff01ec22f76cca21b303714fd566857026e34136e2428591da3f99e31ce08e55","source":{"kind":"arxiv","id":"2103.12899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.12899","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"arxiv_version","alias_value":"2103.12899v1","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.12899","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"pith_short_12","alias_value":"74A6YIXXNTFC","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"74A6YIXXNTFCDMYD","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"74A6YIXX","created_at":"2026-07-05T02:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:74A6YIXXNTFCDMYDOFH5KZUFOA","target":"record","payload":{"canonical_record":{"source":{"id":"2103.12899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-24T00:15:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d09798d27295818c61f867708e62e99982c83a581d050a45d69e289f96f5fb90","abstract_canon_sha256":"60a3f9dd7897317a4c3842ad47be27170fa32ca617e17b848cef2363e8f969e8"},"schema_version":"1.0"},"canonical_sha256":"ff01ec22f76cca21b303714fd566857026e34136e2428591da3f99e31ce08e55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:53.275130Z","signature_b64":"xpUv4O908mme+aNRncf4vS6tdamykPMYVUiu49xPBLlo6deFCKHF5xsK6IMr2sfAJgQ08y2zI4U/qTkBNkX3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff01ec22f76cca21b303714fd566857026e34136e2428591da3f99e31ce08e55","last_reissued_at":"2026-07-05T02:25:53.274728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:53.274728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.12899","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-07-05T02:25:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fUcWjzR8RteJraO3RSkllXeTeIU3zc6OuRkzWmB8uVK/PajaxjLa9HWOxUB8WuMhbnN5rPuI6g37dvOrwj9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:35:44.708955Z"},"content_sha256":"4de4da8b157ab4129f5a3b704388bd5e6443fe425fa7db3517fd1d6704fb409c","schema_version":"1.0","event_id":"sha256:4de4da8b157ab4129f5a3b704388bd5e6443fe425fa7db3517fd1d6704fb409c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:74A6YIXXNTFCDMYDOFH5KZUFOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Multicolored Graph Realization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Josep D\\'iaz, Maria Serna, Oriol Serra, \\\"Oznur Ya\\c{s}ar Diner","submitted_at":"2021-03-24T00:15:26Z","abstract_excerpt":"We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,\\varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph ($G_\\varphi)$ in which, after collapsing to a node all vertices with the same color, we remove multiple edges and self-loops. A set of vertices $S$ is multicolored when $S$ has exactly one vertex from each color class. The problem is to decide whether there is a multicolored set $S$ such that, after identifying each vertex in $S$ with its color class, $G[S]$ coinc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.12899","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.12899/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:25:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xj91mJzJBdllA+iPTgazPR9iQ5soPkOEd2rr8aWgKKudAi7xlcMtn+BZqoN+YxBo56SyQ4d6s0mgS22OjHnaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:35:44.709346Z"},"content_sha256":"fbd115979cf7f76685c7f74df225b264af6e834511b9e1f11cbd071ecc600788","schema_version":"1.0","event_id":"sha256:fbd115979cf7f76685c7f74df225b264af6e834511b9e1f11cbd071ecc600788"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74A6YIXXNTFCDMYDOFH5KZUFOA/bundle.json","state_url":"https://pith.science/pith/74A6YIXXNTFCDMYDOFH5KZUFOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74A6YIXXNTFCDMYDOFH5KZUFOA/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-07-07T07:35:44Z","links":{"resolver":"https://pith.science/pith/74A6YIXXNTFCDMYDOFH5KZUFOA","bundle":"https://pith.science/pith/74A6YIXXNTFCDMYDOFH5KZUFOA/bundle.json","state":"https://pith.science/pith/74A6YIXXNTFCDMYDOFH5KZUFOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74A6YIXXNTFCDMYDOFH5KZUFOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:74A6YIXXNTFCDMYDOFH5KZUFOA","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":"60a3f9dd7897317a4c3842ad47be27170fa32ca617e17b848cef2363e8f969e8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-24T00:15:26Z","title_canon_sha256":"d09798d27295818c61f867708e62e99982c83a581d050a45d69e289f96f5fb90"},"schema_version":"1.0","source":{"id":"2103.12899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.12899","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"arxiv_version","alias_value":"2103.12899v1","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.12899","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"pith_short_12","alias_value":"74A6YIXXNTFC","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"74A6YIXXNTFCDMYD","created_at":"2026-07-05T02:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"74A6YIXX","created_at":"2026-07-05T02:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:fbd115979cf7f76685c7f74df225b264af6e834511b9e1f11cbd071ecc600788","target":"graph","created_at":"2026-07-05T02:25:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.12899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,\\varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph ($G_\\varphi)$ in which, after collapsing to a node all vertices with the same color, we remove multiple edges and self-loops. A set of vertices $S$ is multicolored when $S$ has exactly one vertex from each color class. The problem is to decide whether there is a multicolored set $S$ such that, after identifying each vertex in $S$ with its color class, $G[S]$ coinc","authors_text":"Josep D\\'iaz, Maria Serna, Oriol Serra, \\\"Oznur Ya\\c{s}ar Diner","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-24T00:15:26Z","title":"The Multicolored Graph Realization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.12899","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:4de4da8b157ab4129f5a3b704388bd5e6443fe425fa7db3517fd1d6704fb409c","target":"record","created_at":"2026-07-05T02:25:53Z","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":"60a3f9dd7897317a4c3842ad47be27170fa32ca617e17b848cef2363e8f969e8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-24T00:15:26Z","title_canon_sha256":"d09798d27295818c61f867708e62e99982c83a581d050a45d69e289f96f5fb90"},"schema_version":"1.0","source":{"id":"2103.12899","kind":"arxiv","version":1}},"canonical_sha256":"ff01ec22f76cca21b303714fd566857026e34136e2428591da3f99e31ce08e55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff01ec22f76cca21b303714fd566857026e34136e2428591da3f99e31ce08e55","first_computed_at":"2026-07-05T02:25:53.274728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:53.274728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xpUv4O908mme+aNRncf4vS6tdamykPMYVUiu49xPBLlo6deFCKHF5xsK6IMr2sfAJgQ08y2zI4U/qTkBNkX3CA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:53.275130Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.12899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4de4da8b157ab4129f5a3b704388bd5e6443fe425fa7db3517fd1d6704fb409c","sha256:fbd115979cf7f76685c7f74df225b264af6e834511b9e1f11cbd071ecc600788"],"state_sha256":"02698f2097e29c02f06d9c00fca8fed86bb4dc9cf75088ead1d9b31f95adbf0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcHbNnMvYh8OSQbNW9kpdLY9cLoMmrGqZZPkWN9PLl1T2TFbfJO07dkGgt+QUXr0MBZrZB4UGSl3UN53lIifDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:35:44.711533Z","bundle_sha256":"a4a4a76e56bbd504aa7296cbffe23f654c3d39d400932358ca3120854abc3870"}}