{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LORQ6AEZEPECDXIKOIGGM745FM","short_pith_number":"pith:LORQ6AEZ","canonical_record":{"source":{"id":"1412.8203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T19:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"296a49a89aa9ef3bd68f98f0aecf33601bd6d1af24a0cdd2465b92ab3be68501","abstract_canon_sha256":"b82524e5903dfaf4be92672fd79e4ac978c600707a7945766f0d78e3570de444"},"schema_version":"1.0"},"canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","source":{"kind":"arxiv","id":"1412.8203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8203","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8203v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8203","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"LORQ6AEZEPEC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LORQ6AEZEPECDXIK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LORQ6AEZ","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LORQ6AEZEPECDXIKOIGGM745FM","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T19:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"296a49a89aa9ef3bd68f98f0aecf33601bd6d1af24a0cdd2465b92ab3be68501","abstract_canon_sha256":"b82524e5903dfaf4be92672fd79e4ac978c600707a7945766f0d78e3570de444"},"schema_version":"1.0"},"canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.832310Z","signature_b64":"e4lXLgDCpwHMPacbMsnmZP6HNpT75++FizTW1SQlIFyhj/Bhax45Sdfc0gD7csr5ULoWBjdqzqaUV/C707AkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","last_reissued_at":"2026-05-18T02:30:23.831538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.831538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8203","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:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jI4gl47pCyK8l+ovTda891H5bLDNS5ABy0HEbT89FGYvjy5pTYYrHCWsyjTpBBak6uaFC5ZqbPyiM262pTvCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:57:25.722535Z"},"content_sha256":"6ec2045744ea004a1c10cf440abc40741c41489b37328a203c2f4cc9f05d1109","schema_version":"1.0","event_id":"sha256:6ec2045744ea004a1c10cf440abc40741c41489b37328a203c2f4cc9f05d1109"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LORQ6AEZEPECDXIKOIGGM745FM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Upper Bound on Total Domination Number of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Shameli, Hadi Yami, Pooyan Ehsani, Sahar Qajar, Saieed Akbari","submitted_at":"2014-12-28T19:48:36Z","abstract_excerpt":"Let $ G $ be a graph. A subset $S \\subseteq V(G) $ is called a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $S$. The total domination number, $\\gamma_{t}$($G$), is the minimum cardinality of a total dominating set of $G$. In this paper using a greedy algorithm we provide an upper bound for $\\gamma_{t}$($G$), whenever $G$ is a bipartite graph and $\\delta(G)$ $\\geq$ $k$. More precisely, we show that if $k$ > 1 is a natural number, then for every bipartite graph $G$ of order $n$ and $\\delta(G) \\ge k$, $ $$\\gamma_{t}$($G$) $\\leq$ $n(1- \\frac{k!}{\\prod_{i=0}^{k-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8203","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:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVpbFN7n4DwnWt8vAw9i2roj/GqxFX3SC9I7ElkjGcnkOqZ98gymqC2A/1qH/mYQd5ZSvJMh8aXSB4OhJjmvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:57:25.723125Z"},"content_sha256":"0a5d4c9dc24b6de54d46a6cc6d0728fd227555fa203e83680a5936437f4e789f","schema_version":"1.0","event_id":"sha256:0a5d4c9dc24b6de54d46a6cc6d0728fd227555fa203e83680a5936437f4e789f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/bundle.json","state_url":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LORQ6AEZEPECDXIKOIGGM745FM/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-05T01:57:25Z","links":{"resolver":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM","bundle":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/bundle.json","state":"https://pith.science/pith/LORQ6AEZEPECDXIKOIGGM745FM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LORQ6AEZEPECDXIKOIGGM745FM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LORQ6AEZEPECDXIKOIGGM745FM","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":"b82524e5903dfaf4be92672fd79e4ac978c600707a7945766f0d78e3570de444","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T19:48:36Z","title_canon_sha256":"296a49a89aa9ef3bd68f98f0aecf33601bd6d1af24a0cdd2465b92ab3be68501"},"schema_version":"1.0","source":{"id":"1412.8203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8203","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8203v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8203","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"LORQ6AEZEPEC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LORQ6AEZEPECDXIK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LORQ6AEZ","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:0a5d4c9dc24b6de54d46a6cc6d0728fd227555fa203e83680a5936437f4e789f","target":"graph","created_at":"2026-05-18T02:30:23Z","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. A subset $S \\subseteq V(G) $ is called a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $S$. The total domination number, $\\gamma_{t}$($G$), is the minimum cardinality of a total dominating set of $G$. In this paper using a greedy algorithm we provide an upper bound for $\\gamma_{t}$($G$), whenever $G$ is a bipartite graph and $\\delta(G)$ $\\geq$ $k$. More precisely, we show that if $k$ > 1 is a natural number, then for every bipartite graph $G$ of order $n$ and $\\delta(G) \\ge k$, $ $$\\gamma_{t}$($G$) $\\leq$ $n(1- \\frac{k!}{\\prod_{i=0}^{k-","authors_text":"Ali Shameli, Hadi Yami, Pooyan Ehsani, Sahar Qajar, Saieed Akbari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T19:48:36Z","title":"A New Upper Bound on Total Domination Number of Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8203","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:6ec2045744ea004a1c10cf440abc40741c41489b37328a203c2f4cc9f05d1109","target":"record","created_at":"2026-05-18T02:30:23Z","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":"b82524e5903dfaf4be92672fd79e4ac978c600707a7945766f0d78e3570de444","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T19:48:36Z","title_canon_sha256":"296a49a89aa9ef3bd68f98f0aecf33601bd6d1af24a0cdd2465b92ab3be68501"},"schema_version":"1.0","source":{"id":"1412.8203","kind":"arxiv","version":1}},"canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ba30f009923c821dd0a720c667f9d2b14f0fd2e422126bd5f5d73a0e692784b","first_computed_at":"2026-05-18T02:30:23.831538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:23.831538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e4lXLgDCpwHMPacbMsnmZP6HNpT75++FizTW1SQlIFyhj/Bhax45Sdfc0gD7csr5ULoWBjdqzqaUV/C707AkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:23.832310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ec2045744ea004a1c10cf440abc40741c41489b37328a203c2f4cc9f05d1109","sha256:0a5d4c9dc24b6de54d46a6cc6d0728fd227555fa203e83680a5936437f4e789f"],"state_sha256":"eb09caa1db5026110bc9c3ef9f11785662213691ba1e00e4563f338adcf37947"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gpL/VQ6w8AHFs/nMSNI/25ShSdGSy1h9M4b30GJ51o/q0HVy2hGOBBXGv13+1kST8VHbqZUahJpQk0+T9RKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:57:25.726484Z","bundle_sha256":"2083249a96e591b0fa7e1f39cedb3e2c73bce709f2fc930e2a7daecce43c638a"}}