{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AJNQLUBPBATBBOOLD7YVFG5ENC","short_pith_number":"pith:AJNQLUBP","canonical_record":{"source":{"id":"1810.08773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-20T08:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"8a4b44bb80ae47f75133904086d3b867e3e2d6fb59729b464ff92066e98d4449","abstract_canon_sha256":"a5081517d0bda873c9a89feef989dfc679a407a67be166205558e69bf8da1dff"},"schema_version":"1.0"},"canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","source":{"kind":"arxiv","id":"1810.08773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08773","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08773v1","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08773","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"AJNQLUBPBATB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AJNQLUBPBATBBOOL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AJNQLUBP","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AJNQLUBPBATBBOOLD7YVFG5ENC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-20T08:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"8a4b44bb80ae47f75133904086d3b867e3e2d6fb59729b464ff92066e98d4449","abstract_canon_sha256":"a5081517d0bda873c9a89feef989dfc679a407a67be166205558e69bf8da1dff"},"schema_version":"1.0"},"canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:41.940198Z","signature_b64":"7XjhcJqmeAL6YbAhNWuWeOaS70cK8kv3VONwYJ/YTsm9oHwJw8HTKTBRFbnU5v91DyfjArX7TNwfylJqhNg5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","last_reissued_at":"2026-05-18T00:02:41.939736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:41.939736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08773","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:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0r3OC0h9wvFw2o0IDIWuYNsOfRESHFuPNlxCqmxpnEITO8Y++rn1jpd5jr4dERGB8YATJMlp5PJRjmrS4JZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:24:58.883141Z"},"content_sha256":"0f77d5d627fadfc078e74e6d53ab4982f2831bc73c74b72517403e0a60738e29","schema_version":"1.0","event_id":"sha256:0f77d5d627fadfc078e74e6d53ab4982f2831bc73c74b72517403e0a60738e29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AJNQLUBPBATBBOOLD7YVFG5ENC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total mixed domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Farshad Kazemnejad, Somayeh Moradi","submitted_at":"2018-10-20T08:53:57Z","abstract_excerpt":"For a graph $G=(V,E)$, we call a subset $ S\\subseteq V \\cup E$ a total mixed dominating set of $G$ if each element of $V \\cup E$ is either adjacent or incident to an element of $S$, and the total mixed domination number $\\gamma_{tm}(G)$ of $G$ is the minimum cardinality of a total mixed dominating set of $G$. In this paper, we initiate to study the total mixed domination number of a connected graph by giving some tight bounds in terms of some parameters such as order and total domination numbers of the graph and its line graph. Then we discuss on the relation between total mixed domination num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08773","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:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIwxtIKk4tV8cq9OXq18jNHZLabNPyVo04gbq+cK98qH3fLUI3R2Q410g8ZVgBwazckFyR4rxtw1H6N87rIQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:24:58.883519Z"},"content_sha256":"cb0b974985b89ddab477a386901b247f46c93d7e50e8258daa9cd61890b6a223","schema_version":"1.0","event_id":"sha256:cb0b974985b89ddab477a386901b247f46c93d7e50e8258daa9cd61890b6a223"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/bundle.json","state_url":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/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-21T20:24:58Z","links":{"resolver":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC","bundle":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/bundle.json","state":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AJNQLUBPBATBBOOLD7YVFG5ENC","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":"a5081517d0bda873c9a89feef989dfc679a407a67be166205558e69bf8da1dff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-20T08:53:57Z","title_canon_sha256":"8a4b44bb80ae47f75133904086d3b867e3e2d6fb59729b464ff92066e98d4449"},"schema_version":"1.0","source":{"id":"1810.08773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08773","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08773v1","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08773","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"AJNQLUBPBATB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AJNQLUBPBATBBOOL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AJNQLUBP","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:cb0b974985b89ddab477a386901b247f46c93d7e50e8258daa9cd61890b6a223","target":"graph","created_at":"2026-05-18T00:02:41Z","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":"For a graph $G=(V,E)$, we call a subset $ S\\subseteq V \\cup E$ a total mixed dominating set of $G$ if each element of $V \\cup E$ is either adjacent or incident to an element of $S$, and the total mixed domination number $\\gamma_{tm}(G)$ of $G$ is the minimum cardinality of a total mixed dominating set of $G$. In this paper, we initiate to study the total mixed domination number of a connected graph by giving some tight bounds in terms of some parameters such as order and total domination numbers of the graph and its line graph. Then we discuss on the relation between total mixed domination num","authors_text":"Adel P. Kazemi, Farshad Kazemnejad, Somayeh Moradi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-20T08:53:57Z","title":"Total mixed domination in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08773","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:0f77d5d627fadfc078e74e6d53ab4982f2831bc73c74b72517403e0a60738e29","target":"record","created_at":"2026-05-18T00:02:41Z","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":"a5081517d0bda873c9a89feef989dfc679a407a67be166205558e69bf8da1dff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-20T08:53:57Z","title_canon_sha256":"8a4b44bb80ae47f75133904086d3b867e3e2d6fb59729b464ff92066e98d4449"},"schema_version":"1.0","source":{"id":"1810.08773","kind":"arxiv","version":1}},"canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","first_computed_at":"2026-05-18T00:02:41.939736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:41.939736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7XjhcJqmeAL6YbAhNWuWeOaS70cK8kv3VONwYJ/YTsm9oHwJw8HTKTBRFbnU5v91DyfjArX7TNwfylJqhNg5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:41.940198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f77d5d627fadfc078e74e6d53ab4982f2831bc73c74b72517403e0a60738e29","sha256:cb0b974985b89ddab477a386901b247f46c93d7e50e8258daa9cd61890b6a223"],"state_sha256":"75063f593c8f5d9dfb42b6556ccd37790f22b8c1b989481a8293907aba3ec307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fuVerRbLhB6OI6Z4lpBSd+EzX7THuzEJ/5g42R9VfFoVM3DkQd73C0EvorgM78D38HnWwpWU28DVWO+IIP8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:24:58.885623Z","bundle_sha256":"917b3ec0de3ef472807cd51cd03b5d83abf32d54e3bb0ead595a977e02999dbe"}}