{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7CPDV6SLFPUWXHFNYOMJQWWE2P","short_pith_number":"pith:7CPDV6SL","schema_version":"1.0","canonical_sha256":"f89e3afa4b2be96b9cadc398985ac4d3d85e19244f7628d7a97dec2aee879ca6","source":{"kind":"arxiv","id":"1601.07525","version":1},"attestation_state":"computed","paper":{"title":"Total Dominating Sequences in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bostjan Bresar, Douglas F. Rall, Michael A. Henning","submitted_at":"2016-01-27T20:13:32Z","abstract_excerpt":"A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes $v$ in the sequence, and at the end all vertices of $G$ are totally dominated. While the length of a shortest such sequence is the total domination number of $G$, in this paper we investigate total dominating sequences of maximum length, which we call the Grundy total domination number, $\\gamma_{\\rm gr}^t(G)$, of $"},"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":"1601.07525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-27T20:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"af734c0ef950ee632b109e97324351c6ca7e213dd1500984fb29e4cb69a3190c","abstract_canon_sha256":"6fbc4c0d73ac396f2fa9735cf50a6b678af73ace48e542f4aeead905e9d5aabd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:45.681703Z","signature_b64":"hSOVCwD6HbNmwZUXiuhMarmP9lQfi0NjiVYU6TmUpPazZFhvyRrmfgCEMHjsLHgJoRowAKgj3+BDUZYKShOnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f89e3afa4b2be96b9cadc398985ac4d3d85e19244f7628d7a97dec2aee879ca6","last_reissued_at":"2026-05-18T01:21:45.680962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:45.680962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total Dominating Sequences in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bostjan Bresar, Douglas F. Rall, Michael A. Henning","submitted_at":"2016-01-27T20:13:32Z","abstract_excerpt":"A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes $v$ in the sequence, and at the end all vertices of $G$ are totally dominated. While the length of a shortest such sequence is the total domination number of $G$, in this paper we investigate total dominating sequences of maximum length, which we call the Grundy total domination number, $\\gamma_{\\rm gr}^t(G)$, of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07525","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":"1601.07525","created_at":"2026-05-18T01:21:45.681090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07525v1","created_at":"2026-05-18T01:21:45.681090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07525","created_at":"2026-05-18T01:21:45.681090+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CPDV6SLFPUW","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CPDV6SLFPUWXHFN","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CPDV6SL","created_at":"2026-05-18T12:30:04.600751+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/7CPDV6SLFPUWXHFNYOMJQWWE2P","json":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P.json","graph_json":"https://pith.science/api/pith-number/7CPDV6SLFPUWXHFNYOMJQWWE2P/graph.json","events_json":"https://pith.science/api/pith-number/7CPDV6SLFPUWXHFNYOMJQWWE2P/events.json","paper":"https://pith.science/paper/7CPDV6SL"},"agent_actions":{"view_html":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P","download_json":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P.json","view_paper":"https://pith.science/paper/7CPDV6SL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07525&json=true","fetch_graph":"https://pith.science/api/pith-number/7CPDV6SLFPUWXHFNYOMJQWWE2P/graph.json","fetch_events":"https://pith.science/api/pith-number/7CPDV6SLFPUWXHFNYOMJQWWE2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P/action/storage_attestation","attest_author":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P/action/author_attestation","sign_citation":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P/action/citation_signature","submit_replication":"https://pith.science/pith/7CPDV6SLFPUWXHFNYOMJQWWE2P/action/replication_record"}},"created_at":"2026-05-18T01:21:45.681090+00:00","updated_at":"2026-05-18T01:21:45.681090+00:00"}