{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O6EQGC6C2O4JGDZFDT3FESCT3S","short_pith_number":"pith:O6EQGC6C","canonical_record":{"source":{"id":"1802.01114","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-04T12:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"04996d8f94df2d3ec803e1c6702f0e4847c5d650267d6fdf508dfd812bbb6a62","abstract_canon_sha256":"5aafadadf2e0c9c8649ed6336e4772bf030a252f01e577b3cbf8c3a249a83cd4"},"schema_version":"1.0"},"canonical_sha256":"7789030bc2d3b8930f251cf6524853dc9bffb67c08a3b7e51f72fcb0c5f8c642","source":{"kind":"arxiv","id":"1802.01114","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O6EQGC6C2O4JGDZFDT3FESCT3S","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01114","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-04T12:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"04996d8f94df2d3ec803e1c6702f0e4847c5d650267d6fdf508dfd812bbb6a62","abstract_canon_sha256":"5aafadadf2e0c9c8649ed6336e4772bf030a252f01e577b3cbf8c3a249a83cd4"},"schema_version":"1.0"},"canonical_sha256":"7789030bc2d3b8930f251cf6524853dc9bffb67c08a3b7e51f72fcb0c5f8c642","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.392504Z","signature_b64":"E+cQquNoqjYBOCX1I0zhMFkRmrl+wPVHqN1ciyRDihUIexZPv/UW16Kw2CCTokQb0WKmwJVNU8dpq+R8+E3dAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7789030bc2d3b8930f251cf6524853dc9bffb67c08a3b7e51f72fcb0c5f8c642","last_reissued_at":"2026-05-18T00:05:56.392052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.392052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01114","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-18T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqyKlIB3p2UVYFMQ54TtYobLbVykV+887Y6noPbx/63gvL0q/IB96ATP6ZgvF9N7RXS+iMuRXejzKVQptWRQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:14:13.965798Z"},"content_sha256":"630a77b8bfcc7e7fb0869405ac6ce2a0df1e1b27c54b1b1c7ec8017253226216","schema_version":"1.0","event_id":"sha256:630a77b8bfcc7e7fb0869405ac6ce2a0df1e1b27c54b1b1c7ec8017253226216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O6EQGC6C2O4JGDZFDT3FESCT3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multicoloring of Graphs to Secure a Secret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Damir Vuki\\v{c}evi\\'c, Tanja Vojkovi\\'c, Vinko Zlati\\'c","submitted_at":"2018-02-04T12:29:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01114","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-18T00:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imAmWBYRpjBDrgiBQUIq7rejTRFwfljHSYrtIBWGDP0IGiw5T19LPUDuGknHDqXRO53qj8wj9y7UGp4LqUJ7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:14:13.966142Z"},"content_sha256":"b55994f25fd23ce090cb93df545b214f83dad52005ca6c2448e05d3819a6ffba","schema_version":"1.0","event_id":"sha256:b55994f25fd23ce090cb93df545b214f83dad52005ca6c2448e05d3819a6ffba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/bundle.json","state_url":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/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-10T21:14:13Z","links":{"resolver":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S","bundle":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/bundle.json","state":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUFxUhduuUCH2N5r+5K/bpOLaxYq2628Ck7HPpq7+5JcN+7X8BrgHm7br116PkTOjtyLcGn7XUOY9Um7gmMuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:14:13.968042Z","bundle_sha256":"088d2bbeff1026224b7f01cddd3be260279d5b904834901f885cb9675a17f388"}}