{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JQ4BEVYK246BJX4HD7MA3MV7GS","short_pith_number":"pith:JQ4BEVYK","canonical_record":{"source":{"id":"1204.0647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-03T10:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"0640570c41536a047ba00e65690478f7e820d6e677b63fb7769700a277e8df03","abstract_canon_sha256":"98cbe811b9ecdf7c9cf8a270daa01460ee03cc17c3c703f8d550bbf2560cfb26"},"schema_version":"1.0"},"canonical_sha256":"4c3812570ad73c14df871fd80db2bf34bea05ac337a7f88b1d903f0b9d99ba77","source":{"kind":"arxiv","id":"1204.0647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0647","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0647v1","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0647","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"JQ4BEVYK246B","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JQ4BEVYK246BJX4H","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JQ4BEVYK","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JQ4BEVYK246BJX4HD7MA3MV7GS","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-03T10:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"0640570c41536a047ba00e65690478f7e820d6e677b63fb7769700a277e8df03","abstract_canon_sha256":"98cbe811b9ecdf7c9cf8a270daa01460ee03cc17c3c703f8d550bbf2560cfb26"},"schema_version":"1.0"},"canonical_sha256":"4c3812570ad73c14df871fd80db2bf34bea05ac337a7f88b1d903f0b9d99ba77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:38.909580Z","signature_b64":"H9jrlYT6r4cxFlAMDARDCq7tqTTvucaT+Aetg5JknNhsnm0rMno7YgAzx60vlQ/R2Bs0sXJXokPY9S8VOO8EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3812570ad73c14df871fd80db2bf34bea05ac337a7f88b1d903f0b9d99ba77","last_reissued_at":"2026-05-18T03:58:38.908828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:38.908828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0647","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-18T03:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wW6ou15rxRNjjLZ3AQt7cpVxeVmoWvP7Xzxk7rrhtaG1AHNY7QJPrqKhgsHIbqdLz45z5Xz8RYKxZJCO/Z2ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:24:09.492275Z"},"content_sha256":"d601da484ed3660920e9d6cb0f4466061ff3d7b76e5ac3031159134737ffdd0a","schema_version":"1.0","event_id":"sha256:d601da484ed3660920e9d6cb0f4466061ff3d7b76e5ac3031159134737ffdd0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JQ4BEVYK246BJX4HD7MA3MV7GS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring, location and domination of corona graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Rond\\'on Aguilar, D. Kuziak, I. Gonz\\'alez Yero","submitted_at":"2012-04-03T10:26:45Z","abstract_excerpt":"A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a graph, in which the process of labeling is done according to an extra condition. A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those structures of a graph satisfying some domination property together "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0647","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-18T03:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYH39yxJxD94y7kFgMG2OGLGm/JUeg4HYnwC3ImNZniucyjBrOxD2lnLImoDqsPRcFFfDSATrtrdYSF7DHu0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:24:09.492648Z"},"content_sha256":"caf2e4e731c11dc38b872cd530d59ffcf59f3461b83eabfa68f5f0c0fd11da7e","schema_version":"1.0","event_id":"sha256:caf2e4e731c11dc38b872cd530d59ffcf59f3461b83eabfa68f5f0c0fd11da7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/bundle.json","state_url":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/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-04T15:24:09Z","links":{"resolver":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS","bundle":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/bundle.json","state":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JQ4BEVYK246BJX4HD7MA3MV7GS","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":"98cbe811b9ecdf7c9cf8a270daa01460ee03cc17c3c703f8d550bbf2560cfb26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-03T10:26:45Z","title_canon_sha256":"0640570c41536a047ba00e65690478f7e820d6e677b63fb7769700a277e8df03"},"schema_version":"1.0","source":{"id":"1204.0647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0647","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0647v1","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0647","created_at":"2026-05-18T03:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"JQ4BEVYK246B","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JQ4BEVYK246BJX4H","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JQ4BEVYK","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:caf2e4e731c11dc38b872cd530d59ffcf59f3461b83eabfa68f5f0c0fd11da7e","target":"graph","created_at":"2026-05-18T03:58:38Z","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 vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a graph, in which the process of labeling is done according to an extra condition. A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those structures of a graph satisfying some domination property together ","authors_text":"A. Rond\\'on Aguilar, D. Kuziak, I. Gonz\\'alez Yero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-03T10:26:45Z","title":"Coloring, location and domination of corona graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0647","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:d601da484ed3660920e9d6cb0f4466061ff3d7b76e5ac3031159134737ffdd0a","target":"record","created_at":"2026-05-18T03:58:38Z","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":"98cbe811b9ecdf7c9cf8a270daa01460ee03cc17c3c703f8d550bbf2560cfb26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-03T10:26:45Z","title_canon_sha256":"0640570c41536a047ba00e65690478f7e820d6e677b63fb7769700a277e8df03"},"schema_version":"1.0","source":{"id":"1204.0647","kind":"arxiv","version":1}},"canonical_sha256":"4c3812570ad73c14df871fd80db2bf34bea05ac337a7f88b1d903f0b9d99ba77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c3812570ad73c14df871fd80db2bf34bea05ac337a7f88b1d903f0b9d99ba77","first_computed_at":"2026-05-18T03:58:38.908828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:38.908828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H9jrlYT6r4cxFlAMDARDCq7tqTTvucaT+Aetg5JknNhsnm0rMno7YgAzx60vlQ/R2Bs0sXJXokPY9S8VOO8EDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:38.909580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d601da484ed3660920e9d6cb0f4466061ff3d7b76e5ac3031159134737ffdd0a","sha256:caf2e4e731c11dc38b872cd530d59ffcf59f3461b83eabfa68f5f0c0fd11da7e"],"state_sha256":"c9b4fb050b0a761d61c968c95d178f4722bea2d6de459b71e4cf970eb90ea5f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkqy3JY4b+i0CTJ5vKVbYoX17OTTvhr7FvvwBKXA2mKlw1hybfAZgggwn2jwBTjPvUmktVxoMTfNoEzTOHAnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:24:09.494690Z","bundle_sha256":"0a2157bd1bc041799254ed24a4a75ad25c33cec1ea27e63f620e5265faec0db4"}}