{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ZTSUCJH4U3NJPYLVH2HOUVLSHY","short_pith_number":"pith:ZTSUCJH4","canonical_record":{"source":{"id":"0811.4089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-25T14:11:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de76a200e3db140ad5616d684ea77e38b4fb1e54b6fd7037000ba2b09b31fd64","abstract_canon_sha256":"5e88205a34986159195f772a80669d7e1bc41d9a59db59d1f54945840e8af717"},"schema_version":"1.0"},"canonical_sha256":"cce54124fca6da97e1753e8eea55723e0bba61b9ae43332aa956dab26a1ce303","source":{"kind":"arxiv","id":"0811.4089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4089","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4089v1","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4089","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"ZTSUCJH4U3NJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZTSUCJH4U3NJPYLV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZTSUCJH4","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ZTSUCJH4U3NJPYLVH2HOUVLSHY","target":"record","payload":{"canonical_record":{"source":{"id":"0811.4089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-25T14:11:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de76a200e3db140ad5616d684ea77e38b4fb1e54b6fd7037000ba2b09b31fd64","abstract_canon_sha256":"5e88205a34986159195f772a80669d7e1bc41d9a59db59d1f54945840e8af717"},"schema_version":"1.0"},"canonical_sha256":"cce54124fca6da97e1753e8eea55723e0bba61b9ae43332aa956dab26a1ce303","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:12.228635Z","signature_b64":"cvbwTCM489DUOShxWx7it/fPr/DSSo060yrfgHb/w8WrDuusF6g+MdqMVyV4btsgJh0vV61RDxsHNtPArNm3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce54124fca6da97e1753e8eea55723e0bba61b9ae43332aa956dab26a1ce303","last_reissued_at":"2026-05-18T04:31:12.228087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:12.228087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.4089","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:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBBs1rP4W2oRrRsuSqnU/Q3+D3Qn5PNPaBmoI/9T3yit4HfEfxrAT3pi0PlZKtAPsgbeVHo2gQTaqDVHDSA9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:24:56.763924Z"},"content_sha256":"0bc6a3b2f5f6601a0c1a0151adf4fc37d7c90d574b0796c5d9158dad79d7132e","schema_version":"1.0","event_id":"sha256:0bc6a3b2f5f6601a0c1a0151adf4fc37d7c90d574b0796c5d9158dad79d7132e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ZTSUCJH4U3NJPYLVH2HOUVLSHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval greedoids and families of local maximum stable sets of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2008-11-25T14:11:44Z","abstract_excerpt":"A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, if S is a maximum stable set of the subgraph induced by its closed neighborhood.\n  Nemhauser and Trotter Jr. proved in 1975 that any local maximum stable set is a subset of a maximum stable set of G. In 2002 we showed that the family of all local maximum stable sets of a forest forms a greedoid on its vertex set. The cases where G is bipartite, triangle-free, well-covered, while the family of all local maximum stable sets is a greedoid, were analyzed in 2004, 2007, and 2008, respecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4089","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:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sd7+tM/hRu6dWRHuAICzaioH6AK2ROFPL+OWC+OAyFkiLVMOaeQzOdaSdI4K/g1T/vUHB0OQR+nhxOW6mJfoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:24:56.764274Z"},"content_sha256":"8dea3a9b591a716d78a0da841be4c3a16cbac065f37343af7364e3722aff879d","schema_version":"1.0","event_id":"sha256:8dea3a9b591a716d78a0da841be4c3a16cbac065f37343af7364e3722aff879d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY/bundle.json","state_url":"https://pith.science/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY/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-30T12:24:56Z","links":{"resolver":"https://pith.science/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY","bundle":"https://pith.science/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY/bundle.json","state":"https://pith.science/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTSUCJH4U3NJPYLVH2HOUVLSHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ZTSUCJH4U3NJPYLVH2HOUVLSHY","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":"5e88205a34986159195f772a80669d7e1bc41d9a59db59d1f54945840e8af717","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-25T14:11:44Z","title_canon_sha256":"de76a200e3db140ad5616d684ea77e38b4fb1e54b6fd7037000ba2b09b31fd64"},"schema_version":"1.0","source":{"id":"0811.4089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4089","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4089v1","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4089","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"ZTSUCJH4U3NJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZTSUCJH4U3NJPYLV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZTSUCJH4","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:8dea3a9b591a716d78a0da841be4c3a16cbac065f37343af7364e3722aff879d","target":"graph","created_at":"2026-05-18T04:31:12Z","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 a local maximum stable set of G, if S is a maximum stable set of the subgraph induced by its closed neighborhood.\n  Nemhauser and Trotter Jr. proved in 1975 that any local maximum stable set is a subset of a maximum stable set of G. In 2002 we showed that the family of all local maximum stable sets of a forest forms a greedoid on its vertex set. The cases where G is bipartite, triangle-free, well-covered, while the family of all local maximum stable sets is a greedoid, were analyzed in 2004, 2007, and 2008, respecti","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-25T14:11:44Z","title":"Interval greedoids and families of local maximum stable sets of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4089","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:0bc6a3b2f5f6601a0c1a0151adf4fc37d7c90d574b0796c5d9158dad79d7132e","target":"record","created_at":"2026-05-18T04:31:12Z","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":"5e88205a34986159195f772a80669d7e1bc41d9a59db59d1f54945840e8af717","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-25T14:11:44Z","title_canon_sha256":"de76a200e3db140ad5616d684ea77e38b4fb1e54b6fd7037000ba2b09b31fd64"},"schema_version":"1.0","source":{"id":"0811.4089","kind":"arxiv","version":1}},"canonical_sha256":"cce54124fca6da97e1753e8eea55723e0bba61b9ae43332aa956dab26a1ce303","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cce54124fca6da97e1753e8eea55723e0bba61b9ae43332aa956dab26a1ce303","first_computed_at":"2026-05-18T04:31:12.228087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:12.228087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cvbwTCM489DUOShxWx7it/fPr/DSSo060yrfgHb/w8WrDuusF6g+MdqMVyV4btsgJh0vV61RDxsHNtPArNm3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:12.228635Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.4089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bc6a3b2f5f6601a0c1a0151adf4fc37d7c90d574b0796c5d9158dad79d7132e","sha256:8dea3a9b591a716d78a0da841be4c3a16cbac065f37343af7364e3722aff879d"],"state_sha256":"de867d9bf170cc99bafd10af0316e9f2af59377c278cdac62b3ed9dd6e410a8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNEoQgrfFbVkdfmLS/xoZEPTCUUEOqkIwFgfiGQPO/LDMei8gfe78gQ0f1BMm6c3WNikBj4uetkvAXMfG3V4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:24:56.766333Z","bundle_sha256":"d871b48a17fca2b2b568973062033e3ec3f2f05b1dfdb0e7006d8f61469afe32"}}