{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O6EQGC6C2O4JGDZFDT3FESCT3S","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":"5aafadadf2e0c9c8649ed6336e4772bf030a252f01e577b3cbf8c3a249a83cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-04T12:29:36Z","title_canon_sha256":"04996d8f94df2d3ec803e1c6702f0e4847c5d650267d6fdf508dfd812bbb6a62"},"schema_version":"1.0","source":{"id":"1802.01114","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01114","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01114v2","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01114","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"O6EQGC6C2O4J","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O6EQGC6C2O4JGDZF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O6EQGC6C","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b55994f25fd23ce090cb93df545b214f83dad52005ca6c2448e05d3819a6ffba","target":"graph","created_at":"2026-05-18T00:05:56Z","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":"Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex multicoloring, motivated by the situation of sharing a secret and securing it from the actions of some number of attackers. We name the multicoloring a highly $a$-resistant vertex $k$-multicoloring, where $a$ is the number of the attackers, and $k$ the number of colors. For small values $a$ we determine what is the minimal number of vertices a graph must ha","authors_text":"Damir Vuki\\v{c}evi\\'c, Tanja Vojkovi\\'c, Vinko Zlati\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-04T12:29:36Z","title":"Multicoloring of Graphs to Secure a Secret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01114","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:630a77b8bfcc7e7fb0869405ac6ce2a0df1e1b27c54b1b1c7ec8017253226216","target":"record","created_at":"2026-05-18T00:05:56Z","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":"5aafadadf2e0c9c8649ed6336e4772bf030a252f01e577b3cbf8c3a249a83cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-04T12:29:36Z","title_canon_sha256":"04996d8f94df2d3ec803e1c6702f0e4847c5d650267d6fdf508dfd812bbb6a62"},"schema_version":"1.0","source":{"id":"1802.01114","kind":"arxiv","version":2}},"canonical_sha256":"7789030bc2d3b8930f251cf6524853dc9bffb67c08a3b7e51f72fcb0c5f8c642","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7789030bc2d3b8930f251cf6524853dc9bffb67c08a3b7e51f72fcb0c5f8c642","first_computed_at":"2026-05-18T00:05:56.392052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:56.392052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+cQquNoqjYBOCX1I0zhMFkRmrl+wPVHqN1ciyRDihUIexZPv/UW16Kw2CCTokQb0WKmwJVNU8dpq+R8+E3dAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:56.392504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01114","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:630a77b8bfcc7e7fb0869405ac6ce2a0df1e1b27c54b1b1c7ec8017253226216","sha256:b55994f25fd23ce090cb93df545b214f83dad52005ca6c2448e05d3819a6ffba"],"state_sha256":"26e6287fa4123d0d4eb75c713076d52fc37886ba686f0b6aa9f1b75534217c39"}