{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EGWIUJKQA4JZA6D2TMPSOXXCOD","short_pith_number":"pith:EGWIUJKQ","canonical_record":{"source":{"id":"1707.04471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T11:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"9242559e94558f52876bd1849af3dbb1f77ef6e52720a47f5503b37c55fd355e","abstract_canon_sha256":"70be0cacde516fbcbfdc89ca00bcaaadd3281d828cedfd9f287ad8f0a76dfccf"},"schema_version":"1.0"},"canonical_sha256":"21ac8a2550071390787a9b1f275ee270cd8e7ae371a0a1652f8ff2764a3f7457","source":{"kind":"arxiv","id":"1707.04471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04471","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04471v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04471","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"EGWIUJKQA4JZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EGWIUJKQA4JZA6D2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EGWIUJKQ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EGWIUJKQA4JZA6D2TMPSOXXCOD","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T11:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"9242559e94558f52876bd1849af3dbb1f77ef6e52720a47f5503b37c55fd355e","abstract_canon_sha256":"70be0cacde516fbcbfdc89ca00bcaaadd3281d828cedfd9f287ad8f0a76dfccf"},"schema_version":"1.0"},"canonical_sha256":"21ac8a2550071390787a9b1f275ee270cd8e7ae371a0a1652f8ff2764a3f7457","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.063395Z","signature_b64":"MaiGsJ9H3aGMMf4lpXLVFopv9L9aPYC6oHePvzW6Oh76daEpq8m0vi7i5G8DIHBDvRoKUVhbAZKaGuQXGG7dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21ac8a2550071390787a9b1f275ee270cd8e7ae371a0a1652f8ff2764a3f7457","last_reissued_at":"2026-05-18T00:40:18.062707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.062707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04471","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Didf8Qo2uLimDseIxH+AqKTKuG3XvIgsAVa0uQ9c+jjOODvoePmNr+LpVVkYhVYnUktK+4vTPbkVzWDfmmt3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:59:49.817338Z"},"content_sha256":"5416b574722cc5685f1ecea3ce8fde433a0652937414efa99da5c740204331a8","schema_version":"1.0","event_id":"sha256:5416b574722cc5685f1ecea3ce8fde433a0652937414efa99da5c740204331a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EGWIUJKQA4JZA6D2TMPSOXXCOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Coprime Labelings for Operations on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Asplund, N. Bradley Fox","submitted_at":"2017-07-14T11:44:48Z","abstract_excerpt":"A prime labeling of a graph of order $n$ is a labeling of the vertices with the integers $1$ to~$n$ in which adjacent vertices have relatively prime labels. A coprime labeling maintains the same criterion on adjacent vertices using any set of distinct positive integers. In this paper, we consider several families of graphs or products of graphs that have been shown to not have prime labelings and answer the natural question of how to label the vertices while minimizing the largest value in its set of labels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04471","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/2sIPek32N4ktRgrJEiI+4I/j7OLPpcUru8ycFXGhcvP5TNEn9bAx5YJ3QWfdmm53A19fyZx1NSBe/FQ53YBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:59:49.818059Z"},"content_sha256":"19ddfb6fd6a240386a58bd32c737988eb7b06ff9d4c4bb01342ad2936f50d559","schema_version":"1.0","event_id":"sha256:19ddfb6fd6a240386a58bd32c737988eb7b06ff9d4c4bb01342ad2936f50d559"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD/bundle.json","state_url":"https://pith.science/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD/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-10T10:59:49Z","links":{"resolver":"https://pith.science/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD","bundle":"https://pith.science/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD/bundle.json","state":"https://pith.science/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGWIUJKQA4JZA6D2TMPSOXXCOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EGWIUJKQA4JZA6D2TMPSOXXCOD","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":"70be0cacde516fbcbfdc89ca00bcaaadd3281d828cedfd9f287ad8f0a76dfccf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T11:44:48Z","title_canon_sha256":"9242559e94558f52876bd1849af3dbb1f77ef6e52720a47f5503b37c55fd355e"},"schema_version":"1.0","source":{"id":"1707.04471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04471","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04471v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04471","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"EGWIUJKQA4JZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EGWIUJKQA4JZA6D2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EGWIUJKQ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:19ddfb6fd6a240386a58bd32c737988eb7b06ff9d4c4bb01342ad2936f50d559","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"A prime labeling of a graph of order $n$ is a labeling of the vertices with the integers $1$ to~$n$ in which adjacent vertices have relatively prime labels. A coprime labeling maintains the same criterion on adjacent vertices using any set of distinct positive integers. In this paper, we consider several families of graphs or products of graphs that have been shown to not have prime labelings and answer the natural question of how to label the vertices while minimizing the largest value in its set of labels.","authors_text":"John Asplund, N. Bradley Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T11:44:48Z","title":"Minimum Coprime Labelings for Operations on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04471","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:5416b574722cc5685f1ecea3ce8fde433a0652937414efa99da5c740204331a8","target":"record","created_at":"2026-05-18T00:40:18Z","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":"70be0cacde516fbcbfdc89ca00bcaaadd3281d828cedfd9f287ad8f0a76dfccf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T11:44:48Z","title_canon_sha256":"9242559e94558f52876bd1849af3dbb1f77ef6e52720a47f5503b37c55fd355e"},"schema_version":"1.0","source":{"id":"1707.04471","kind":"arxiv","version":1}},"canonical_sha256":"21ac8a2550071390787a9b1f275ee270cd8e7ae371a0a1652f8ff2764a3f7457","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21ac8a2550071390787a9b1f275ee270cd8e7ae371a0a1652f8ff2764a3f7457","first_computed_at":"2026-05-18T00:40:18.062707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.062707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MaiGsJ9H3aGMMf4lpXLVFopv9L9aPYC6oHePvzW6Oh76daEpq8m0vi7i5G8DIHBDvRoKUVhbAZKaGuQXGG7dDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.063395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5416b574722cc5685f1ecea3ce8fde433a0652937414efa99da5c740204331a8","sha256:19ddfb6fd6a240386a58bd32c737988eb7b06ff9d4c4bb01342ad2936f50d559"],"state_sha256":"081d408f551bdedeef876fc6951fd209f3318045282b58602b3610d275b4cba3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UgUqgwSGHhSToF2E50yvEsXPDJHG9qKf1LT3UD2fqGoK0DLt0IUsluHBHdh3D6urOpBqSPs9eiRKeyCUho8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:59:49.822765Z","bundle_sha256":"92a9cf338cebe4cfe1046d76c63943cf8dbf4e0108b0ca15ad2ee6c30e2a192c"}}