{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XTEVXUSQ6UW3ULNFASYZNC4HNC","short_pith_number":"pith:XTEVXUSQ","canonical_record":{"source":{"id":"1705.00216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T17:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"f5496c1cc21303e548d4e344fb25c45082044a38fc7aec62c54ef4b03c0fd20e","abstract_canon_sha256":"2f30d22ce24352ee5a212bb2ca547023808f649a33bf502777c26f1a8cc944a8"},"schema_version":"1.0"},"canonical_sha256":"bcc95bd250f52dba2da504b1968b87689a338d63b084500e8665bf9d1bc43f71","source":{"kind":"arxiv","id":"1705.00216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00216","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00216v1","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00216","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"XTEVXUSQ6UW3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XTEVXUSQ6UW3ULNF","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XTEVXUSQ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XTEVXUSQ6UW3ULNFASYZNC4HNC","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T17:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"f5496c1cc21303e548d4e344fb25c45082044a38fc7aec62c54ef4b03c0fd20e","abstract_canon_sha256":"2f30d22ce24352ee5a212bb2ca547023808f649a33bf502777c26f1a8cc944a8"},"schema_version":"1.0"},"canonical_sha256":"bcc95bd250f52dba2da504b1968b87689a338d63b084500e8665bf9d1bc43f71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:21.143520Z","signature_b64":"pc6INXPscLNVtjpQWEvOYtkxn7FPefAaqCK8sTq7cDyO7oxuXt/5dn0saB4HautkJCMeR5ttI8QoH1uGHnXkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcc95bd250f52dba2da504b1968b87689a338d63b084500e8665bf9d1bc43f71","last_reissued_at":"2026-05-18T00:45:21.142787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:21.142787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00216","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9f1k93uWT8U2vJxhfOcCWR3wcnCKA0zc38ghk0uN5VQqZ5qZj2DVseVYafYaFtzQPdjHB93PIsSofLrbsbIuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:04:51.822757Z"},"content_sha256":"0646ca79305ea550ddfce1cacf6dd31ee9f64195b326861234483cbe336a8297","schema_version":"1.0","event_id":"sha256:0646ca79305ea550ddfce1cacf6dd31ee9f64195b326861234483cbe336a8297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XTEVXUSQ6UW3ULNFASYZNC4HNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of trees having a minimum vertex cover which is also a minimum total dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Magdalena Lema\\'nska, Rita Zuazua","submitted_at":"2017-04-29T17:06:10Z","abstract_excerpt":"A vertex cover of a graph $G = (V, E)$ is a set $X \\subseteq V$ such that each edge of $G$ is incident to at least one vertex of $X$. A dominating set $D \\subseteq V$ is a total dominating set of $G$ if the subgraph induced by $D$ has no isolated vertices. A $(\\gamma_t-\\tau)$-set of $G$ is a minimum vertex cover which is also a minimum total dominating set. In this article we give a constructive characterization of trees having a $(\\gamma_t-\\tau)$-set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00216","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4NvZ8AAaKluY0wjx2Te5MS18we4+NU0Y4zqermYbHTY7Jn9X2U1SVnvvRF7WUWEhIuAhTKdA8/eGZUKVlGoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:04:51.823421Z"},"content_sha256":"1d67430a3e25be79d9079c46818a1356c20215d9c9e135e9d3922d5431d84e43","schema_version":"1.0","event_id":"sha256:1d67430a3e25be79d9079c46818a1356c20215d9c9e135e9d3922d5431d84e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC/bundle.json","state_url":"https://pith.science/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC/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-27T15:04:51Z","links":{"resolver":"https://pith.science/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC","bundle":"https://pith.science/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC/bundle.json","state":"https://pith.science/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTEVXUSQ6UW3ULNFASYZNC4HNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XTEVXUSQ6UW3ULNFASYZNC4HNC","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":"2f30d22ce24352ee5a212bb2ca547023808f649a33bf502777c26f1a8cc944a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T17:06:10Z","title_canon_sha256":"f5496c1cc21303e548d4e344fb25c45082044a38fc7aec62c54ef4b03c0fd20e"},"schema_version":"1.0","source":{"id":"1705.00216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00216","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00216v1","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00216","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"XTEVXUSQ6UW3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XTEVXUSQ6UW3ULNF","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XTEVXUSQ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:1d67430a3e25be79d9079c46818a1356c20215d9c9e135e9d3922d5431d84e43","target":"graph","created_at":"2026-05-18T00:45:21Z","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 vertex cover of a graph $G = (V, E)$ is a set $X \\subseteq V$ such that each edge of $G$ is incident to at least one vertex of $X$. A dominating set $D \\subseteq V$ is a total dominating set of $G$ if the subgraph induced by $D$ has no isolated vertices. A $(\\gamma_t-\\tau)$-set of $G$ is a minimum vertex cover which is also a minimum total dominating set. In this article we give a constructive characterization of trees having a $(\\gamma_t-\\tau)$-set.","authors_text":"C\\'esar Hern\\'andez-Cruz, Magdalena Lema\\'nska, Rita Zuazua","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T17:06:10Z","title":"A characterization of trees having a minimum vertex cover which is also a minimum total dominating set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00216","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:0646ca79305ea550ddfce1cacf6dd31ee9f64195b326861234483cbe336a8297","target":"record","created_at":"2026-05-18T00:45:21Z","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":"2f30d22ce24352ee5a212bb2ca547023808f649a33bf502777c26f1a8cc944a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T17:06:10Z","title_canon_sha256":"f5496c1cc21303e548d4e344fb25c45082044a38fc7aec62c54ef4b03c0fd20e"},"schema_version":"1.0","source":{"id":"1705.00216","kind":"arxiv","version":1}},"canonical_sha256":"bcc95bd250f52dba2da504b1968b87689a338d63b084500e8665bf9d1bc43f71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcc95bd250f52dba2da504b1968b87689a338d63b084500e8665bf9d1bc43f71","first_computed_at":"2026-05-18T00:45:21.142787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:21.142787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pc6INXPscLNVtjpQWEvOYtkxn7FPefAaqCK8sTq7cDyO7oxuXt/5dn0saB4HautkJCMeR5ttI8QoH1uGHnXkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:21.143520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0646ca79305ea550ddfce1cacf6dd31ee9f64195b326861234483cbe336a8297","sha256:1d67430a3e25be79d9079c46818a1356c20215d9c9e135e9d3922d5431d84e43"],"state_sha256":"bbb9d8fa02400d6a241b0c44934d76b67231dd1c00225dedad7764755a82c803"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b162x0cELxc0QRb+h0zmVWDz8tGT+CjGE0ifmQpTAeTCXCHtek1itp4WiWC2r3nwCSothAxgzDl+jOEh07sXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:04:51.826960Z","bundle_sha256":"cd98f7603152481a13a2d01e8f2e27bbbffa4eaf47dd0b8c3cde6e5c48ce7ddd"}}