{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DZZAWW3JXOPSXALWS35DOHNGSJ","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":"4486a3a6d5dd765cab6fefea0ffe71da54571b20edbafd3ead6a34b13dacbd35","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-01T22:51:09Z","title_canon_sha256":"09cd7a66fc662b699a643b471fa88efa7ecb968482be822bbe81793a2f447de9"},"schema_version":"1.0","source":{"id":"1402.0134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0134","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0134v2","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0134","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"DZZAWW3JXOPS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DZZAWW3JXOPSXALW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DZZAWW3J","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:277a41ffd672d36814052ccb993b2608e07ae87034d66888262c7b78dfcbfb8d","target":"graph","created_at":"2026-05-18T02:50:00Z","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":"Let $G$ be a graph. A good function is a function $f:V(G)\\rightarrow \\{-1,1\\}$, satisfying $f(N(v))\\geq 1$, for each $v\\in V(G)$, where $ N(v)=\\{u\\in V(G)\\, |\\, uv\\in E(G) \\} $ and $f(S) = \\sum_{u\\in S} f(u)$ for every $S \\subseteq V(G) $. For every cubic graph $G$ of order $ n, $ we prove that $ \\gamma(G) \\leq \\frac{5n}{7} $ and show that this inequality is sharp. A function $f:V(G)\\rightarrow \\{-1,1\\}$ is called a nice function, if $f(N[v])\\le1$, for each $v\\in V(G)$, where $ N[v]=\\{v\\} \\cup N(v) $. Define $\\overline{\\beta}(G)=max\\{f(V(G))\\}$, where $f$ is a nice function for $G$. We show th","authors_text":"K. Ehsani, M. Dalirrooyfard, R. Sherkati, S. Akbari, S. Davodpoor","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-01T22:51:09Z","title":"On the Decision Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0134","kind":"arxiv","version":2},"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:99b8d7048e3a4af8195fc57f88346710c376b605466d67f72a97c4eab227997b","target":"record","created_at":"2026-05-18T02:50:00Z","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":"4486a3a6d5dd765cab6fefea0ffe71da54571b20edbafd3ead6a34b13dacbd35","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-01T22:51:09Z","title_canon_sha256":"09cd7a66fc662b699a643b471fa88efa7ecb968482be822bbe81793a2f447de9"},"schema_version":"1.0","source":{"id":"1402.0134","kind":"arxiv","version":2}},"canonical_sha256":"1e720b5b69bb9f2b817696fa371da6926c665f763d7cf51c713709fbf769275d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e720b5b69bb9f2b817696fa371da6926c665f763d7cf51c713709fbf769275d","first_computed_at":"2026-05-18T02:50:00.580136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:00.580136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yRjBFPa/z0ulgwDh3wJtdV6/3HfkbxR3m1GOs3BknMYFCjiE+OeO+wq7Z+OYI/1KYWk3HAk9FQ1W8uy7nIBUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:00.580828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99b8d7048e3a4af8195fc57f88346710c376b605466d67f72a97c4eab227997b","sha256:277a41ffd672d36814052ccb993b2608e07ae87034d66888262c7b78dfcbfb8d"],"state_sha256":"a2ce5ff45cc2ea03669c9e0194abe7b71f2cdc21c23964ad0987dfb8a128aa1d"}