{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AOJRL652RRCNFGZITZCZG6ATUU","short_pith_number":"pith:AOJRL652","canonical_record":{"source":{"id":"1705.06326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-17T19:44:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b1375551adbf5173420366f8a3a5bdcb806cd899290e95cd60743420af97bc78","abstract_canon_sha256":"74a6836d10a2316968de1edd6c9acc7b667c0c4be00c9d16d0c079db83603489"},"schema_version":"1.0"},"canonical_sha256":"039315fbba8c44d29b289e45937813a516b618a205fce8ab2779f9dfc853f158","source":{"kind":"arxiv","id":"1705.06326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06326","created_at":"2026-05-18T00:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06326v1","created_at":"2026-05-18T00:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06326","created_at":"2026-05-18T00:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"AOJRL652RRCN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AOJRL652RRCNFGZI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AOJRL652","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AOJRL652RRCNFGZITZCZG6ATUU","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-17T19:44:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b1375551adbf5173420366f8a3a5bdcb806cd899290e95cd60743420af97bc78","abstract_canon_sha256":"74a6836d10a2316968de1edd6c9acc7b667c0c4be00c9d16d0c079db83603489"},"schema_version":"1.0"},"canonical_sha256":"039315fbba8c44d29b289e45937813a516b618a205fce8ab2779f9dfc853f158","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:15.003933Z","signature_b64":"A0G66oWf7S1g2tPkYDHWVM0gbPvpASOdJbEWIwkjbj50zbF2Y/55/wwQj9RNmgZnmuFPBMaYI67+Ibvwgv9eDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"039315fbba8c44d29b289e45937813a516b618a205fce8ab2779f9dfc853f158","last_reissued_at":"2026-05-18T00:44:15.003158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:15.003158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06326","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:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/LIVCSaI/0aWRm0tszeGyT+WB7qKalmO+WtaZuxbDkVo9TEANY/bDW+DIscmdv4nPvwa3TRv7KrUvinEEQeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:40:24.627262Z"},"content_sha256":"d5a160ed9ccbc2d3948e977e7cc51e1b45b352b3cc6b94244b3ed7284275d752","schema_version":"1.0","event_id":"sha256:d5a160ed9ccbc2d3948e977e7cc51e1b45b352b3cc6b94244b3ed7284275d752"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AOJRL652RRCNFGZITZCZG6ATUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An exact upper bound on the size of minimal clique covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Michael Soltys, Ryan McIntyre","submitted_at":"2017-05-17T19:44:39Z","abstract_excerpt":"Indeterminate strings have received considerable attention in the recent past; see for example Christodoulakis et al 2015 and Helling et al 2017. This attention is due to their applicability in bioinformatics, and to the natural correspondence with undirected graphs. One aspect of this correspondence is the fact that the minimal alphabet size of indeterminates representing any given undirected graph corresponds to the size of the minimal clique cover of this graph. This paper solves a related problem proposed in Helling et al 2017: compute $\\Theta_n(m)$, which is the size of the largest possib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06326","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:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZQWDx+ZrMNO6AizVUy+JVC4gNE5zHaC8klkoBuYbGZUrH9BD8zfrMvmABMJO/2XW3Tl6enycJ4NEULZR3nvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:40:24.627624Z"},"content_sha256":"210c31db6a1855f2859ed89b1adc231f31ddfc4e46597cbd5a72b986f20ef668","schema_version":"1.0","event_id":"sha256:210c31db6a1855f2859ed89b1adc231f31ddfc4e46597cbd5a72b986f20ef668"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOJRL652RRCNFGZITZCZG6ATUU/bundle.json","state_url":"https://pith.science/pith/AOJRL652RRCNFGZITZCZG6ATUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOJRL652RRCNFGZITZCZG6ATUU/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-29T09:40:24Z","links":{"resolver":"https://pith.science/pith/AOJRL652RRCNFGZITZCZG6ATUU","bundle":"https://pith.science/pith/AOJRL652RRCNFGZITZCZG6ATUU/bundle.json","state":"https://pith.science/pith/AOJRL652RRCNFGZITZCZG6ATUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOJRL652RRCNFGZITZCZG6ATUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AOJRL652RRCNFGZITZCZG6ATUU","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":"74a6836d10a2316968de1edd6c9acc7b667c0c4be00c9d16d0c079db83603489","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-17T19:44:39Z","title_canon_sha256":"b1375551adbf5173420366f8a3a5bdcb806cd899290e95cd60743420af97bc78"},"schema_version":"1.0","source":{"id":"1705.06326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06326","created_at":"2026-05-18T00:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06326v1","created_at":"2026-05-18T00:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06326","created_at":"2026-05-18T00:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"AOJRL652RRCN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AOJRL652RRCNFGZI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AOJRL652","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:210c31db6a1855f2859ed89b1adc231f31ddfc4e46597cbd5a72b986f20ef668","target":"graph","created_at":"2026-05-18T00:44:15Z","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":"Indeterminate strings have received considerable attention in the recent past; see for example Christodoulakis et al 2015 and Helling et al 2017. This attention is due to their applicability in bioinformatics, and to the natural correspondence with undirected graphs. One aspect of this correspondence is the fact that the minimal alphabet size of indeterminates representing any given undirected graph corresponds to the size of the minimal clique cover of this graph. This paper solves a related problem proposed in Helling et al 2017: compute $\\Theta_n(m)$, which is the size of the largest possib","authors_text":"Michael Soltys, Ryan McIntyre","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-17T19:44:39Z","title":"An exact upper bound on the size of minimal clique covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06326","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:d5a160ed9ccbc2d3948e977e7cc51e1b45b352b3cc6b94244b3ed7284275d752","target":"record","created_at":"2026-05-18T00:44:15Z","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":"74a6836d10a2316968de1edd6c9acc7b667c0c4be00c9d16d0c079db83603489","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-17T19:44:39Z","title_canon_sha256":"b1375551adbf5173420366f8a3a5bdcb806cd899290e95cd60743420af97bc78"},"schema_version":"1.0","source":{"id":"1705.06326","kind":"arxiv","version":1}},"canonical_sha256":"039315fbba8c44d29b289e45937813a516b618a205fce8ab2779f9dfc853f158","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"039315fbba8c44d29b289e45937813a516b618a205fce8ab2779f9dfc853f158","first_computed_at":"2026-05-18T00:44:15.003158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:15.003158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A0G66oWf7S1g2tPkYDHWVM0gbPvpASOdJbEWIwkjbj50zbF2Y/55/wwQj9RNmgZnmuFPBMaYI67+Ibvwgv9eDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:15.003933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5a160ed9ccbc2d3948e977e7cc51e1b45b352b3cc6b94244b3ed7284275d752","sha256:210c31db6a1855f2859ed89b1adc231f31ddfc4e46597cbd5a72b986f20ef668"],"state_sha256":"470980aab30b4249248117096557843d5e4e75d581bc3124bcd69ee915819e44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8OPQN9YiXVh4CGGQsjWEM3OIXXdYu1dlj2XN956E6nBm5w/LD40/XaHD9yLCM+B5RqV0E1Pw4ylhbDyLOJDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:40:24.629529Z","bundle_sha256":"90527bc6648ddd4080ba440974e99e3b2c4b019c5525af57c99b78ebd3a13623"}}