{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O6EQGC6C2O4JGDZFDT3FESCT3S","short_pith_number":"pith:O6EQGC6C","schema_version":"1.0","canonical_sha256":"7789030bc2d3b8930f251cf6524853dc9bffb67c08a3b7e51f72fcb0c5f8c642","source":{"kind":"arxiv","id":"1802.01114","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.01114","created_at":"2026-05-18T00:05:56.392126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01114v2","created_at":"2026-05-18T00:05:56.392126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01114","created_at":"2026-05-18T00:05:56.392126+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6EQGC6C2O4J","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6EQGC6C2O4JGDZF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6EQGC6C","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S","json":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S.json","graph_json":"https://pith.science/api/pith-number/O6EQGC6C2O4JGDZFDT3FESCT3S/graph.json","events_json":"https://pith.science/api/pith-number/O6EQGC6C2O4JGDZFDT3FESCT3S/events.json","paper":"https://pith.science/paper/O6EQGC6C"},"agent_actions":{"view_html":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S","download_json":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S.json","view_paper":"https://pith.science/paper/O6EQGC6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01114&json=true","fetch_graph":"https://pith.science/api/pith-number/O6EQGC6C2O4JGDZFDT3FESCT3S/graph.json","fetch_events":"https://pith.science/api/pith-number/O6EQGC6C2O4JGDZFDT3FESCT3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/action/storage_attestation","attest_author":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/action/author_attestation","sign_citation":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/action/citation_signature","submit_replication":"https://pith.science/pith/O6EQGC6C2O4JGDZFDT3FESCT3S/action/replication_record"}},"created_at":"2026-05-18T00:05:56.392126+00:00","updated_at":"2026-05-18T00:05:56.392126+00:00"}