{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JQ4BEVYK246BJX4HD7MA3MV7GS","short_pith_number":"pith:JQ4BEVYK","schema_version":"1.0","canonical_sha256":"4c3812570ad73c14df871fd80db2bf34bea05ac337a7f88b1d903f0b9d99ba77","source":{"kind":"arxiv","id":"1204.0647","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.0647","created_at":"2026-05-18T03:58:38.908918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0647v1","created_at":"2026-05-18T03:58:38.908918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0647","created_at":"2026-05-18T03:58:38.908918+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQ4BEVYK246B","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQ4BEVYK246BJX4H","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQ4BEVYK","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS","json":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS.json","graph_json":"https://pith.science/api/pith-number/JQ4BEVYK246BJX4HD7MA3MV7GS/graph.json","events_json":"https://pith.science/api/pith-number/JQ4BEVYK246BJX4HD7MA3MV7GS/events.json","paper":"https://pith.science/paper/JQ4BEVYK"},"agent_actions":{"view_html":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS","download_json":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS.json","view_paper":"https://pith.science/paper/JQ4BEVYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0647&json=true","fetch_graph":"https://pith.science/api/pith-number/JQ4BEVYK246BJX4HD7MA3MV7GS/graph.json","fetch_events":"https://pith.science/api/pith-number/JQ4BEVYK246BJX4HD7MA3MV7GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/action/storage_attestation","attest_author":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/action/author_attestation","sign_citation":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/action/citation_signature","submit_replication":"https://pith.science/pith/JQ4BEVYK246BJX4HD7MA3MV7GS/action/replication_record"}},"created_at":"2026-05-18T03:58:38.908918+00:00","updated_at":"2026-05-18T03:58:38.908918+00:00"}