{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AHHU37U443NQUQCSK5OC7W4LXE","short_pith_number":"pith:AHHU37U4","canonical_record":{"source":{"id":"1811.12360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-29T18:11:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a8e9f0ff32a78f2af6e45e8143519bfaf0bfcca5fa64210d2e5d061101fd7875","abstract_canon_sha256":"93dd102ab24edb9efd4613cd9f7274e30f97a118e50c03180d45afc845b1fbc6"},"schema_version":"1.0"},"canonical_sha256":"01cf4dfe9ce6db0a4052575c2fdb8bb90b1c2129e1cb083a25101aede889427b","source":{"kind":"arxiv","id":"1811.12360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12360","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12360v1","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12360","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"AHHU37U443NQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AHHU37U443NQUQCS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AHHU37U4","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AHHU37U443NQUQCSK5OC7W4LXE","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-29T18:11:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a8e9f0ff32a78f2af6e45e8143519bfaf0bfcca5fa64210d2e5d061101fd7875","abstract_canon_sha256":"93dd102ab24edb9efd4613cd9f7274e30f97a118e50c03180d45afc845b1fbc6"},"schema_version":"1.0"},"canonical_sha256":"01cf4dfe9ce6db0a4052575c2fdb8bb90b1c2129e1cb083a25101aede889427b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:33.714579Z","signature_b64":"oqKI2e44nXXABxVbVr1Ohfr+IvAVf1yS1WIumxzdxR1yKqjqAbIA9TbIlDMKBNRMUuT4gGI3wIZ/PRgmiTLsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01cf4dfe9ce6db0a4052575c2fdb8bb90b1c2129e1cb083a25101aede889427b","last_reissued_at":"2026-05-17T23:59:33.713919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:33.713919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12360","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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXk1cN8qymw2z9sjPthm41Ct42ZWJoAvUAMElcf9WXuFXp5D6QvS/BMyGsDEsAmBKma/9vrO6yCGLjsdY86fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:59:25.723440Z"},"content_sha256":"832d6451bf18a808476afbd650585e05914a9ad7a2dc9ebb9328b4c7b78b7c79","schema_version":"1.0","event_id":"sha256:832d6451bf18a808476afbd650585e05914a9ad7a2dc9ebb9328b4c7b78b7c79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AHHU37U443NQUQCSK5OC7W4LXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The polytope of legal sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Daniel Sever\\'in, Manoel Camp\\^elo","submitted_at":"2018-11-29T18:11:35Z","abstract_excerpt":"A sequence of vertices in a graph is called a \\emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those ones that precede it, and at the end all vertices of the graph are (totally) dominated. The \\emph{Grundy (total) domination number} of a graph is the size of the largest (total) legal dominating sequence. In this work, we address the problems of determining these two parameters by introducing a generalized version of them. We explicitly calculate the corresponding (general) parameter for paths and web graphs. We prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12360","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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+om8Z9OcZem9P6HIW0/gcY40QNERPQ4XByg6TJlPMIDf/VaHwgJtulR1DM+Ju55/XaYQTENt5QqR5feTkohJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:59:25.723783Z"},"content_sha256":"fb15b24ce32d72d1f8051f63847e217be9b1cf81d0bbe9b8daef70da08780a28","schema_version":"1.0","event_id":"sha256:fb15b24ce32d72d1f8051f63847e217be9b1cf81d0bbe9b8daef70da08780a28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHHU37U443NQUQCSK5OC7W4LXE/bundle.json","state_url":"https://pith.science/pith/AHHU37U443NQUQCSK5OC7W4LXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHHU37U443NQUQCSK5OC7W4LXE/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-27T14:59:25Z","links":{"resolver":"https://pith.science/pith/AHHU37U443NQUQCSK5OC7W4LXE","bundle":"https://pith.science/pith/AHHU37U443NQUQCSK5OC7W4LXE/bundle.json","state":"https://pith.science/pith/AHHU37U443NQUQCSK5OC7W4LXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHHU37U443NQUQCSK5OC7W4LXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AHHU37U443NQUQCSK5OC7W4LXE","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":"93dd102ab24edb9efd4613cd9f7274e30f97a118e50c03180d45afc845b1fbc6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-29T18:11:35Z","title_canon_sha256":"a8e9f0ff32a78f2af6e45e8143519bfaf0bfcca5fa64210d2e5d061101fd7875"},"schema_version":"1.0","source":{"id":"1811.12360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12360","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12360v1","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12360","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"AHHU37U443NQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AHHU37U443NQUQCS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AHHU37U4","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:fb15b24ce32d72d1f8051f63847e217be9b1cf81d0bbe9b8daef70da08780a28","target":"graph","created_at":"2026-05-17T23:59:33Z","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 is called a \\emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those ones that precede it, and at the end all vertices of the graph are (totally) dominated. The \\emph{Grundy (total) domination number} of a graph is the size of the largest (total) legal dominating sequence. In this work, we address the problems of determining these two parameters by introducing a generalized version of them. We explicitly calculate the corresponding (general) parameter for paths and web graphs. We prop","authors_text":"Daniel Sever\\'in, Manoel Camp\\^elo","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-29T18:11:35Z","title":"The polytope of legal sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12360","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:832d6451bf18a808476afbd650585e05914a9ad7a2dc9ebb9328b4c7b78b7c79","target":"record","created_at":"2026-05-17T23:59:33Z","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":"93dd102ab24edb9efd4613cd9f7274e30f97a118e50c03180d45afc845b1fbc6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-29T18:11:35Z","title_canon_sha256":"a8e9f0ff32a78f2af6e45e8143519bfaf0bfcca5fa64210d2e5d061101fd7875"},"schema_version":"1.0","source":{"id":"1811.12360","kind":"arxiv","version":1}},"canonical_sha256":"01cf4dfe9ce6db0a4052575c2fdb8bb90b1c2129e1cb083a25101aede889427b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01cf4dfe9ce6db0a4052575c2fdb8bb90b1c2129e1cb083a25101aede889427b","first_computed_at":"2026-05-17T23:59:33.713919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:33.713919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oqKI2e44nXXABxVbVr1Ohfr+IvAVf1yS1WIumxzdxR1yKqjqAbIA9TbIlDMKBNRMUuT4gGI3wIZ/PRgmiTLsAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:33.714579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:832d6451bf18a808476afbd650585e05914a9ad7a2dc9ebb9328b4c7b78b7c79","sha256:fb15b24ce32d72d1f8051f63847e217be9b1cf81d0bbe9b8daef70da08780a28"],"state_sha256":"3ebd6ad5600865c99b8afbcaa8fc8b6cda9d65ada94a39fdde16c435824c4f08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lS3DLOz8VNFJmShzZVQzdJsfmGjzh7GQ4aiYXTouBQm8bgNp6WbKJeRv5ixRt/9Zk9dAMV76lGjaterWsxnDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:59:25.725680Z","bundle_sha256":"39cd33005b9c5797e7718bb88ca4e34773008013e57b2f01c656a3ad8da108e9"}}