{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XPDLE6RUVJEHMZ7TNBFCPQ2LXO","short_pith_number":"pith:XPDLE6RU","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"},"canonical_sha256":"bbc6b27a34aa487667f3684a27c34bbb8de9ba726e076c28f4b480aecee4d1f8","source":{"kind":"arxiv","id":"1512.04748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04748","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04748v1","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04748","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"XPDLE6RUVJEH","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XPDLE6RUVJEHMZ7T","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XPDLE6RU","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XPDLE6RUVJEHMZ7TNBFCPQ2LXO","target":"record","payload":{"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"},"canonical_sha256":"bbc6b27a34aa487667f3684a27c34bbb8de9ba726e076c28f4b480aecee4d1f8","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"},"source_kind":"arxiv","source_id":"1512.04748","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-18T01:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZTV8EBfSxu+DdE+/6SiPumUzrf4wl9zeLEvBKIr+X309YYRnIqgNyx/Pbl+6S4g3jfLtA9/leq++ZHA4t14CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:45:53.421493Z"},"content_sha256":"ff96c132a3d87b1264ae093174b74b3216d28701ebda574e7266917c451ffc40","schema_version":"1.0","event_id":"sha256:ff96c132a3d87b1264ae093174b74b3216d28701ebda574e7266917c451ffc40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XPDLE6RUVJEHMZ7TNBFCPQ2LXO","target":"graph","payload":{"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"},"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-18T01:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8CfBBEFktBvWu3SeDSuP1aq6LhN+CM2thNJBk4xWl9V7CXy9WpSxF2twPtjd2P13Bu0co58gO3vDs6fd2MLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:45:53.421855Z"},"content_sha256":"fde10ada6ce26ec4b88cc3683dd0121678ef522af6ad24dd2569642ef64cf3df","schema_version":"1.0","event_id":"sha256:fde10ada6ce26ec4b88cc3683dd0121678ef522af6ad24dd2569642ef64cf3df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/bundle.json","state_url":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/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-05T00:45:53Z","links":{"resolver":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO","bundle":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/bundle.json","state":"https://pith.science/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPDLE6RUVJEHMZ7TNBFCPQ2LXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XPDLE6RUVJEHMZ7TNBFCPQ2LXO","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":"3ed927caa9cc64a1ed0efbe98d218057dcc6170ea11b56749d6067e1fa731ebe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T12:10:26Z","title_canon_sha256":"3272932cb0f67d21a3f9d8e1b358035e0df9d5bd8c392b88c23203b09febb26b"},"schema_version":"1.0","source":{"id":"1512.04748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04748","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04748v1","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04748","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"XPDLE6RUVJEH","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XPDLE6RUVJEHMZ7T","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XPDLE6RU","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:fde10ada6ce26ec4b88cc3683dd0121678ef522af6ad24dd2569642ef64cf3df","target":"graph","created_at":"2026-05-18T01:24:15Z","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 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.","authors_text":"Mohammad Motiei, Sahand Mozaffari, Saieed Akbari, Sina Yazdanbod","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T12:10:26Z","title":"Cubic Graphs with Total Domatic Number at Least Two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04748","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:ff96c132a3d87b1264ae093174b74b3216d28701ebda574e7266917c451ffc40","target":"record","created_at":"2026-05-18T01:24:15Z","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":"3ed927caa9cc64a1ed0efbe98d218057dcc6170ea11b56749d6067e1fa731ebe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T12:10:26Z","title_canon_sha256":"3272932cb0f67d21a3f9d8e1b358035e0df9d5bd8c392b88c23203b09febb26b"},"schema_version":"1.0","source":{"id":"1512.04748","kind":"arxiv","version":1}},"canonical_sha256":"bbc6b27a34aa487667f3684a27c34bbb8de9ba726e076c28f4b480aecee4d1f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbc6b27a34aa487667f3684a27c34bbb8de9ba726e076c28f4b480aecee4d1f8","first_computed_at":"2026-05-18T01:24:15.674445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:15.674445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"csTf7iQLl98GqN7WjgY/Y5Fg9GgGrZJA6WvNYvZiPhImuqHNGg/p0QRsf+AYIIw4K5PDN6L9WNMslmMiVFYvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:15.675102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff96c132a3d87b1264ae093174b74b3216d28701ebda574e7266917c451ffc40","sha256:fde10ada6ce26ec4b88cc3683dd0121678ef522af6ad24dd2569642ef64cf3df"],"state_sha256":"40a5fd4c0257f8093b03962a4cf853a161d2a4d8b0fbd1f3e361a9ded931a8f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFMYv2AInTe9tlcazil3YnMURNHXRPFJgpU4XoqLDwOb+4wgFsdseZT2uFzsK5Ml0MMtvQkam7H61LbEJnDTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:45:53.423815Z","bundle_sha256":"664391ee0e14c519099a3c9867b7206e1a1e7d55cea89ab314a8e882570d7cae"}}