{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N2YFPUVYVJ6MFQJZBPB4JW6IAY","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":"c22962438412069f76ee9b2c10c3ce31b78f1030eb26fcfa7b9b9d11d638d234","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-20T11:02:48Z","title_canon_sha256":"402a97a4e5912e6a1f120c499d1fa477da61e7f095f3e1abfab87389f3eb0264"},"schema_version":"1.0","source":{"id":"1707.06443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06443","created_at":"2026-05-18T00:39:53Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06443v1","created_at":"2026-05-18T00:39:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06443","created_at":"2026-05-18T00:39:53Z"},{"alias_kind":"pith_short_12","alias_value":"N2YFPUVYVJ6M","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2YFPUVYVJ6MFQJZ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2YFPUVY","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a68017232b7463fb831b6eeb059a39fa9be0e1e03ab31c8059d0743fcccdad2c","target":"graph","created_at":"2026-05-18T00:39:53Z","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":"For a graph $G=(V,E)$, a set $S \\subseteq V$ is a $[1,2]$-set if it is a dominating set for $G$ and each vertex $v \\in V \\setminus S$ is dominated by at most two vertices of $S$, i.e. $1 \\leq \\vert N(v) \\cap S \\vert \\leq 2$. Moreover a set $S \\subseteq V$ is a total $[1,2]$-set if for each vertex of $V$, it is the case that $1 \\leq \\vert N(v) \\cap S \\vert \\leq 2$. The $[1,2]$-domination number of $G$, denoted $\\gamma_{[1,2]}(G)$,is the minimum number of vertices in a $[1,2]$-set. Every $[1,2]$-set with cardinality of $\\gamma_{[1,2]}(G)$ is called a $\\gamma_{[1,2]}$-set. Total $[1,2]$-dominatio","authors_text":"M.R. Hooshmandasl, P. Sharifani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-20T11:02:48Z","title":"A Linear Algorithm for Computing $\\gamma_{[1,2]}$-set in Generalized Series-Parallel Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06443","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:e7861ad3108098e9e895c7baf40148b8874fc78c38c0ba97fdf686f58e73f708","target":"record","created_at":"2026-05-18T00:39:53Z","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":"c22962438412069f76ee9b2c10c3ce31b78f1030eb26fcfa7b9b9d11d638d234","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-20T11:02:48Z","title_canon_sha256":"402a97a4e5912e6a1f120c499d1fa477da61e7f095f3e1abfab87389f3eb0264"},"schema_version":"1.0","source":{"id":"1707.06443","kind":"arxiv","version":1}},"canonical_sha256":"6eb057d2b8aa7cc2c1390bc3c4dbc80639765404d8414dd64b0b12c2d72f9f98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb057d2b8aa7cc2c1390bc3c4dbc80639765404d8414dd64b0b12c2d72f9f98","first_computed_at":"2026-05-18T00:39:53.807444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:53.807444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOAuIOgydQJJdevQtfmv2E7BM1MHud2piL9i8YmySZAhLjyM566VmxVGYk/c1MCYtw354iVSww6ft4yti9CzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:53.807940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7861ad3108098e9e895c7baf40148b8874fc78c38c0ba97fdf686f58e73f708","sha256:a68017232b7463fb831b6eeb059a39fa9be0e1e03ab31c8059d0743fcccdad2c"],"state_sha256":"2b34f313c054bf9da6b14c0b38d83abfdd5e1f5644562304df30a9b008854be7"}