{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WISXLYAEXCXQUEJK4YYGQPUFLL","short_pith_number":"pith:WISXLYAE","schema_version":"1.0","canonical_sha256":"b22575e004b8af0a112ae630683e855adcb012ee76dfb64a26461be4dfdcbbb8","source":{"kind":"arxiv","id":"1205.0102","version":1},"attestation_state":"computed","paper":{"title":"The p-Domination Number of Complete Multipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, You Lu","submitted_at":"2012-05-01T07:24:38Z","abstract_excerpt":"Let $G=(V,E)$ be a graph and $p$ a positive integer. A subset $S\\subseteq V$ is called a $p$-dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination number is the minimum cardinality of a $p$-dominating set in $G$. In this paper, we establish an exact formula of the $p$-domination number of all complete multipartite graphs for arbitrary positive integer $p$."},"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":"1205.0102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-01T07:24:38Z","cross_cats_sorted":[],"title_canon_sha256":"2d6297988dd36455a6a610aab0fec07bcd9230c5c3dc894dbcc9c0720c6c6837","abstract_canon_sha256":"6c8c5cf771414f3376251989c5eea5c4b3ad0dbb1fed63b879c723243a36ba84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:35.878392Z","signature_b64":"EjtIF1/zoP4tVJanaMEwX0HJ7eiXdmQKqtEMnFfHOUgEAxYcGqIFoJLBpXytLhngLDFJBSH2fPrBVeSFCUvdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22575e004b8af0a112ae630683e855adcb012ee76dfb64a26461be4dfdcbbb8","last_reissued_at":"2026-05-18T03:56:35.877923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:35.877923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The p-Domination Number of Complete Multipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, You Lu","submitted_at":"2012-05-01T07:24:38Z","abstract_excerpt":"Let $G=(V,E)$ be a graph and $p$ a positive integer. A subset $S\\subseteq V$ is called a $p$-dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination number is the minimum cardinality of a $p$-dominating set in $G$. In this paper, we establish an exact formula of the $p$-domination number of all complete multipartite graphs for arbitrary positive integer $p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0102","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":"1205.0102","created_at":"2026-05-18T03:56:35.877980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0102v1","created_at":"2026-05-18T03:56:35.877980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0102","created_at":"2026-05-18T03:56:35.877980+00:00"},{"alias_kind":"pith_short_12","alias_value":"WISXLYAEXCXQ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WISXLYAEXCXQUEJK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WISXLYAE","created_at":"2026-05-18T12:27:25.539911+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/WISXLYAEXCXQUEJK4YYGQPUFLL","json":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL.json","graph_json":"https://pith.science/api/pith-number/WISXLYAEXCXQUEJK4YYGQPUFLL/graph.json","events_json":"https://pith.science/api/pith-number/WISXLYAEXCXQUEJK4YYGQPUFLL/events.json","paper":"https://pith.science/paper/WISXLYAE"},"agent_actions":{"view_html":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL","download_json":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL.json","view_paper":"https://pith.science/paper/WISXLYAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0102&json=true","fetch_graph":"https://pith.science/api/pith-number/WISXLYAEXCXQUEJK4YYGQPUFLL/graph.json","fetch_events":"https://pith.science/api/pith-number/WISXLYAEXCXQUEJK4YYGQPUFLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL/action/storage_attestation","attest_author":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL/action/author_attestation","sign_citation":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL/action/citation_signature","submit_replication":"https://pith.science/pith/WISXLYAEXCXQUEJK4YYGQPUFLL/action/replication_record"}},"created_at":"2026-05-18T03:56:35.877980+00:00","updated_at":"2026-05-18T03:56:35.877980+00:00"}