{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U5XW5F3LKTMNHQY5CDX5VO3G3Y","short_pith_number":"pith:U5XW5F3L","schema_version":"1.0","canonical_sha256":"a76f6e976b54d8d3c31d10efdabb66de00f96a086379fbb0f8de43c20ac282ee","source":{"kind":"arxiv","id":"1102.1142","version":1},"attestation_state":"computed","paper":{"title":"Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2011-02-06T11:43:56Z","abstract_excerpt":"A maximum stable set in a graph G is a stable set of maximum cardinality. S is called a local maximum stable set of G if S is a maximum stable set of the subgraph induced by the closed neighborhood of S. A greedoid (V,F) is called a local maximum stable set greedoid if there exists a graph G=(V,E) such that its family of local maximum stable sets coinsides with (V,F). It has been shown that the family local maximum stable sets of a forest T forms a greedoid on its vertex set. In this paper we demonstrate that if G is a very well-covered graph, then its family of local maximum stable sets is a "},"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":"1102.1142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:43:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c7da64c7aa53f6818c9dc11b8ae4306b659f0de2c837a266d2255f8d35b20e80","abstract_canon_sha256":"5996ad72a16144b43aaeeb223e7b422c00da7c71a45dc23aa178c5f1671836be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.941305Z","signature_b64":"wE8/LUgOgBT0yT2kxr8NqT0MS2qjsNOWHItyzyMrpXZHdCPHVnrvSFc7aql4kVPHVX8amDApCBdek9iv8M01CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a76f6e976b54d8d3c31d10efdabb66de00f96a086379fbb0f8de43c20ac282ee","last_reissued_at":"2026-05-18T04:29:54.940717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.940717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2011-02-06T11:43:56Z","abstract_excerpt":"A maximum stable set in a graph G is a stable set of maximum cardinality. S is called a local maximum stable set of G if S is a maximum stable set of the subgraph induced by the closed neighborhood of S. A greedoid (V,F) is called a local maximum stable set greedoid if there exists a graph G=(V,E) such that its family of local maximum stable sets coinsides with (V,F). It has been shown that the family local maximum stable sets of a forest T forms a greedoid on its vertex set. In this paper we demonstrate that if G is a very well-covered graph, then its family of local maximum stable sets is a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1142","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":"1102.1142","created_at":"2026-05-18T04:29:54.940794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1142v1","created_at":"2026-05-18T04:29:54.940794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1142","created_at":"2026-05-18T04:29:54.940794+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5XW5F3LKTMN","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5XW5F3LKTMNHQY5","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5XW5F3L","created_at":"2026-05-18T12:26:42.757692+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/U5XW5F3LKTMNHQY5CDX5VO3G3Y","json":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y.json","graph_json":"https://pith.science/api/pith-number/U5XW5F3LKTMNHQY5CDX5VO3G3Y/graph.json","events_json":"https://pith.science/api/pith-number/U5XW5F3LKTMNHQY5CDX5VO3G3Y/events.json","paper":"https://pith.science/paper/U5XW5F3L"},"agent_actions":{"view_html":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y","download_json":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y.json","view_paper":"https://pith.science/paper/U5XW5F3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1142&json=true","fetch_graph":"https://pith.science/api/pith-number/U5XW5F3LKTMNHQY5CDX5VO3G3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/U5XW5F3LKTMNHQY5CDX5VO3G3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/action/storage_attestation","attest_author":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/action/author_attestation","sign_citation":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/action/citation_signature","submit_replication":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/action/replication_record"}},"created_at":"2026-05-18T04:29:54.940794+00:00","updated_at":"2026-05-18T04:29:54.940794+00:00"}