{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RKVXFOBENAYHEPJIK2IEPHPSTN","short_pith_number":"pith:RKVXFOBE","schema_version":"1.0","canonical_sha256":"8aab72b8246830723d285690479df29b5a6e1f5c609cbf1a8a67b4b93b62d61d","source":{"kind":"arxiv","id":"2209.01795","version":3},"attestation_state":"computed","paper":{"title":"Super Domination: Graph Classes, Products and Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gerold J\\\"ager, Nima Ghanbari, Tuomo Lehtil\\\"a","submitted_at":"2022-09-05T07:09:47Z","abstract_excerpt":"The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G=(V,E)$, a dominating set of $G$ is a subset $S\\subseteq V$ such that every vertex in $ V \\setminus S$ is adjacent to at least one vertex in $S$. Furthermore, the DSP is the problem of finding a minimum-size dominating set and the corresponding minimum size, the domination number of $G$.\n  In this, work we investigate a variant of the DSP, the super dominating set problem (SDSP), which has attracted much attention during the last years. A domin"},"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":"2209.01795","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-05T07:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"e56934cac08dc1daad3dbe7ecb1eb44b11c079467dbca0a1405ec20bc8a6aca2","abstract_canon_sha256":"a40feaada2a681200959756786f0a6ed1a9287525101ff798154486cc7b31d3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:03.343291Z","signature_b64":"eGY+6d5CXqksM3cUQTtjh7WukYajZNuUOrhxj1tI0cYhzFF1D5O1WqQVx6xh/BsjuCFcLD4tV6QmI4YW0aACBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aab72b8246830723d285690479df29b5a6e1f5c609cbf1a8a67b4b93b62d61d","last_reissued_at":"2026-07-05T05:12:03.342842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:03.342842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super Domination: Graph Classes, Products and Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gerold J\\\"ager, Nima Ghanbari, Tuomo Lehtil\\\"a","submitted_at":"2022-09-05T07:09:47Z","abstract_excerpt":"The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G=(V,E)$, a dominating set of $G$ is a subset $S\\subseteq V$ such that every vertex in $ V \\setminus S$ is adjacent to at least one vertex in $S$. Furthermore, the DSP is the problem of finding a minimum-size dominating set and the corresponding minimum size, the domination number of $G$.\n  In this, work we investigate a variant of the DSP, the super dominating set problem (SDSP), which has attracted much attention during the last years. A domin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01795","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.01795/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.01795","created_at":"2026-07-05T05:12:03.342901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.01795v3","created_at":"2026-07-05T05:12:03.342901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01795","created_at":"2026-07-05T05:12:03.342901+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKVXFOBENAYH","created_at":"2026-07-05T05:12:03.342901+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKVXFOBENAYHEPJI","created_at":"2026-07-05T05:12:03.342901+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKVXFOBE","created_at":"2026-07-05T05:12:03.342901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07483","citing_title":"Network Recovery from Cascade Data: A Debiased Jacobian-Based Machine Learning Approach","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN","json":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN.json","graph_json":"https://pith.science/api/pith-number/RKVXFOBENAYHEPJIK2IEPHPSTN/graph.json","events_json":"https://pith.science/api/pith-number/RKVXFOBENAYHEPJIK2IEPHPSTN/events.json","paper":"https://pith.science/paper/RKVXFOBE"},"agent_actions":{"view_html":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN","download_json":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN.json","view_paper":"https://pith.science/paper/RKVXFOBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.01795&json=true","fetch_graph":"https://pith.science/api/pith-number/RKVXFOBENAYHEPJIK2IEPHPSTN/graph.json","fetch_events":"https://pith.science/api/pith-number/RKVXFOBENAYHEPJIK2IEPHPSTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/action/storage_attestation","attest_author":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/action/author_attestation","sign_citation":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/action/citation_signature","submit_replication":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/action/replication_record"}},"created_at":"2026-07-05T05:12:03.342901+00:00","updated_at":"2026-07-05T05:12:03.342901+00:00"}