{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RES6UBT4HGVK4CK6F2R5NX2JQF","short_pith_number":"pith:RES6UBT4","canonical_record":{"source":{"id":"1610.06539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T19:00:46Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"cb00e58600dc4a6ae87b2ec579ab3efcf6ab56b6b856ba640f5d87a53cf72fbd","abstract_canon_sha256":"11728d98e228eb2f0ab28e569fe06399b4ec22b205c7dc9d5b4c351edd201ddc"},"schema_version":"1.0"},"canonical_sha256":"8925ea067c39aaae095e2ea3d6df498175de0c6b2b5fbef32e632be782402cc6","source":{"kind":"arxiv","id":"1610.06539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06539","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06539v2","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06539","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"RES6UBT4HGVK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RES6UBT4HGVK4CK6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RES6UBT4","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RES6UBT4HGVK4CK6F2R5NX2JQF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T19:00:46Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"cb00e58600dc4a6ae87b2ec579ab3efcf6ab56b6b856ba640f5d87a53cf72fbd","abstract_canon_sha256":"11728d98e228eb2f0ab28e569fe06399b4ec22b205c7dc9d5b4c351edd201ddc"},"schema_version":"1.0"},"canonical_sha256":"8925ea067c39aaae095e2ea3d6df498175de0c6b2b5fbef32e632be782402cc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:48.311139Z","signature_b64":"KKBraDKo+CefC3vuI63PlKhrzSaIMwS0ghLZ7W7wHicW4v+st3NjJdM67Iliw0hXH63yGNSZxUhlbhfirmThDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8925ea067c39aaae095e2ea3d6df498175de0c6b2b5fbef32e632be782402cc6","last_reissued_at":"2026-05-18T00:13:48.310294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:48.310294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06539","source_version":2,"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-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swpk0nXlCqFH03BKlog0NKSsvmeWqtZWFtm5ENdKtJWiqQW3ykKlu3GL0M/3bvv05KOk8rsIRL8TnnONG2p9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:28:31.395478Z"},"content_sha256":"9c66d1a536db1980e70b5a89f7af1c8b6190eabc04c9188981f3970b0ecf92fb","schema_version":"1.0","event_id":"sha256:9c66d1a536db1980e70b5a89f7af1c8b6190eabc04c9188981f3970b0ecf92fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RES6UBT4HGVK4CK6F2R5NX2JQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear separation of connected dominating sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Martin Milani\\v{c}, Nina Chiarelli","submitted_at":"2016-10-20T19:00:46Z","abstract_excerpt":"A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. Following analogous studies in the literature related to independent sets, dominating sets, and total dominating sets, we study in this paper the class of graphs in which the connected dominating sets can be separated from the other vertex subsets by a linear weight function. More precisely, we say that a graph is connected-domishold if it admits non-negative real weights associated to its vertices such that a set of vertices is a connected dominating set if and only if the sum of the corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06539","kind":"arxiv","version":2},"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-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CWCy4IJt6658wQgPprVeGd8XXscucoiEksxoi16eWnr97hp48bN8y75xrYeZuajqVRXxMqoOPoSMcLqEaKoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:28:31.395849Z"},"content_sha256":"d1e2fdf8a61a360b346466ab6b830bf5bbb1e64920ac38012eff189d5b40946c","schema_version":"1.0","event_id":"sha256:d1e2fdf8a61a360b346466ab6b830bf5bbb1e64920ac38012eff189d5b40946c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RES6UBT4HGVK4CK6F2R5NX2JQF/bundle.json","state_url":"https://pith.science/pith/RES6UBT4HGVK4CK6F2R5NX2JQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RES6UBT4HGVK4CK6F2R5NX2JQF/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-28T03:28:31Z","links":{"resolver":"https://pith.science/pith/RES6UBT4HGVK4CK6F2R5NX2JQF","bundle":"https://pith.science/pith/RES6UBT4HGVK4CK6F2R5NX2JQF/bundle.json","state":"https://pith.science/pith/RES6UBT4HGVK4CK6F2R5NX2JQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RES6UBT4HGVK4CK6F2R5NX2JQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RES6UBT4HGVK4CK6F2R5NX2JQF","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":"11728d98e228eb2f0ab28e569fe06399b4ec22b205c7dc9d5b4c351edd201ddc","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T19:00:46Z","title_canon_sha256":"cb00e58600dc4a6ae87b2ec579ab3efcf6ab56b6b856ba640f5d87a53cf72fbd"},"schema_version":"1.0","source":{"id":"1610.06539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06539","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06539v2","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06539","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"RES6UBT4HGVK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RES6UBT4HGVK4CK6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RES6UBT4","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:d1e2fdf8a61a360b346466ab6b830bf5bbb1e64920ac38012eff189d5b40946c","target":"graph","created_at":"2026-05-18T00:13:48Z","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":"A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. Following analogous studies in the literature related to independent sets, dominating sets, and total dominating sets, we study in this paper the class of graphs in which the connected dominating sets can be separated from the other vertex subsets by a linear weight function. More precisely, we say that a graph is connected-domishold if it admits non-negative real weights associated to its vertices such that a set of vertices is a connected dominating set if and only if the sum of the corre","authors_text":"Martin Milani\\v{c}, Nina Chiarelli","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T19:00:46Z","title":"Linear separation of connected dominating sets in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06539","kind":"arxiv","version":2},"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:9c66d1a536db1980e70b5a89f7af1c8b6190eabc04c9188981f3970b0ecf92fb","target":"record","created_at":"2026-05-18T00:13:48Z","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":"11728d98e228eb2f0ab28e569fe06399b4ec22b205c7dc9d5b4c351edd201ddc","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T19:00:46Z","title_canon_sha256":"cb00e58600dc4a6ae87b2ec579ab3efcf6ab56b6b856ba640f5d87a53cf72fbd"},"schema_version":"1.0","source":{"id":"1610.06539","kind":"arxiv","version":2}},"canonical_sha256":"8925ea067c39aaae095e2ea3d6df498175de0c6b2b5fbef32e632be782402cc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8925ea067c39aaae095e2ea3d6df498175de0c6b2b5fbef32e632be782402cc6","first_computed_at":"2026-05-18T00:13:48.310294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:48.310294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KKBraDKo+CefC3vuI63PlKhrzSaIMwS0ghLZ7W7wHicW4v+st3NjJdM67Iliw0hXH63yGNSZxUhlbhfirmThDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:48.311139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c66d1a536db1980e70b5a89f7af1c8b6190eabc04c9188981f3970b0ecf92fb","sha256:d1e2fdf8a61a360b346466ab6b830bf5bbb1e64920ac38012eff189d5b40946c"],"state_sha256":"aa493c1892c6453c6839dd2ca0846d59dcfda22e21c2d89e65a7ef12c334cb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJiTK8MVb2WA94SOsEkvN5+ZqwjGB38zxSbS3FxLnmwCyRM6bLYdSI5pRi/MF4qlNLDvpOaJEAgpWAuxRRm5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T03:28:31.397832Z","bundle_sha256":"6149edfb9851c2de3b4c49a0a7b574464cbea03f8af0f8df1ba728598090224c"}}