{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CV7UWV2YGOCSMNDWSBDEEASFYN","short_pith_number":"pith:CV7UWV2Y","schema_version":"1.0","canonical_sha256":"157f4b575833852634769046420245c3797f7ae527d2e429bc5475aa5b722616","source":{"kind":"arxiv","id":"1810.02737","version":1},"attestation_state":"computed","paper":{"title":"Grundy dominating sequences on $X$-join product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Graciela Nasini, Pablo Torres","submitted_at":"2018-10-05T15:05:34Z","abstract_excerpt":"In this paper we study the Grundy domination number on the $X$-join product $G\\hookleftarrow \\mathcal R$ of a graph $G$ and a family of graphs $\\mathcal R=\\{G_v: v\\in V(G)\\}$. The results led us to extend the few known families of graphs where this parameter can be efficiently computed. We prove that if, for all $v\\in V(G)$, the Grundy domination number of $G_v$ is given, and $G$ is a power of a cycle, a power of a path, or a split graph, computing the Grundy domination number of $G\\hookleftarrow \\mathcal R$ can be done in polynomial time. In particular, the results for power of cycles and pat"},"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":"1810.02737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-05T15:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"a7fb773e3eae929a274da3e54a4dadcb18375005b6785d148328a856932ee0cf","abstract_canon_sha256":"ccbf28e9bca8bd8d8bdcce85553799c5073b501bc37a00f3f6ceedb511d3ba63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:00.794054Z","signature_b64":"5sp8WK+nbQ4DCzrEt7ZMGeoJ0sAGZedlEUgloSGQw1VcoKYcnoRzQ5YFzTLPaqau3pAYJD6kAdqOsm91kIZ2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"157f4b575833852634769046420245c3797f7ae527d2e429bc5475aa5b722616","last_reissued_at":"2026-05-18T00:04:00.793351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:00.793351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grundy dominating sequences on $X$-join product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Graciela Nasini, Pablo Torres","submitted_at":"2018-10-05T15:05:34Z","abstract_excerpt":"In this paper we study the Grundy domination number on the $X$-join product $G\\hookleftarrow \\mathcal R$ of a graph $G$ and a family of graphs $\\mathcal R=\\{G_v: v\\in V(G)\\}$. The results led us to extend the few known families of graphs where this parameter can be efficiently computed. We prove that if, for all $v\\in V(G)$, the Grundy domination number of $G_v$ is given, and $G$ is a power of a cycle, a power of a path, or a split graph, computing the Grundy domination number of $G\\hookleftarrow \\mathcal R$ can be done in polynomial time. In particular, the results for power of cycles and pat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02737","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":"1810.02737","created_at":"2026-05-18T00:04:00.793481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02737v1","created_at":"2026-05-18T00:04:00.793481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02737","created_at":"2026-05-18T00:04:00.793481+00:00"},{"alias_kind":"pith_short_12","alias_value":"CV7UWV2YGOCS","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CV7UWV2YGOCSMNDW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CV7UWV2Y","created_at":"2026-05-18T12:32:19.392346+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/CV7UWV2YGOCSMNDWSBDEEASFYN","json":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN.json","graph_json":"https://pith.science/api/pith-number/CV7UWV2YGOCSMNDWSBDEEASFYN/graph.json","events_json":"https://pith.science/api/pith-number/CV7UWV2YGOCSMNDWSBDEEASFYN/events.json","paper":"https://pith.science/paper/CV7UWV2Y"},"agent_actions":{"view_html":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN","download_json":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN.json","view_paper":"https://pith.science/paper/CV7UWV2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02737&json=true","fetch_graph":"https://pith.science/api/pith-number/CV7UWV2YGOCSMNDWSBDEEASFYN/graph.json","fetch_events":"https://pith.science/api/pith-number/CV7UWV2YGOCSMNDWSBDEEASFYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN/action/storage_attestation","attest_author":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN/action/author_attestation","sign_citation":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN/action/citation_signature","submit_replication":"https://pith.science/pith/CV7UWV2YGOCSMNDWSBDEEASFYN/action/replication_record"}},"created_at":"2026-05-18T00:04:00.793481+00:00","updated_at":"2026-05-18T00:04:00.793481+00:00"}