{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GQE2FW32YHHUGWLANCAM7CE7IM","short_pith_number":"pith:GQE2FW32","canonical_record":{"source":{"id":"1410.0187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-01T11:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"304e0252237d5ff78253934398eb4244a3720525379ae69ba9d60fe2cda6190e","abstract_canon_sha256":"684e13e9b19d3fcab9429b02af94f23522e5fe9e24e17cb3201577a57162b7a3"},"schema_version":"1.0"},"canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","source":{"kind":"arxiv","id":"1410.0187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0187","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0187v1","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0187","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"GQE2FW32YHHU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GQE2FW32YHHUGWLA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GQE2FW32","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GQE2FW32YHHUGWLANCAM7CE7IM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-01T11:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"304e0252237d5ff78253934398eb4244a3720525379ae69ba9d60fe2cda6190e","abstract_canon_sha256":"684e13e9b19d3fcab9429b02af94f23522e5fe9e24e17cb3201577a57162b7a3"},"schema_version":"1.0"},"canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:17.829966Z","signature_b64":"tVnTAMjgi0FjaUGuw3kS9h8+mAs9cxNZLHLwkaWrKMoCiqkzlfgIW/JPYdb7c9bxAO+fRZI/9yMVFWUWOQ35Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","last_reissued_at":"2026-05-18T02:41:17.829474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:17.829474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0187","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-18T02:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZy5JxqAwMonu9KXu1Rag3y8Q01u8x2oLM6/izVShJO5sid1TVv1HcNewzm+dy8cpCb3/eoijSNkwJaFkK5mCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:18:04.400842Z"},"content_sha256":"80d2f477cccff00dc57ab1f0d683bc022ebbd1edda3c009c57923ada19813a22","schema_version":"1.0","event_id":"sha256:80d2f477cccff00dc57ab1f0d683bc022ebbd1edda3c009c57923ada19813a22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GQE2FW32YHHUGWLANCAM7CE7IM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disjunctive Total Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Viroshan Naicker","submitted_at":"2014-10-01T11:48:29Z","abstract_excerpt":"Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\\gamma_t(G)$. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in $S$ at distance2 from it. The disjunctive total domination number, $\\gamma^d_t(G)$, is the minimum cardinality of such a set. We observe that $\\gamma^d_t(G) \\le \\gamma_t(G)$. We prove that if $G$ is a connected graph of order$n \\ge 8$, then $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0187","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-18T02:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXFwOIfLQuqQ55stjVpFjbjQQxVZqZvj0VkWTbKPZwfyUDqmzoImmFHrNZj2EVEm4fa2rPAa/7bygN9bt+K9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:18:04.401504Z"},"content_sha256":"170da9b0bb648ab9dba34dcf18ed78777952e8f41dc6752120bec7885ca65543","schema_version":"1.0","event_id":"sha256:170da9b0bb648ab9dba34dcf18ed78777952e8f41dc6752120bec7885ca65543"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/bundle.json","state_url":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQE2FW32YHHUGWLANCAM7CE7IM/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-11T06:18:04Z","links":{"resolver":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM","bundle":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/bundle.json","state":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQE2FW32YHHUGWLANCAM7CE7IM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GQE2FW32YHHUGWLANCAM7CE7IM","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":"684e13e9b19d3fcab9429b02af94f23522e5fe9e24e17cb3201577a57162b7a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-01T11:48:29Z","title_canon_sha256":"304e0252237d5ff78253934398eb4244a3720525379ae69ba9d60fe2cda6190e"},"schema_version":"1.0","source":{"id":"1410.0187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0187","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0187v1","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0187","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"GQE2FW32YHHU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GQE2FW32YHHUGWLA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GQE2FW32","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:170da9b0bb648ab9dba34dcf18ed78777952e8f41dc6752120bec7885ca65543","target":"graph","created_at":"2026-05-18T02:41:17Z","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":"Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\\gamma_t(G)$. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in $S$ at distance2 from it. The disjunctive total domination number, $\\gamma^d_t(G)$, is the minimum cardinality of such a set. We observe that $\\gamma^d_t(G) \\le \\gamma_t(G)$. We prove that if $G$ is a connected graph of order$n \\ge 8$, then $","authors_text":"Michael A. Henning, Viroshan Naicker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-01T11:48:29Z","title":"Disjunctive Total Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0187","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:80d2f477cccff00dc57ab1f0d683bc022ebbd1edda3c009c57923ada19813a22","target":"record","created_at":"2026-05-18T02:41:17Z","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":"684e13e9b19d3fcab9429b02af94f23522e5fe9e24e17cb3201577a57162b7a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-01T11:48:29Z","title_canon_sha256":"304e0252237d5ff78253934398eb4244a3720525379ae69ba9d60fe2cda6190e"},"schema_version":"1.0","source":{"id":"1410.0187","kind":"arxiv","version":1}},"canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","first_computed_at":"2026-05-18T02:41:17.829474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:17.829474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVnTAMjgi0FjaUGuw3kS9h8+mAs9cxNZLHLwkaWrKMoCiqkzlfgIW/JPYdb7c9bxAO+fRZI/9yMVFWUWOQ35Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:17.829966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80d2f477cccff00dc57ab1f0d683bc022ebbd1edda3c009c57923ada19813a22","sha256:170da9b0bb648ab9dba34dcf18ed78777952e8f41dc6752120bec7885ca65543"],"state_sha256":"5dbc2db304c8051403aea9803f3ac29f06b8afa326cc8802f5644b7e50820a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaRy0WPpX+/OIcAvo6tLwA7lN+jXZpb/3UmLgLBSudLIopYQMPH6HkkH70WG/KDA4iW+V0LgtNweAGx5nZ7zCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:18:04.405401Z","bundle_sha256":"088ef0cb399080b3bcd9a66c2f7f95b4fbfaac1d2475ddc966fc6829f0d2ceb9"}}