{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RKVXFOBENAYHEPJIK2IEPHPSTN","short_pith_number":"pith:RKVXFOBE","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"},"canonical_sha256":"8aab72b8246830723d285690479df29b5a6e1f5c609cbf1a8a67b4b93b62d61d","source":{"kind":"arxiv","id":"2209.01795","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.01795","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"2209.01795v3","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01795","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"RKVXFOBENAYH","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"pith_short_16","alias_value":"RKVXFOBENAYHEPJI","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"pith_short_8","alias_value":"RKVXFOBE","created_at":"2026-07-05T05:12:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RKVXFOBENAYHEPJIK2IEPHPSTN","target":"record","payload":{"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"},"canonical_sha256":"8aab72b8246830723d285690479df29b5a6e1f5c609cbf1a8a67b4b93b62d61d","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"},"source_kind":"arxiv","source_id":"2209.01795","source_version":3,"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-07-05T05:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGIJk0H2g/jvx5L1LFRHm0vFKrGhN26483iF721ae6AVUBkxST6gWSUhdzny5vvRD1ZnFXDQkjfvJ5wUMQ80Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:42:07.179130Z"},"content_sha256":"90cf601c4cc4881a1aaaef1ebfca14162f0cc19e330f6a18bdc53f0cdcf9222c","schema_version":"1.0","event_id":"sha256:90cf601c4cc4881a1aaaef1ebfca14162f0cc19e330f6a18bdc53f0cdcf9222c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RKVXFOBENAYHEPJIK2IEPHPSTN","target":"graph","payload":{"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"},"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-07-05T05:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jN8/ozwAuJH6QRvWpqA/t8dURJjIHc67Qlv9nieE89KRFEnRH8W2AAH3WTLP2/PjOM8G8L0eAUIkRquvE7izBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:42:07.179697Z"},"content_sha256":"d42fd47ff7c3d04b86dc57ab1f7c7e6c8201f6d23e562525fc54210c59cd6fcf","schema_version":"1.0","event_id":"sha256:d42fd47ff7c3d04b86dc57ab1f7c7e6c8201f6d23e562525fc54210c59cd6fcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/bundle.json","state_url":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/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-08-08T19:42:07Z","links":{"resolver":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN","bundle":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/bundle.json","state":"https://pith.science/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKVXFOBENAYHEPJIK2IEPHPSTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RKVXFOBENAYHEPJIK2IEPHPSTN","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":"a40feaada2a681200959756786f0a6ed1a9287525101ff798154486cc7b31d3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-05T07:09:47Z","title_canon_sha256":"e56934cac08dc1daad3dbe7ecb1eb44b11c079467dbca0a1405ec20bc8a6aca2"},"schema_version":"1.0","source":{"id":"2209.01795","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.01795","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"2209.01795v3","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01795","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"RKVXFOBENAYH","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"pith_short_16","alias_value":"RKVXFOBENAYHEPJI","created_at":"2026-07-05T05:12:03Z"},{"alias_kind":"pith_short_8","alias_value":"RKVXFOBE","created_at":"2026-07-05T05:12:03Z"}],"graph_snapshots":[{"event_id":"sha256:d42fd47ff7c3d04b86dc57ab1f7c7e6c8201f6d23e562525fc54210c59cd6fcf","target":"graph","created_at":"2026-07-05T05:12:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.01795/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gerold J\\\"ager, Nima Ghanbari, Tuomo Lehtil\\\"a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-05T07:09:47Z","title":"Super Domination: Graph Classes, Products and Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01795","kind":"arxiv","version":3},"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:90cf601c4cc4881a1aaaef1ebfca14162f0cc19e330f6a18bdc53f0cdcf9222c","target":"record","created_at":"2026-07-05T05:12:03Z","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":"a40feaada2a681200959756786f0a6ed1a9287525101ff798154486cc7b31d3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-05T07:09:47Z","title_canon_sha256":"e56934cac08dc1daad3dbe7ecb1eb44b11c079467dbca0a1405ec20bc8a6aca2"},"schema_version":"1.0","source":{"id":"2209.01795","kind":"arxiv","version":3}},"canonical_sha256":"8aab72b8246830723d285690479df29b5a6e1f5c609cbf1a8a67b4b93b62d61d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aab72b8246830723d285690479df29b5a6e1f5c609cbf1a8a67b4b93b62d61d","first_computed_at":"2026-07-05T05:12:03.342842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:12:03.342842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eGY+6d5CXqksM3cUQTtjh7WukYajZNuUOrhxj1tI0cYhzFF1D5O1WqQVx6xh/BsjuCFcLD4tV6QmI4YW0aACBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:12:03.343291Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.01795","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90cf601c4cc4881a1aaaef1ebfca14162f0cc19e330f6a18bdc53f0cdcf9222c","sha256:d42fd47ff7c3d04b86dc57ab1f7c7e6c8201f6d23e562525fc54210c59cd6fcf"],"state_sha256":"e44f58624df19b467339638ea7188150c446203d15893c9955a7c73ee0c270db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ol56/Ohee5aQ8nfOSJw7zZqRHFIclgZSNBjivahXrw5LtBoauoQFwddcPs6oBdlH5LUguyClrWTJSSnAgvWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:42:07.184546Z","bundle_sha256":"19b70f5acfbb039f20380ae048f9fb586e2861917d7cd995996a665b9cb745a4"}}