{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XPDLE6RUVJEHMZ7TNBFCPQ2LXO","short_pith_number":"pith:XPDLE6RU","schema_version":"1.0","canonical_sha256":"bbc6b27a34aa487667f3684a27c34bbb8de9ba726e076c28f4b480aecee4d1f8","source":{"kind":"arxiv","id":"1512.04748","version":1},"attestation_state":"computed","paper":{"title":"Cubic Graphs with Total Domatic Number at Least Two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mohammad Motiei, Sahand Mozaffari, Saieed Akbari, Sina Yazdanbod","submitted_at":"2015-12-15T12:10:26Z","abstract_excerpt":"Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of $G$. In this paper we would like to characterize the cubic graphs with total domatic number at least two."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.04748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T12:10:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3272932cb0f67d21a3f9d8e1b358035e0df9d5bd8c392b88c23203b09febb26b","abstract_canon_sha256":"3ed927caa9cc64a1ed0efbe98d218057dcc6170ea11b56749d6067e1fa731ebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:15.675102Z","signature_b64":"csTf7iQLl98GqN7WjgY/Y5Fg9GgGrZJA6WvNYvZiPhImuqHNGg/p0QRsf+AYIIw4K5PDN6L9WNMslmMiVFYvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbc6b27a34aa487667f3684a27c34bbb8de9ba726e076c28f4b480aecee4d1f8","last_reissued_at":"2026-05-18T01:24:15.674445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:15.674445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cubic Graphs with Total Domatic Number at Least Two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mohammad Motiei, Sahand Mozaffari, Saieed Akbari, Sina Yazdanbod","submitted_at":"2015-12-15T12:10:26Z","abstract_excerpt":"Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of $G$. In this paper we would like to characterize the cubic graphs with total domatic number at least two."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04748","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.04748","created_at":"2026-05-18T01:24:15.674561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04748v1","created_at":"2026-05-18T01:24:15.674561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04748","created_at":"2026-05-18T01:24:15.674561+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPDLE6RUVJEH","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPDLE6RUVJEHMZ7T","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPDLE6RU","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO","json":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO.json","graph_json":"https://pith.science/api/pith-number/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/graph.json","events_json":"https://pith.science/api/pith-number/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/events.json","paper":"https://pith.science/paper/XPDLE6RU"},"agent_actions":{"view_html":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO","download_json":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO.json","view_paper":"https://pith.science/paper/XPDLE6RU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04748&json=true","fetch_graph":"https://pith.science/api/pith-number/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/graph.json","fetch_events":"https://pith.science/api/pith-number/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/action/storage_attestation","attest_author":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/action/author_attestation","sign_citation":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/action/citation_signature","submit_replication":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/action/replication_record"}},"created_at":"2026-05-18T01:24:15.674561+00:00","updated_at":"2026-05-18T01:24:15.674561+00:00"}