{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7K4NP66QIC6CTBROAC6MVY32UQ","short_pith_number":"pith:7K4NP66Q","canonical_record":{"source":{"id":"1108.5949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-30T12:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"125634e37635fbf74ce201f873e68a542f6a628dfb8807e3017c5fa28dbae58d","abstract_canon_sha256":"566a30eb8b343bc32b19d87a5901d4f2ddc0fa582bd3e6c2c0c4a7e552708b9c"},"schema_version":"1.0"},"canonical_sha256":"fab8d7fbd040bc29862e00bccae37aa4038372fabe398e77e3061d2986b54d02","source":{"kind":"arxiv","id":"1108.5949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5949","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5949v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5949","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"7K4NP66QIC6C","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7K4NP66QIC6CTBRO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7K4NP66Q","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7K4NP66QIC6CTBROAC6MVY32UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-30T12:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"125634e37635fbf74ce201f873e68a542f6a628dfb8807e3017c5fa28dbae58d","abstract_canon_sha256":"566a30eb8b343bc32b19d87a5901d4f2ddc0fa582bd3e6c2c0c4a7e552708b9c"},"schema_version":"1.0"},"canonical_sha256":"fab8d7fbd040bc29862e00bccae37aa4038372fabe398e77e3061d2986b54d02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:28.188387Z","signature_b64":"Fhb1fZjwqMjTUJlM7R/aJtOM6QXhVqfQY3ik9oadsnPHJANNMbT3NMPCu5yhwLEQ1dh0ZRvi7LqTE8APKLP5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab8d7fbd040bc29862e00bccae37aa4038372fabe398e77e3061d2986b54d02","last_reissued_at":"2026-05-18T04:14:28.187215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:28.187215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5949","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-18T04:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3qVuL9VhjYVzk8hk9AW/jhktNfTyZU5qSBHSxrYDRtWx5oG4lLC+Izoe0Cdy919Mrv37zUNIbd0CczvSf2DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:42:57.675556Z"},"content_sha256":"1bd77c69dbfd2e245406b55e7efc505035356ccab7c44eac6095e2b5907e3493","schema_version":"1.0","event_id":"sha256:1bd77c69dbfd2e245406b55e7efc505035356ccab7c44eac6095e2b5907e3493"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7K4NP66QIC6CTBROAC6MVY32UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equality in a Linear Vizing-Like Relation that Relates the Size and Total Domination Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ernst J. Joubert, Michael A. Henning","submitted_at":"2011-08-30T12:54:07Z","abstract_excerpt":"Let $G$ be a graph each component of which has order at least 3, and let $G$ have order $n$, size $m$, total domination number $\\gamma_t$ and maximum degree $\\Delta(G)$. Let $\\Delta = 3$ if $\\Delta(G) = 2$ and $\\Delta = \\Delta (G)$ if $\\Delta(G) \\ge 3$. It is known [J. Graph Theory 49 (2005), 285--290; J. Graph Theory 54 (2007), 350--353] that $m \\le \\Delta (n- \\gamma_t)$. In this paper we characterize the extremal graphs $G$ satisfying $m = \\Delta (n- \\gamma_t)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5949","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-18T04:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhKPf9cA0C5xqmMhjOpH0dXkRwoQF465yf0Rrm3UsCBAgLaFGqxEuZPJKhNRUf2ks79OFiFRmz3sgVHCHPRKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:42:57.676331Z"},"content_sha256":"4ca568f4c1367d57eb29f780031550fadd32527127fe2022d76452b77a215d5d","schema_version":"1.0","event_id":"sha256:4ca568f4c1367d57eb29f780031550fadd32527127fe2022d76452b77a215d5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7K4NP66QIC6CTBROAC6MVY32UQ/bundle.json","state_url":"https://pith.science/pith/7K4NP66QIC6CTBROAC6MVY32UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7K4NP66QIC6CTBROAC6MVY32UQ/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-11T02:42:57Z","links":{"resolver":"https://pith.science/pith/7K4NP66QIC6CTBROAC6MVY32UQ","bundle":"https://pith.science/pith/7K4NP66QIC6CTBROAC6MVY32UQ/bundle.json","state":"https://pith.science/pith/7K4NP66QIC6CTBROAC6MVY32UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7K4NP66QIC6CTBROAC6MVY32UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7K4NP66QIC6CTBROAC6MVY32UQ","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":"566a30eb8b343bc32b19d87a5901d4f2ddc0fa582bd3e6c2c0c4a7e552708b9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-30T12:54:07Z","title_canon_sha256":"125634e37635fbf74ce201f873e68a542f6a628dfb8807e3017c5fa28dbae58d"},"schema_version":"1.0","source":{"id":"1108.5949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5949","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5949v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5949","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"7K4NP66QIC6C","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7K4NP66QIC6CTBRO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7K4NP66Q","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:4ca568f4c1367d57eb29f780031550fadd32527127fe2022d76452b77a215d5d","target":"graph","created_at":"2026-05-18T04:14:28Z","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 each component of which has order at least 3, and let $G$ have order $n$, size $m$, total domination number $\\gamma_t$ and maximum degree $\\Delta(G)$. Let $\\Delta = 3$ if $\\Delta(G) = 2$ and $\\Delta = \\Delta (G)$ if $\\Delta(G) \\ge 3$. It is known [J. Graph Theory 49 (2005), 285--290; J. Graph Theory 54 (2007), 350--353] that $m \\le \\Delta (n- \\gamma_t)$. In this paper we characterize the extremal graphs $G$ satisfying $m = \\Delta (n- \\gamma_t)$.","authors_text":"Ernst J. Joubert, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-30T12:54:07Z","title":"Equality in a Linear Vizing-Like Relation that Relates the Size and Total Domination Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5949","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:1bd77c69dbfd2e245406b55e7efc505035356ccab7c44eac6095e2b5907e3493","target":"record","created_at":"2026-05-18T04:14:28Z","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":"566a30eb8b343bc32b19d87a5901d4f2ddc0fa582bd3e6c2c0c4a7e552708b9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-30T12:54:07Z","title_canon_sha256":"125634e37635fbf74ce201f873e68a542f6a628dfb8807e3017c5fa28dbae58d"},"schema_version":"1.0","source":{"id":"1108.5949","kind":"arxiv","version":1}},"canonical_sha256":"fab8d7fbd040bc29862e00bccae37aa4038372fabe398e77e3061d2986b54d02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fab8d7fbd040bc29862e00bccae37aa4038372fabe398e77e3061d2986b54d02","first_computed_at":"2026-05-18T04:14:28.187215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:28.187215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fhb1fZjwqMjTUJlM7R/aJtOM6QXhVqfQY3ik9oadsnPHJANNMbT3NMPCu5yhwLEQ1dh0ZRvi7LqTE8APKLP5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:28.188387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bd77c69dbfd2e245406b55e7efc505035356ccab7c44eac6095e2b5907e3493","sha256:4ca568f4c1367d57eb29f780031550fadd32527127fe2022d76452b77a215d5d"],"state_sha256":"945d5bee20b37b8b062de5a44830627da7197be1fc5ebc219903432dd00a5b81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgiriANV+t4ee05nwCwgvApTEOhO3c8Kcu17czolBn+3rRiZ+Ca2GWPUUKi0sbfHhrqEhnCaWsdsMkFXVpkcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:42:57.680058Z","bundle_sha256":"114c79731f29accb0d69cf6046683d1e8445191b9047f3e39a3f4db57ec24ed0"}}