{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JIKLPKKUAAHQLNVJWYVDSJIDRS","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":"bdaebd1285eece2a3c3663395668ff85138041a1ceda5bca5bceee5e55bf1647","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-17T13:43:39Z","title_canon_sha256":"3c2b48f70adfe13e05da2fae4f16ef11743e500872893894e9da28f935688cf1"},"schema_version":"1.0","source":{"id":"1008.2897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2897","created_at":"2026-05-18T04:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2897v1","created_at":"2026-05-18T04:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2897","created_at":"2026-05-18T04:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"JIKLPKKUAAHQ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JIKLPKKUAAHQLNVJ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JIKLPKKU","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:d45e2f579f29eeda15624cdc12ccba7470a8a468f11a10d175716053d6f86d4d","target":"graph","created_at":"2026-05-18T04:42:04Z","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 \\textit{maximum stable set} in a graph $G$ is a stable set of maximum cardinality. $S$ is a \\textit{local maximum stable set} of $G$, and we write $S\\in\\Psi(G)$, if $S$ is a maximum stable set of the subgraph induced by $S\\cup N(S)$, where $N(S)$ is the neighborhood of $S$. Nemhauser and Trotter Jr. (1975), proved that any $S\\in\\Psi(G)$ is a subset of a maximum stable set of $G$. In (Levit & Mandrescu, 2002) we have shown that the family $\\Psi(T)$ of a forest $T$ forms a greedoid on its vertex set. The cases where $G$ is bipartite, triangle-free, well-covered, while $\\Psi(G)$ is a greedoid, ","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-17T13:43:39Z","title":"Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2897","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:831f56eb5f08abfa4cddd5185e2ad1d067b8328adc60f873b433c6a3f0398af2","target":"record","created_at":"2026-05-18T04:42:04Z","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":"bdaebd1285eece2a3c3663395668ff85138041a1ceda5bca5bceee5e55bf1647","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-17T13:43:39Z","title_canon_sha256":"3c2b48f70adfe13e05da2fae4f16ef11743e500872893894e9da28f935688cf1"},"schema_version":"1.0","source":{"id":"1008.2897","kind":"arxiv","version":1}},"canonical_sha256":"4a14b7a954000f05b6a9b62a3925038c9f864077cce26b2742a3f0d524f1fcf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a14b7a954000f05b6a9b62a3925038c9f864077cce26b2742a3f0d524f1fcf4","first_computed_at":"2026-05-18T04:42:04.130603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:04.130603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nS2k4O9GfRgZUETwuEXGXTH341hn9ZU/5kiVUQkTPWWP3wtsuyjLFfgqGtjCH019GXUW+Z9Ux/uB7uiAE+NvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:04.131107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:831f56eb5f08abfa4cddd5185e2ad1d067b8328adc60f873b433c6a3f0398af2","sha256:d45e2f579f29eeda15624cdc12ccba7470a8a468f11a10d175716053d6f86d4d"],"state_sha256":"b5d7408634b4dd7677ea7199ccc2f92d0ae5cd79adb3029c30360feff90ea6c1"}