{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PVUIQTTA3COLOAJZ5VMDFJUG3D","short_pith_number":"pith:PVUIQTTA","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"},"canonical_sha256":"7d68884e60d89cb70139ed5832a686d8c23a92a351af9472ff04a0d477f95673","source":{"kind":"arxiv","id":"1608.06804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06804","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06804v1","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06804","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"PVUIQTTA3COL","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PVUIQTTA3COLOAJZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PVUIQTTA","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PVUIQTTA3COLOAJZ5VMDFJUG3D","target":"record","payload":{"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"},"canonical_sha256":"7d68884e60d89cb70139ed5832a686d8c23a92a351af9472ff04a0d477f95673","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"},"source_kind":"arxiv","source_id":"1608.06804","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:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsAhi+WhBIGJetwLlmJICr8a9prLljeE1Qzn7KsxZbOwxZD0pc2Hm2M9lv7qZtLfeL4kE4bSIpHwNLNGSjqbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:28:46.980391Z"},"content_sha256":"e40ce23a5a520ea945c8110261167195c42a7423c0e3e6b69f7fc16ca187fe70","schema_version":"1.0","event_id":"sha256:e40ce23a5a520ea945c8110261167195c42a7423c0e3e6b69f7fc16ca187fe70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PVUIQTTA3COLOAJZ5VMDFJUG3D","target":"graph","payload":{"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"},"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:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8jPz9B0kyx7/x6IJ5LZcmnPIwwXEFwIPSgLiITnFJiAkpDjTP/slmvYDvx+CsZnWgl4fqTWmWp1EQlK+kFEtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:28:46.980750Z"},"content_sha256":"fdf470730cfd583b5e1b4f721cbcb6d273a5ec1a98f4142553ee0c36489181e0","schema_version":"1.0","event_id":"sha256:fdf470730cfd583b5e1b4f721cbcb6d273a5ec1a98f4142553ee0c36489181e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/bundle.json","state_url":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/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-05-30T09:28:46Z","links":{"resolver":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D","bundle":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/bundle.json","state":"https://pith.science/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVUIQTTA3COLOAJZ5VMDFJUG3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PVUIQTTA3COLOAJZ5VMDFJUG3D","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":"fdd4cfaf0608fbad7b175a19970837dade729a54fc84f26bdd7e88bf525457d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T13:33:49Z","title_canon_sha256":"40419df66b8eb567f0962abd41f18a7748ee096766d6154f8365024f9d4694b5"},"schema_version":"1.0","source":{"id":"1608.06804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06804","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06804v1","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06804","created_at":"2026-05-18T01:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"PVUIQTTA3COL","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PVUIQTTA3COLOAJZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PVUIQTTA","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:fdf470730cfd583b5e1b4f721cbcb6d273a5ec1a98f4142553ee0c36489181e0","target":"graph","created_at":"2026-05-18T01:07:57Z","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":"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","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Graciela Nasini, Pablo Torres, Tim Kos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T13:33:49Z","title":"Total dominating sequences in trees, split graphs, and under modular decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06804","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:e40ce23a5a520ea945c8110261167195c42a7423c0e3e6b69f7fc16ca187fe70","target":"record","created_at":"2026-05-18T01:07:57Z","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":"fdd4cfaf0608fbad7b175a19970837dade729a54fc84f26bdd7e88bf525457d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T13:33:49Z","title_canon_sha256":"40419df66b8eb567f0962abd41f18a7748ee096766d6154f8365024f9d4694b5"},"schema_version":"1.0","source":{"id":"1608.06804","kind":"arxiv","version":1}},"canonical_sha256":"7d68884e60d89cb70139ed5832a686d8c23a92a351af9472ff04a0d477f95673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d68884e60d89cb70139ed5832a686d8c23a92a351af9472ff04a0d477f95673","first_computed_at":"2026-05-18T01:07:57.470953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:57.470953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xNDgqKS9e67c1jh9tsgAoqYJ7rQq4p71KAinydFcbpgsYLly/hKMepttNdFyt6Egue3c8kTFf5KLphBMwz4tBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:57.471585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e40ce23a5a520ea945c8110261167195c42a7423c0e3e6b69f7fc16ca187fe70","sha256:fdf470730cfd583b5e1b4f721cbcb6d273a5ec1a98f4142553ee0c36489181e0"],"state_sha256":"58c2b9b6171cc4ba23afc79945aff24599ffda695ca38c48553354ccee344ba2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WV7wu6/yuBvMM0L/ERuvKR6hKfZ0DSDNrVSvwSKHbd/Vb22l3KxaV7kjk5sXUFCzyIUd3ALMlQaSNhDppSe1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:28:46.982757Z","bundle_sha256":"eb3fdd56bd235321ade8d4c90b5a7a6476098f180e30e11dbc469e4c00c8fd59"}}