{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U5XW5F3LKTMNHQY5CDX5VO3G3Y","short_pith_number":"pith:U5XW5F3L","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"},"canonical_sha256":"a76f6e976b54d8d3c31d10efdabb66de00f96a086379fbb0f8de43c20ac282ee","source":{"kind":"arxiv","id":"1102.1142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1142","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1142v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1142","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"U5XW5F3LKTMN","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U5XW5F3LKTMNHQY5","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U5XW5F3L","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U5XW5F3LKTMNHQY5CDX5VO3G3Y","target":"record","payload":{"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"},"canonical_sha256":"a76f6e976b54d8d3c31d10efdabb66de00f96a086379fbb0f8de43c20ac282ee","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"},"source_kind":"arxiv","source_id":"1102.1142","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zxmo1TwCvTvrScYeHAPHjBJK3sc/r+zS/RXvBrZJdNScDs860+2NSx4vEH5ym0wE2Mf81ejl3KUqhpOfHuvQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:55:28.522612Z"},"content_sha256":"2167ca681c88e2d6559b56d10044dfef1995e794fb3b0071a5f97d813bb0fc32","schema_version":"1.0","event_id":"sha256:2167ca681c88e2d6559b56d10044dfef1995e794fb3b0071a5f97d813bb0fc32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U5XW5F3LKTMNHQY5CDX5VO3G3Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lh2n6svNzn09g6bRZEL39X7nCZTCFQA529IGafGGJ4J421AYzDCQr1NbiX9k1snuUthy+j/ZqNBHkPKGB5tPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:55:28.523246Z"},"content_sha256":"6410571a400fc34271e6109992c68e365513e4284ebbeeae13d85556373f5fd0","schema_version":"1.0","event_id":"sha256:6410571a400fc34271e6109992c68e365513e4284ebbeeae13d85556373f5fd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/bundle.json","state_url":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T19:55:28Z","links":{"resolver":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y","bundle":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/bundle.json","state":"https://pith.science/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5XW5F3LKTMNHQY5CDX5VO3G3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U5XW5F3LKTMNHQY5CDX5VO3G3Y","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":"5996ad72a16144b43aaeeb223e7b422c00da7c71a45dc23aa178c5f1671836be","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:43:56Z","title_canon_sha256":"c7da64c7aa53f6818c9dc11b8ae4306b659f0de2c837a266d2255f8d35b20e80"},"schema_version":"1.0","source":{"id":"1102.1142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1142","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1142v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1142","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"U5XW5F3LKTMN","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U5XW5F3LKTMNHQY5","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U5XW5F3L","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:6410571a400fc34271e6109992c68e365513e4284ebbeeae13d85556373f5fd0","target":"graph","created_at":"2026-05-18T04:29:54Z","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 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 ","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":"2011-02-06T11:43:56Z","title":"Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1142","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:2167ca681c88e2d6559b56d10044dfef1995e794fb3b0071a5f97d813bb0fc32","target":"record","created_at":"2026-05-18T04:29:54Z","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":"5996ad72a16144b43aaeeb223e7b422c00da7c71a45dc23aa178c5f1671836be","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:43:56Z","title_canon_sha256":"c7da64c7aa53f6818c9dc11b8ae4306b659f0de2c837a266d2255f8d35b20e80"},"schema_version":"1.0","source":{"id":"1102.1142","kind":"arxiv","version":1}},"canonical_sha256":"a76f6e976b54d8d3c31d10efdabb66de00f96a086379fbb0f8de43c20ac282ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a76f6e976b54d8d3c31d10efdabb66de00f96a086379fbb0f8de43c20ac282ee","first_computed_at":"2026-05-18T04:29:54.940717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:54.940717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wE8/LUgOgBT0yT2kxr8NqT0MS2qjsNOWHItyzyMrpXZHdCPHVnrvSFc7aql4kVPHVX8amDApCBdek9iv8M01CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:54.941305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2167ca681c88e2d6559b56d10044dfef1995e794fb3b0071a5f97d813bb0fc32","sha256:6410571a400fc34271e6109992c68e365513e4284ebbeeae13d85556373f5fd0"],"state_sha256":"7da586e37d6643c7ca7b26fb7a53d4bd9ff5e9825ec38e270556e4f16435fe6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzzz6NAjtxgs8gBR0ADCrPbEOFw3taJP8Z3jOFEiN5ATvwl/Ex8xBdlQ3Tj7VcE1noFGp8zm6IW710LGPyMfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:55:28.526533Z","bundle_sha256":"c8efec78d23f60146e85690a39318a3ca154bb1d6c6c6fd1f2fbd88ff7cd6a9f"}}