{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y4TRUADRSMYA5PVMLAFUPSJYK6","short_pith_number":"pith:Y4TRUADR","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"},"canonical_sha256":"c7271a007193300ebeac580b47c93857a1c94cc52109b42058396e2e574eeafb","source":{"kind":"arxiv","id":"1812.00977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00977","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00977v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00977","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"Y4TRUADRSMYA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y4TRUADRSMYA5PVM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y4TRUADR","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y4TRUADRSMYA5PVMLAFUPSJYK6","target":"record","payload":{"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"},"canonical_sha256":"c7271a007193300ebeac580b47c93857a1c94cc52109b42058396e2e574eeafb","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"},"source_kind":"arxiv","source_id":"1812.00977","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPR5LmTdbXEGh1LRY9bcB9/ylS1P9eogGhdrXEjfCsW6CT1sjPDBnM07EPaNR78Yk+7FQZwe+jCk/yXQSbtCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:23:33.295959Z"},"content_sha256":"bd61e0c2242990fc3dbc6b43259e8dd4ab10f06a936b4f4b10dde58493068f01","schema_version":"1.0","event_id":"sha256:bd61e0c2242990fc3dbc6b43259e8dd4ab10f06a936b4f4b10dde58493068f01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y4TRUADRSMYA5PVMLAFUPSJYK6","target":"graph","payload":{"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"},"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MrPkaE9gqS1fX+KRZditoJr5tUKHEojDRwUkYeogTu0Cl+IiozFEzSUcS3qWOIkgMf6ToTth6zij6t0ecbyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:23:33.296304Z"},"content_sha256":"1af92c4bd6881246475e0af73d7c2594b078ce59bac39d20a4fdf4248a8c0818","schema_version":"1.0","event_id":"sha256:1af92c4bd6881246475e0af73d7c2594b078ce59bac39d20a4fdf4248a8c0818"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/bundle.json","state_url":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/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-27T21:23:33Z","links":{"resolver":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6","bundle":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/bundle.json","state":"https://pith.science/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4TRUADRSMYA5PVMLAFUPSJYK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y4TRUADRSMYA5PVMLAFUPSJYK6","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":"878b1294cad49e6f943f14ebe3f877f21623e5c495600f1452fc0f5f5baf618b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T18:51:58Z","title_canon_sha256":"8b932d6d85bcae280e889d1ee928000a1355165cf47b71e24505367c448754ee"},"schema_version":"1.0","source":{"id":"1812.00977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00977","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00977v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00977","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"Y4TRUADRSMYA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y4TRUADRSMYA5PVM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y4TRUADR","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:1af92c4bd6881246475e0af73d7c2594b078ce59bac39d20a4fdf4248a8c0818","target":"graph","created_at":"2026-05-17T23:59:18Z","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":"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.","authors_text":"B. Davvaz, M. Alambardar Meybodi, M. Rajaati, M. R. Hooshmandasl","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T18:51:58Z","title":"On Mixed Domination in Generalized Petersen Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00977","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:bd61e0c2242990fc3dbc6b43259e8dd4ab10f06a936b4f4b10dde58493068f01","target":"record","created_at":"2026-05-17T23:59:18Z","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":"878b1294cad49e6f943f14ebe3f877f21623e5c495600f1452fc0f5f5baf618b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T18:51:58Z","title_canon_sha256":"8b932d6d85bcae280e889d1ee928000a1355165cf47b71e24505367c448754ee"},"schema_version":"1.0","source":{"id":"1812.00977","kind":"arxiv","version":1}},"canonical_sha256":"c7271a007193300ebeac580b47c93857a1c94cc52109b42058396e2e574eeafb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7271a007193300ebeac580b47c93857a1c94cc52109b42058396e2e574eeafb","first_computed_at":"2026-05-17T23:59:18.480527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.480527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pbO7nOuZqBuUTrLMg7JWVPvGVlUDg0cYqkhvI10zFy50YBfp7+EHp9KmSzUWsbU+m4DzYy2HcKarXS3wMY5KDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.480959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd61e0c2242990fc3dbc6b43259e8dd4ab10f06a936b4f4b10dde58493068f01","sha256:1af92c4bd6881246475e0af73d7c2594b078ce59bac39d20a4fdf4248a8c0818"],"state_sha256":"0fa8f58eeeaad04e28bf21cbf272d084f27ca4e6a444860ff6a7f013e70616ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3YMdek7moLCzrRrDl3o5x+MUwiI4mlre5dV6h4VIAV4g9yeP1VAgcr09H7ZK6mnEXg7xeP6oI+szAzA2e74AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:23:33.298197Z","bundle_sha256":"be518707129766f3c67d3e4dc197ec685621ea1a3c0768c7cb453c6653216fc2"}}