{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y4TRUADRSMYA5PVMLAFUPSJYK6","short_pith_number":"pith:Y4TRUADR","schema_version":"1.0","canonical_sha256":"c7271a007193300ebeac580b47c93857a1c94cc52109b42058396e2e574eeafb","source":{"kind":"arxiv","id":"1812.00977","version":1},"attestation_state":"computed","paper":{"title":"On Mixed Domination in Generalized Petersen Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"B. Davvaz, M. Alambardar Meybodi, M. Rajaati, M. R. Hooshmandasl","submitted_at":"2018-12-03T18:51:58Z","abstract_excerpt":"Given a graph $G = (V, E)$, a set $S \\subseteq V \\cup E$ of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in $S$ happens to be adjacent or incident to a member of $S$. The mixed domination number $\\gamma_{md}(G)$ of the graph is the size of the smallest mixed dominating set of $G$. We present an explicit method for constructing optimal mixed dominating sets in Petersen graphs $P(n, k)$ for $k \\in \\{1, 2\\}$. Our method also provides a new upper bound for other Petersen graphs."},"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":"1812.00977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T18:51:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b932d6d85bcae280e889d1ee928000a1355165cf47b71e24505367c448754ee","abstract_canon_sha256":"878b1294cad49e6f943f14ebe3f877f21623e5c495600f1452fc0f5f5baf618b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.480959Z","signature_b64":"pbO7nOuZqBuUTrLMg7JWVPvGVlUDg0cYqkhvI10zFy50YBfp7+EHp9KmSzUWsbU+m4DzYy2HcKarXS3wMY5KDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7271a007193300ebeac580b47c93857a1c94cc52109b42058396e2e574eeafb","last_reissued_at":"2026-05-17T23:59:18.480527Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.480527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Mixed Domination in Generalized Petersen Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"B. Davvaz, M. Alambardar Meybodi, M. Rajaati, M. R. Hooshmandasl","submitted_at":"2018-12-03T18:51:58Z","abstract_excerpt":"Given a graph $G = (V, E)$, a set $S \\subseteq V \\cup E$ of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in $S$ happens to be adjacent or incident to a member of $S$. The mixed domination number $\\gamma_{md}(G)$ of the graph is the size of the smallest mixed dominating set of $G$. We present an explicit method for constructing optimal mixed dominating sets in Petersen graphs $P(n, k)$ for $k \\in \\{1, 2\\}$. Our method also provides a new upper bound for other Petersen graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00977","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":"1812.00977","created_at":"2026-05-17T23:59:18.480601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00977v1","created_at":"2026-05-17T23:59:18.480601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00977","created_at":"2026-05-17T23:59:18.480601+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4TRUADRSMYA","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4TRUADRSMYA5PVM","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4TRUADR","created_at":"2026-05-18T12:33:04.347982+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/Y4TRUADRSMYA5PVMLAFUPSJYK6","json":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6.json","graph_json":"https://pith.science/api/pith-number/Y4TRUADRSMYA5PVMLAFUPSJYK6/graph.json","events_json":"https://pith.science/api/pith-number/Y4TRUADRSMYA5PVMLAFUPSJYK6/events.json","paper":"https://pith.science/paper/Y4TRUADR"},"agent_actions":{"view_html":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6","download_json":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6.json","view_paper":"https://pith.science/paper/Y4TRUADR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00977&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4TRUADRSMYA5PVMLAFUPSJYK6/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4TRUADRSMYA5PVMLAFUPSJYK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/action/storage_attestation","attest_author":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/action/author_attestation","sign_citation":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/action/citation_signature","submit_replication":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/action/replication_record"}},"created_at":"2026-05-17T23:59:18.480601+00:00","updated_at":"2026-05-17T23:59:18.480601+00:00"}