{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TPWUSCV3JR2B7NEE6QABL6KTZX","short_pith_number":"pith:TPWUSCV3","canonical_record":{"source":{"id":"1704.08484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T09:05:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"532b463ecae701cc52486a1094df69c9e27b5856598d6e0b9e2035b07c88315b","abstract_canon_sha256":"fdd6ce267de65360e913f1bde243814fd89fa92a68e2209f74ad8880f0b83b16"},"schema_version":"1.0"},"canonical_sha256":"9bed490abb4c741fb484f40015f953cdfe20714339b7ef6ab2c11fc9775a64b8","source":{"kind":"arxiv","id":"1704.08484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08484","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08484v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08484","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"TPWUSCV3JR2B","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPWUSCV3JR2B7NEE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPWUSCV3","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TPWUSCV3JR2B7NEE6QABL6KTZX","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T09:05:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"532b463ecae701cc52486a1094df69c9e27b5856598d6e0b9e2035b07c88315b","abstract_canon_sha256":"fdd6ce267de65360e913f1bde243814fd89fa92a68e2209f74ad8880f0b83b16"},"schema_version":"1.0"},"canonical_sha256":"9bed490abb4c741fb484f40015f953cdfe20714339b7ef6ab2c11fc9775a64b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.561901Z","signature_b64":"iAPtLVQWsEU30vnnt+0mjKOMCpeUXNE8R9UFuJ+MQCSZqgi/2/r1DU7GLwSlKg2TE9l9Qs0fOfy80wBF5Dw8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bed490abb4c741fb484f40015f953cdfe20714339b7ef6ab2c11fc9775a64b8","last_reissued_at":"2026-05-18T00:45:27.561509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.561509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08484","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-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0b0S/xqNc8NT2p67KywaygKs34NadQ9v3+1ZtUq3JQxigBb5ho2Ffm6hOmQN2RXn3psBkgKKP/Sic0Hgo91Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:04:00.677056Z"},"content_sha256":"edd36cfec18def89d7b35bea90197276095c2fa03c9e5f9915b2a591d578c033","schema_version":"1.0","event_id":"sha256:edd36cfec18def89d7b35bea90197276095c2fa03c9e5f9915b2a591d578c033"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TPWUSCV3JR2B7NEE6QABL6KTZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex and isometric domination of (weak) dominating pair graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Tanja Gologranc, Tim Kos","submitted_at":"2017-04-27T09:05:35Z","abstract_excerpt":"A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all vertices in one of the shortest paths) between any two vertices in $D$ lie in $D$. The problem of finding a minimum convex dominating (respectively, isometric dominating) set is considered in this paper from algorithmic point of view. For the class of weak dominating pair graphs (i.e.,~the graphs that contain a dominating pair, which is a pair of ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08484","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-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GYwB4cDy3tdRdcbgGuHpaXVeylNZCEfQSVIpAC2U4S29E8cq66jPWoje0Az2U2z8udHuZ0NjmOjdW9nbO/qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:04:00.677420Z"},"content_sha256":"126799a4c88b7df45005d0b3f0b6dd349f638dc62056003d393bf7d8496e7b37","schema_version":"1.0","event_id":"sha256:126799a4c88b7df45005d0b3f0b6dd349f638dc62056003d393bf7d8496e7b37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPWUSCV3JR2B7NEE6QABL6KTZX/bundle.json","state_url":"https://pith.science/pith/TPWUSCV3JR2B7NEE6QABL6KTZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPWUSCV3JR2B7NEE6QABL6KTZX/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-30T05:04:00Z","links":{"resolver":"https://pith.science/pith/TPWUSCV3JR2B7NEE6QABL6KTZX","bundle":"https://pith.science/pith/TPWUSCV3JR2B7NEE6QABL6KTZX/bundle.json","state":"https://pith.science/pith/TPWUSCV3JR2B7NEE6QABL6KTZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPWUSCV3JR2B7NEE6QABL6KTZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TPWUSCV3JR2B7NEE6QABL6KTZX","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":"fdd6ce267de65360e913f1bde243814fd89fa92a68e2209f74ad8880f0b83b16","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T09:05:35Z","title_canon_sha256":"532b463ecae701cc52486a1094df69c9e27b5856598d6e0b9e2035b07c88315b"},"schema_version":"1.0","source":{"id":"1704.08484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08484","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08484v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08484","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"TPWUSCV3JR2B","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPWUSCV3JR2B7NEE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPWUSCV3","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:126799a4c88b7df45005d0b3f0b6dd349f638dc62056003d393bf7d8496e7b37","target":"graph","created_at":"2026-05-18T00:45:27Z","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 set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all vertices in one of the shortest paths) between any two vertices in $D$ lie in $D$. The problem of finding a minimum convex dominating (respectively, isometric dominating) set is considered in this paper from algorithmic point of view. For the class of weak dominating pair graphs (i.e.,~the graphs that contain a dominating pair, which is a pair of ver","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Tanja Gologranc, Tim Kos","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T09:05:35Z","title":"Convex and isometric domination of (weak) dominating pair graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08484","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:edd36cfec18def89d7b35bea90197276095c2fa03c9e5f9915b2a591d578c033","target":"record","created_at":"2026-05-18T00:45:27Z","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":"fdd6ce267de65360e913f1bde243814fd89fa92a68e2209f74ad8880f0b83b16","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-27T09:05:35Z","title_canon_sha256":"532b463ecae701cc52486a1094df69c9e27b5856598d6e0b9e2035b07c88315b"},"schema_version":"1.0","source":{"id":"1704.08484","kind":"arxiv","version":1}},"canonical_sha256":"9bed490abb4c741fb484f40015f953cdfe20714339b7ef6ab2c11fc9775a64b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bed490abb4c741fb484f40015f953cdfe20714339b7ef6ab2c11fc9775a64b8","first_computed_at":"2026-05-18T00:45:27.561509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.561509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iAPtLVQWsEU30vnnt+0mjKOMCpeUXNE8R9UFuJ+MQCSZqgi/2/r1DU7GLwSlKg2TE9l9Qs0fOfy80wBF5Dw8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.561901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edd36cfec18def89d7b35bea90197276095c2fa03c9e5f9915b2a591d578c033","sha256:126799a4c88b7df45005d0b3f0b6dd349f638dc62056003d393bf7d8496e7b37"],"state_sha256":"ac28ad2cc244ec7a69bb612d57b8e952c77fc5f5b417771e8588e5b74b843a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeddyPjbMw3rgaDA9tnUoGhd8AZCw9bnD2AF6MlFxIc9z0EvrUlK/zuZ9I1vkzB74we7EItgOmJVeQMIbOSeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:04:00.679613Z","bundle_sha256":"bb955ac7c044514cf9c73bf98bd149da7a2a005f9ced4c582867d0c0d2d81479"}}