{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MLWHP5QKV4QHKA2OATGFMCAECU","short_pith_number":"pith:MLWHP5QK","canonical_record":{"source":{"id":"1506.07260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-24T07:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"39c31d14e8ccae35d0cf3dced1c895414dbb977f27124854bf15dfec3485782a","abstract_canon_sha256":"c1c3fb8e06393a0f5ff25c8022a83edc111a7ea12c09588f5e302a165b9a3538"},"schema_version":"1.0"},"canonical_sha256":"62ec77f60aaf2075034e04cc5608041526b3e7e335601780094b4336b29b4c28","source":{"kind":"arxiv","id":"1506.07260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07260","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07260v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07260","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"MLWHP5QKV4QH","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLWHP5QKV4QHKA2O","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLWHP5QK","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MLWHP5QKV4QHKA2OATGFMCAECU","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-24T07:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"39c31d14e8ccae35d0cf3dced1c895414dbb977f27124854bf15dfec3485782a","abstract_canon_sha256":"c1c3fb8e06393a0f5ff25c8022a83edc111a7ea12c09588f5e302a165b9a3538"},"schema_version":"1.0"},"canonical_sha256":"62ec77f60aaf2075034e04cc5608041526b3e7e335601780094b4336b29b4c28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:54.440312Z","signature_b64":"FHeVNbME6issrWqc4/V1F/gQpAkVWAiKNnz20uHQA6ox+jH2AefV0lAQwpU5yKaG4192UcnuXTQcP1nDTWaNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ec77f60aaf2075034e04cc5608041526b3e7e335601780094b4336b29b4c28","last_reissued_at":"2026-05-18T01:39:54.439878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:54.439878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07260","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-18T01:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRIDvh4SAEZlRCBiObpZfRjIBFJvcdcEh2WrvOjT7kpswjsmavujE6Fg0Y4hNlxYyAfInT6iXBDAo6ssBeLZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:43:56.624815Z"},"content_sha256":"0021e68d43e9ac8cf0fd0cb98f911ed244df218d48c985b6a7767f9bfcfc6a7e","schema_version":"1.0","event_id":"sha256:0021e68d43e9ac8cf0fd0cb98f911ed244df218d48c985b6a7767f9bfcfc6a7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MLWHP5QKV4QHKA2OATGFMCAECU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Aspects of Upper Domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cristina Bazgan, Henning Fernau, J\\'er\\^ome Monnot, Katrin Casel, Klaus Jansen, Ljiljana Brankovic, Mathieu Liedloff, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2015-06-24T07:19:16Z","abstract_excerpt":"In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and minimisation problems, as well as the related parameterised problems, on general graphs and on graphs of bounded degree, and we also study planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07260","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-18T01:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0TMFuJpeaksD7pg8e4A2zSal6kg/uSpl1z1WqArwPQ+7rOLMKGIFOSg/Ue+yQzPAJ0t27CPKA4WcDcmWNrIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:43:56.625164Z"},"content_sha256":"224fbad738554bfe3c9b1318a0c25ecc0912b65a4826e3c745442330bcf4def6","schema_version":"1.0","event_id":"sha256:224fbad738554bfe3c9b1318a0c25ecc0912b65a4826e3c745442330bcf4def6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLWHP5QKV4QHKA2OATGFMCAECU/bundle.json","state_url":"https://pith.science/pith/MLWHP5QKV4QHKA2OATGFMCAECU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLWHP5QKV4QHKA2OATGFMCAECU/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-05-28T10:43:56Z","links":{"resolver":"https://pith.science/pith/MLWHP5QKV4QHKA2OATGFMCAECU","bundle":"https://pith.science/pith/MLWHP5QKV4QHKA2OATGFMCAECU/bundle.json","state":"https://pith.science/pith/MLWHP5QKV4QHKA2OATGFMCAECU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLWHP5QKV4QHKA2OATGFMCAECU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MLWHP5QKV4QHKA2OATGFMCAECU","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":"c1c3fb8e06393a0f5ff25c8022a83edc111a7ea12c09588f5e302a165b9a3538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-24T07:19:16Z","title_canon_sha256":"39c31d14e8ccae35d0cf3dced1c895414dbb977f27124854bf15dfec3485782a"},"schema_version":"1.0","source":{"id":"1506.07260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07260","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07260v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07260","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"MLWHP5QKV4QH","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLWHP5QKV4QHKA2O","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLWHP5QK","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:224fbad738554bfe3c9b1318a0c25ecc0912b65a4826e3c745442330bcf4def6","target":"graph","created_at":"2026-05-18T01:39:54Z","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":"In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and minimisation problems, as well as the related parameterised problems, on general graphs and on graphs of bounded degree, and we also study planar graphs.","authors_text":"Cristina Bazgan, Henning Fernau, J\\'er\\^ome Monnot, Katrin Casel, Klaus Jansen, Ljiljana Brankovic, Mathieu Liedloff, Michael Lampis, Vangelis Th. Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-24T07:19:16Z","title":"Algorithmic Aspects of Upper Domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07260","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:0021e68d43e9ac8cf0fd0cb98f911ed244df218d48c985b6a7767f9bfcfc6a7e","target":"record","created_at":"2026-05-18T01:39:54Z","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":"c1c3fb8e06393a0f5ff25c8022a83edc111a7ea12c09588f5e302a165b9a3538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-24T07:19:16Z","title_canon_sha256":"39c31d14e8ccae35d0cf3dced1c895414dbb977f27124854bf15dfec3485782a"},"schema_version":"1.0","source":{"id":"1506.07260","kind":"arxiv","version":1}},"canonical_sha256":"62ec77f60aaf2075034e04cc5608041526b3e7e335601780094b4336b29b4c28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62ec77f60aaf2075034e04cc5608041526b3e7e335601780094b4336b29b4c28","first_computed_at":"2026-05-18T01:39:54.439878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:54.439878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FHeVNbME6issrWqc4/V1F/gQpAkVWAiKNnz20uHQA6ox+jH2AefV0lAQwpU5yKaG4192UcnuXTQcP1nDTWaNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:54.440312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0021e68d43e9ac8cf0fd0cb98f911ed244df218d48c985b6a7767f9bfcfc6a7e","sha256:224fbad738554bfe3c9b1318a0c25ecc0912b65a4826e3c745442330bcf4def6"],"state_sha256":"3185b21243b02aca98017308f48ae3efe51708de650e57469df489dace5d74a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wY0JFEeDDaVj5RgE1UODBRWU+2mXVeLElp41ImZoDM5phluU9mDBJhuy2ocWtkMSBt1awVYas9/xuJzs61z6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:43:56.627079Z","bundle_sha256":"d76d7f70e0b09fb5be730ae9797efbd35b6431b13ff798edbb5be93ca8d18ce7"}}