{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PVUIQTTA3COLOAJZ5VMDFJUG3D","short_pith_number":"pith:PVUIQTTA","schema_version":"1.0","canonical_sha256":"7d68884e60d89cb70139ed5832a686d8c23a92a351af9472ff04a0d477f95673","source":{"kind":"arxiv","id":"1608.06804","version":1},"attestation_state":"computed","paper":{"title":"Total dominating sequences in trees, split graphs, and under modular decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Graciela Nasini, Pablo Torres, Tim Kos","submitted_at":"2016-08-24T13:33:49Z","abstract_excerpt":"A sequence of vertices in a graph $G$ with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices in the sequence, and, at the end all vertices of $G$ are totally dominated (by definition a vertex totally dominates its neighbors). The maximum length of a total dominating sequence is called the Grundy total domination number, $\\gamma_{\\rm gr}^t(G)$, of $G$, as introduced in [B. Bre\\v{s}ar, M.A. Henning, and D. F. Rall, Total dominating sequences in graphs, Discrete Math"},"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":"1608.06804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T13:33:49Z","cross_cats_sorted":[],"title_canon_sha256":"40419df66b8eb567f0962abd41f18a7748ee096766d6154f8365024f9d4694b5","abstract_canon_sha256":"fdd4cfaf0608fbad7b175a19970837dade729a54fc84f26bdd7e88bf525457d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:57.471585Z","signature_b64":"xNDgqKS9e67c1jh9tsgAoqYJ7rQq4p71KAinydFcbpgsYLly/hKMepttNdFyt6Egue3c8kTFf5KLphBMwz4tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d68884e60d89cb70139ed5832a686d8c23a92a351af9472ff04a0d477f95673","last_reissued_at":"2026-05-18T01:07:57.470953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:57.470953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total dominating sequences in trees, split graphs, and under modular decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Graciela Nasini, Pablo Torres, Tim Kos","submitted_at":"2016-08-24T13:33:49Z","abstract_excerpt":"A sequence of vertices in a graph $G$ with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices in the sequence, and, at the end all vertices of $G$ are totally dominated (by definition a vertex totally dominates its neighbors). The maximum length of a total dominating sequence is called the Grundy total domination number, $\\gamma_{\\rm gr}^t(G)$, of $G$, as introduced in [B. Bre\\v{s}ar, M.A. Henning, and D. F. Rall, Total dominating sequences in graphs, Discrete Math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06804","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":"1608.06804","created_at":"2026-05-18T01:07:57.471033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06804v1","created_at":"2026-05-18T01:07:57.471033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06804","created_at":"2026-05-18T01:07:57.471033+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVUIQTTA3COL","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVUIQTTA3COLOAJZ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVUIQTTA","created_at":"2026-05-18T12:30:39.010887+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/PVUIQTTA3COLOAJZ5VMDFJUG3D","json":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D.json","graph_json":"https://pith.science/api/pith-number/PVUIQTTA3COLOAJZ5VMDFJUG3D/graph.json","events_json":"https://pith.science/api/pith-number/PVUIQTTA3COLOAJZ5VMDFJUG3D/events.json","paper":"https://pith.science/paper/PVUIQTTA"},"agent_actions":{"view_html":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D","download_json":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D.json","view_paper":"https://pith.science/paper/PVUIQTTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06804&json=true","fetch_graph":"https://pith.science/api/pith-number/PVUIQTTA3COLOAJZ5VMDFJUG3D/graph.json","fetch_events":"https://pith.science/api/pith-number/PVUIQTTA3COLOAJZ5VMDFJUG3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/action/storage_attestation","attest_author":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/action/author_attestation","sign_citation":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/action/citation_signature","submit_replication":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/action/replication_record"}},"created_at":"2026-05-18T01:07:57.471033+00:00","updated_at":"2026-05-18T01:07:57.471033+00:00"}