{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ECDOKFXJRFNQ3MLQWDCUKOG7EW","short_pith_number":"pith:ECDOKFXJ","canonical_record":{"source":{"id":"1609.01510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-06T12:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"16948b5848d75edb3bcda99e61df4f77695364cba109a7e0fa3d0d9ab47f3b40","abstract_canon_sha256":"6a237d359f552c91976a6e15d12af278083fd04431c2e6155b9cd0bb0bb8d069"},"schema_version":"1.0"},"canonical_sha256":"2086e516e9895b0db170b0c54538df25afec6b0b4a4bc109d75f1f39125db631","source":{"kind":"arxiv","id":"1609.01510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01510","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01510v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01510","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"ECDOKFXJRFNQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"ECDOKFXJRFNQ3MLQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"ECDOKFXJ","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ECDOKFXJRFNQ3MLQWDCUKOG7EW","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-06T12:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"16948b5848d75edb3bcda99e61df4f77695364cba109a7e0fa3d0d9ab47f3b40","abstract_canon_sha256":"6a237d359f552c91976a6e15d12af278083fd04431c2e6155b9cd0bb0bb8d069"},"schema_version":"1.0"},"canonical_sha256":"2086e516e9895b0db170b0c54538df25afec6b0b4a4bc109d75f1f39125db631","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.368710Z","signature_b64":"tN0853r0o7cGhdfxnQMCWlPAw0D/l+CvA91BQyG+BZNBSdcCklkpvd/jMgsmJ575FMHvNihAMazS7wslzzlTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2086e516e9895b0db170b0c54538df25afec6b0b4a4bc109d75f1f39125db631","last_reissued_at":"2026-05-18T01:05:39.368171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.368171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01510","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:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8r0uHCRjjo+hy9ZXTSNziCz2KEur6VxDzYsTQ3MDRJGGGkGClLtgS6V5GE0A39S1keVYB8pamneiJ5uBnvVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:49:46.502613Z"},"content_sha256":"cb4656e0ad275507ec0c1d7fb97bb21fb63896604955dbd71fea3281ce8cc7cb","schema_version":"1.0","event_id":"sha256:cb4656e0ad275507ec0c1d7fb97bb21fb63896604955dbd71fea3281ce8cc7cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ECDOKFXJRFNQ3MLQWDCUKOG7EW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Domination: towards a dichotomy through boundary properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Bernard Ries, Hassan AbouEisha, J\\'er\\^ome Monnot, Shahid Hussain, Vadim Lozin, Viktor Zamaraev","submitted_at":"2016-09-06T12:01:56Z","abstract_excerpt":"An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes of graphs defined by finitely many forbidden induced subgraphs and conjecture that the problem admits a dichotomy in this family, i.e. it is either NP-hard or polynomial-time solvable for each class in the family. A helpful tool to study the complexity of an algorithmic problem on finitely defined classes of graphs is the notion of boundary classes. However, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01510","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:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGPJPeUTE0I3p446X1WcRa4zhwmnR1jcKwMsbrY2GRjH3H9ilRkVG4H0zc+iHMcKsNqj3q/2VRyMHEqff2zkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:49:46.503383Z"},"content_sha256":"db9605dd5f5f61f0a5ecae59cf2f6d7c46284ae04e4b3a3d694a68813972a812","schema_version":"1.0","event_id":"sha256:db9605dd5f5f61f0a5ecae59cf2f6d7c46284ae04e4b3a3d694a68813972a812"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW/bundle.json","state_url":"https://pith.science/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW/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-27T16:49:46Z","links":{"resolver":"https://pith.science/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW","bundle":"https://pith.science/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW/bundle.json","state":"https://pith.science/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECDOKFXJRFNQ3MLQWDCUKOG7EW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ECDOKFXJRFNQ3MLQWDCUKOG7EW","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":"6a237d359f552c91976a6e15d12af278083fd04431c2e6155b9cd0bb0bb8d069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-06T12:01:56Z","title_canon_sha256":"16948b5848d75edb3bcda99e61df4f77695364cba109a7e0fa3d0d9ab47f3b40"},"schema_version":"1.0","source":{"id":"1609.01510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01510","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01510v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01510","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"ECDOKFXJRFNQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"ECDOKFXJRFNQ3MLQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"ECDOKFXJ","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:db9605dd5f5f61f0a5ecae59cf2f6d7c46284ae04e4b3a3d694a68813972a812","target":"graph","created_at":"2026-05-18T01:05:39Z","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":"An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes of graphs defined by finitely many forbidden induced subgraphs and conjecture that the problem admits a dichotomy in this family, i.e. it is either NP-hard or polynomial-time solvable for each class in the family. A helpful tool to study the complexity of an algorithmic problem on finitely defined classes of graphs is the notion of boundary classes. However, ","authors_text":"Bernard Ries, Hassan AbouEisha, J\\'er\\^ome Monnot, Shahid Hussain, Vadim Lozin, Viktor Zamaraev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-06T12:01:56Z","title":"Upper Domination: towards a dichotomy through boundary properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01510","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:cb4656e0ad275507ec0c1d7fb97bb21fb63896604955dbd71fea3281ce8cc7cb","target":"record","created_at":"2026-05-18T01:05:39Z","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":"6a237d359f552c91976a6e15d12af278083fd04431c2e6155b9cd0bb0bb8d069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-06T12:01:56Z","title_canon_sha256":"16948b5848d75edb3bcda99e61df4f77695364cba109a7e0fa3d0d9ab47f3b40"},"schema_version":"1.0","source":{"id":"1609.01510","kind":"arxiv","version":1}},"canonical_sha256":"2086e516e9895b0db170b0c54538df25afec6b0b4a4bc109d75f1f39125db631","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2086e516e9895b0db170b0c54538df25afec6b0b4a4bc109d75f1f39125db631","first_computed_at":"2026-05-18T01:05:39.368171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:39.368171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tN0853r0o7cGhdfxnQMCWlPAw0D/l+CvA91BQyG+BZNBSdcCklkpvd/jMgsmJ575FMHvNihAMazS7wslzzlTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:39.368710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb4656e0ad275507ec0c1d7fb97bb21fb63896604955dbd71fea3281ce8cc7cb","sha256:db9605dd5f5f61f0a5ecae59cf2f6d7c46284ae04e4b3a3d694a68813972a812"],"state_sha256":"8cc21f3b2bbb217ffb89cedb2ea906c57623da6add4af7938ba2fd3e311c3653"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mSXD/1M2JLg/pyMgMhpzdHg1DTGf/FMrtWmB1D/e6vvgCAs6VGBNfjI74T7/7W87P9S6VMdw6OYIaoAb2AiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:49:46.507168Z","bundle_sha256":"c7f6aae0ec36bf21e14ff9096838b89613d33b135e752b04a44f86e4d3d49b17"}}