{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3ZSZ4P4DRM22TXYXWAIDLOUQKS","short_pith_number":"pith:3ZSZ4P4D","canonical_record":{"source":{"id":"1907.12670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-29T22:07:35Z","cross_cats_sorted":[],"title_canon_sha256":"e11e867368f82e8a4ad91586b5b7ad3c74fc861778daa44680b9781b52c4c6ef","abstract_canon_sha256":"58b73f8efd4f77eeb13a907461670c5b46f710aa3f201548aaba4fa05ed390d4"},"schema_version":"1.0"},"canonical_sha256":"de659e3f838b35a9df17b01035ba9054bbc69626e8dbd75d33fafde164ccf482","source":{"kind":"arxiv","id":"1907.12670","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.12670","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1907.12670v2","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12670","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"3ZSZ4P4DRM22","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"3ZSZ4P4DRM22TXYX","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"3ZSZ4P4D","created_at":"2026-07-05T01:04:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3ZSZ4P4DRM22TXYXWAIDLOUQKS","target":"record","payload":{"canonical_record":{"source":{"id":"1907.12670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-29T22:07:35Z","cross_cats_sorted":[],"title_canon_sha256":"e11e867368f82e8a4ad91586b5b7ad3c74fc861778daa44680b9781b52c4c6ef","abstract_canon_sha256":"58b73f8efd4f77eeb13a907461670c5b46f710aa3f201548aaba4fa05ed390d4"},"schema_version":"1.0"},"canonical_sha256":"de659e3f838b35a9df17b01035ba9054bbc69626e8dbd75d33fafde164ccf482","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:04:46.197698Z","signature_b64":"+YVWHFM9VRxQd7Gz6dZFUYvNJ6PlY03rkQcQaqM/nqKMPkUJ3u81GpMOUViQQjDEQ5uXSbZnUpX14YDW03A/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de659e3f838b35a9df17b01035ba9054bbc69626e8dbd75d33fafde164ccf482","last_reissued_at":"2026-07-05T01:04:46.197227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:04:46.197227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.12670","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-07-05T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivPvObyqJ3kWDLtMTNE1e2eOrficXqF5wZ56PqMNpG0D7o7YZ2QdWN/kwnFhoyfHxcve+wIvfLl6cctV2xzyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:56:25.254048Z"},"content_sha256":"c703278180b9fd27d81d544632bf1e749855f6082395cbca688248c83fc1401b","schema_version":"1.0","event_id":"sha256:c703278180b9fd27d81d544632bf1e749855f6082395cbca688248c83fc1401b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3ZSZ4P4DRM22TXYXWAIDLOUQKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum coprime graph labelings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Lee","submitted_at":"2019-07-29T22:07:35Z","abstract_excerpt":"A coprime labeling of a graph $G$ is a labeling of the vertices of $G$ with distinct integers from $1$ to $k$ such that adjacent vertices have coprime labels. The minimum coprime number of $G$ is the least $k$ for which such a labeling exists. In this paper, we determine the minimum coprime number for several well-studied classes of graphs, including the coronas of complete graphs with empty graphs and the joins of two paths. In particular, we resolve a conjecture of Seoud, El Sonbaty, and Mahran and two conjectures of Asplund and Fox. We also provide an asymptotic for the minimum coprime numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12670","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.12670/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLwcg3ncdUyEIvMaYDLLVksITcm7tqEZhdeKM8HK20WIibG/Hp+vARXfTjCNkaRVXRfo7eA1cK2zaQbPVakkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:56:25.254532Z"},"content_sha256":"c2fa06061e4ee6d9877fec9867aade4bcc3f3172d518c4f27e247deeffbf6aa1","schema_version":"1.0","event_id":"sha256:c2fa06061e4ee6d9877fec9867aade4bcc3f3172d518c4f27e247deeffbf6aa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS/bundle.json","state_url":"https://pith.science/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS/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-08-17T05:56:25Z","links":{"resolver":"https://pith.science/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS","bundle":"https://pith.science/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS/bundle.json","state":"https://pith.science/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZSZ4P4DRM22TXYXWAIDLOUQKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3ZSZ4P4DRM22TXYXWAIDLOUQKS","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":"58b73f8efd4f77eeb13a907461670c5b46f710aa3f201548aaba4fa05ed390d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-29T22:07:35Z","title_canon_sha256":"e11e867368f82e8a4ad91586b5b7ad3c74fc861778daa44680b9781b52c4c6ef"},"schema_version":"1.0","source":{"id":"1907.12670","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.12670","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1907.12670v2","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12670","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"3ZSZ4P4DRM22","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"3ZSZ4P4DRM22TXYX","created_at":"2026-07-05T01:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"3ZSZ4P4D","created_at":"2026-07-05T01:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:c2fa06061e4ee6d9877fec9867aade4bcc3f3172d518c4f27e247deeffbf6aa1","target":"graph","created_at":"2026-07-05T01:04:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.12670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A coprime labeling of a graph $G$ is a labeling of the vertices of $G$ with distinct integers from $1$ to $k$ such that adjacent vertices have coprime labels. The minimum coprime number of $G$ is the least $k$ for which such a labeling exists. In this paper, we determine the minimum coprime number for several well-studied classes of graphs, including the coronas of complete graphs with empty graphs and the joins of two paths. In particular, we resolve a conjecture of Seoud, El Sonbaty, and Mahran and two conjectures of Asplund and Fox. We also provide an asymptotic for the minimum coprime numb","authors_text":"Catherine Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-29T22:07:35Z","title":"Minimum coprime graph labelings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12670","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:c703278180b9fd27d81d544632bf1e749855f6082395cbca688248c83fc1401b","target":"record","created_at":"2026-07-05T01:04:46Z","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":"58b73f8efd4f77eeb13a907461670c5b46f710aa3f201548aaba4fa05ed390d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-29T22:07:35Z","title_canon_sha256":"e11e867368f82e8a4ad91586b5b7ad3c74fc861778daa44680b9781b52c4c6ef"},"schema_version":"1.0","source":{"id":"1907.12670","kind":"arxiv","version":2}},"canonical_sha256":"de659e3f838b35a9df17b01035ba9054bbc69626e8dbd75d33fafde164ccf482","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de659e3f838b35a9df17b01035ba9054bbc69626e8dbd75d33fafde164ccf482","first_computed_at":"2026-07-05T01:04:46.197227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:04:46.197227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+YVWHFM9VRxQd7Gz6dZFUYvNJ6PlY03rkQcQaqM/nqKMPkUJ3u81GpMOUViQQjDEQ5uXSbZnUpX14YDW03A/AA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:04:46.197698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.12670","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c703278180b9fd27d81d544632bf1e749855f6082395cbca688248c83fc1401b","sha256:c2fa06061e4ee6d9877fec9867aade4bcc3f3172d518c4f27e247deeffbf6aa1"],"state_sha256":"2bfe0d89404590dcdbbd1bee27d5cbe73ad827f0accfa8e2c83ea10b43a9921b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlYmcuK89N82TkG3jPwbOmu1l0OSPJ++Cuq3uw17eJgXVRDxHNoru4h8qktvT6ammCg90YKfUY/s8/Hyg9nqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:56:25.259844Z","bundle_sha256":"78584335d9ea2258ce75359735ca531bcba6692772eeedaa449b8ba74068d0c1"}}