{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OS5CHSZWZ27NRHDEG4MHEBSBCK","short_pith_number":"pith:OS5CHSZW","canonical_record":{"source":{"id":"1908.06051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T16:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"81431b69a1a421764186134035da7333ec540e3b13f42504f73f14254fa483f7","abstract_canon_sha256":"4c55da1baca0b98d6cb9b906eb3467e47b32e2d218d3a6e7a1f8329094e8af81"},"schema_version":"1.0"},"canonical_sha256":"74ba23cb36cebed89c643718720641128e3eef0eea75d956d690b94dd8682cd0","source":{"kind":"arxiv","id":"1908.06051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06051","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06051v1","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06051","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"OS5CHSZWZ27N","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"pith_short_16","alias_value":"OS5CHSZWZ27NRHDE","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"pith_short_8","alias_value":"OS5CHSZW","created_at":"2026-07-04T23:58:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OS5CHSZWZ27NRHDEG4MHEBSBCK","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T16:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"81431b69a1a421764186134035da7333ec540e3b13f42504f73f14254fa483f7","abstract_canon_sha256":"4c55da1baca0b98d6cb9b906eb3467e47b32e2d218d3a6e7a1f8329094e8af81"},"schema_version":"1.0"},"canonical_sha256":"74ba23cb36cebed89c643718720641128e3eef0eea75d956d690b94dd8682cd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:00.930778Z","signature_b64":"5Kj9HkIUbPoksdqxFeBHe4pmYsfaYac/AwhVpiBRuEC7vvDllEGWwoWbzEEiE/hqIqbHo7Ik2DpxS7qwLBN/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ba23cb36cebed89c643718720641128e3eef0eea75d956d690b94dd8682cd0","last_reissued_at":"2026-07-04T23:58:00.930439Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:00.930439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06051","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-07-04T23:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytjZQ4cbuNq7+D2INkgDkhGnXCinjQgom/5u7bxkzaha7kkEsXGeYwmeEbc3sz0vOD9xvbZhILiIguuXbOAtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:33:28.731442Z"},"content_sha256":"b05eb425882f5bfe4279b2168588547a9eb0cbfb2255511c833f6f2182fab16c","schema_version":"1.0","event_id":"sha256:b05eb425882f5bfe4279b2168588547a9eb0cbfb2255511c833f6f2182fab16c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OS5CHSZWZ27NRHDEG4MHEBSBCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Coprime Labelings of Generalized Petersen and Prism 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":"2019-08-16T16:38:54Z","abstract_excerpt":"A coprime labeling of a graph of order $n$ is an assignment of distinct positive integer labels in which adjacent vertices have relatively prime labels. Restricting labels to only the set $1$ to $n$ results in a prime labeling. In this paper, we consider families of graphs in which a prime labeling cannot exist with the goal being to minimize the largest value of the labeling set, resulting in a minimum coprime labeling. In particular, prism graphs, generalized Petersen graphs with $k=2$, and stacked prism graphs are investigated for minimum coprime labelings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06051","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06051/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-04T23:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMVE+o8J7NK0oXhBoL6ZWpNVNUHgJ4tWo8cBAyXhELaYIW9w6oqz7Gz9852gtyPJxX8zXy7Vfd8CTtVrRP81AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:33:28.732060Z"},"content_sha256":"aca5e6d5eb7624e25cff15e3cca0ed1f8f12c926b1caab1dfc0b14ee9ee62044","schema_version":"1.0","event_id":"sha256:aca5e6d5eb7624e25cff15e3cca0ed1f8f12c926b1caab1dfc0b14ee9ee62044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK/bundle.json","state_url":"https://pith.science/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK/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-16T11:33:28Z","links":{"resolver":"https://pith.science/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK","bundle":"https://pith.science/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK/bundle.json","state":"https://pith.science/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OS5CHSZWZ27NRHDEG4MHEBSBCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OS5CHSZWZ27NRHDEG4MHEBSBCK","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":"4c55da1baca0b98d6cb9b906eb3467e47b32e2d218d3a6e7a1f8329094e8af81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T16:38:54Z","title_canon_sha256":"81431b69a1a421764186134035da7333ec540e3b13f42504f73f14254fa483f7"},"schema_version":"1.0","source":{"id":"1908.06051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06051","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06051v1","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06051","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"OS5CHSZWZ27N","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"pith_short_16","alias_value":"OS5CHSZWZ27NRHDE","created_at":"2026-07-04T23:58:00Z"},{"alias_kind":"pith_short_8","alias_value":"OS5CHSZW","created_at":"2026-07-04T23:58:00Z"}],"graph_snapshots":[{"event_id":"sha256:aca5e6d5eb7624e25cff15e3cca0ed1f8f12c926b1caab1dfc0b14ee9ee62044","target":"graph","created_at":"2026-07-04T23:58:00Z","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/1908.06051/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A coprime labeling of a graph of order $n$ is an assignment of distinct positive integer labels in which adjacent vertices have relatively prime labels. Restricting labels to only the set $1$ to $n$ results in a prime labeling. In this paper, we consider families of graphs in which a prime labeling cannot exist with the goal being to minimize the largest value of the labeling set, resulting in a minimum coprime labeling. In particular, prism graphs, generalized Petersen graphs with $k=2$, and stacked prism graphs are investigated for minimum coprime labelings.","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":"2019-08-16T16:38:54Z","title":"Minimum Coprime Labelings of Generalized Petersen and Prism Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06051","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:b05eb425882f5bfe4279b2168588547a9eb0cbfb2255511c833f6f2182fab16c","target":"record","created_at":"2026-07-04T23:58:00Z","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":"4c55da1baca0b98d6cb9b906eb3467e47b32e2d218d3a6e7a1f8329094e8af81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T16:38:54Z","title_canon_sha256":"81431b69a1a421764186134035da7333ec540e3b13f42504f73f14254fa483f7"},"schema_version":"1.0","source":{"id":"1908.06051","kind":"arxiv","version":1}},"canonical_sha256":"74ba23cb36cebed89c643718720641128e3eef0eea75d956d690b94dd8682cd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74ba23cb36cebed89c643718720641128e3eef0eea75d956d690b94dd8682cd0","first_computed_at":"2026-07-04T23:58:00.930439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:00.930439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Kj9HkIUbPoksdqxFeBHe4pmYsfaYac/AwhVpiBRuEC7vvDllEGWwoWbzEEiE/hqIqbHo7Ik2DpxS7qwLBN/DA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:00.930778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b05eb425882f5bfe4279b2168588547a9eb0cbfb2255511c833f6f2182fab16c","sha256:aca5e6d5eb7624e25cff15e3cca0ed1f8f12c926b1caab1dfc0b14ee9ee62044"],"state_sha256":"15a8ebfad11e0da84a24d55cc8087fd6f6cb7edd39fd734a4ca319ef457f2f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3T8G6Wlt8alG1XQE20gZkerbQv2t2sWgjqKp1Px7qsYdkuq8hLa7G2Tcl1CQj+lDDEbC2c0Ga9HarBsQ6PSkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:33:28.736682Z","bundle_sha256":"836279ad08a2632dd6417bccf0227fd301647ba09efd817c27b5f8b891a66cf5"}}