{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LBTLQQUCMFY4MLUYHMLL62TUG2","short_pith_number":"pith:LBTLQQUC","canonical_record":{"source":{"id":"1104.4556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-23T13:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"148bde63d79e303032e4c0d1e2e87368ab93b066a12f43fd611def30c4fe3c25","abstract_canon_sha256":"8cc976ceb84d056060764dad19894d6ff5b1d991ba0528764689beace8fa6846"},"schema_version":"1.0"},"canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","source":{"kind":"arxiv","id":"1104.4556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4556","created_at":"2026-05-18T03:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4556v2","created_at":"2026-05-18T03:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4556","created_at":"2026-05-18T03:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"LBTLQQUCMFY4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LBTLQQUCMFY4MLUY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LBTLQQUC","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LBTLQQUCMFY4MLUYHMLL62TUG2","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-23T13:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"148bde63d79e303032e4c0d1e2e87368ab93b066a12f43fd611def30c4fe3c25","abstract_canon_sha256":"8cc976ceb84d056060764dad19894d6ff5b1d991ba0528764689beace8fa6846"},"schema_version":"1.0"},"canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:25.698523Z","signature_b64":"nvab5aYJfdL6F+oFwbFYQOReFXXA8FZR0AzZzeIZW9wtVGdcemouuBkbd03WnCoFTwGJ2UlRZ9soqwQcGlznBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","last_reissued_at":"2026-05-18T03:51:25.697826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:25.697826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4556","source_version":2,"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-18T03:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkMyb6py3MP2xUoFPBT9p947BTZeroi3k0rYvWj0/0TpRYTd5wEUwYBuAwbwl2GCzMQPAZMOVp/cNRE0DdflAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:31:41.807980Z"},"content_sha256":"c9917892ccfb626473888ffc91cdd0c2ddcfdb10fc1606d0dddd50d2bc72cc95","schema_version":"1.0","event_id":"sha256:c9917892ccfb626473888ffc91cdd0c2ddcfdb10fc1606d0dddd50d2bc72cc95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LBTLQQUCMFY4MLUYHMLL62TUG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pure simplicial complexes and well-covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Rashid Zaare-Nahandi","submitted_at":"2011-04-23T13:14:02Z","abstract_excerpt":"A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\\Delta$ is called pure if all of its facets have the same cardinality. Let $\\mathcal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, we prove that for any simplicial complex or any graph, there is a corresponding graph in class $\\mathcal G$ with the same well-coveredness property. Then some necessary and sufficient conditions are presented to recognize fast when a graph in the class $\\cal G$ is well-covered or not. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4556","kind":"arxiv","version":2},"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-18T03:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NfKCHM+yRM5GCNMDsSX8IaFcExyagQov5PgwAaUAWu8F/aqK/Z3Pm1pbG1+qgcy5+FJ+RloZSLEEvgxIVD7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:31:41.808742Z"},"content_sha256":"7a50253fa78bbab4cab47d6de964e89c6ad31e12ef3562ac78ecf83473dd83cb","schema_version":"1.0","event_id":"sha256:7a50253fa78bbab4cab47d6de964e89c6ad31e12ef3562ac78ecf83473dd83cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/bundle.json","state_url":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/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-06-07T08:31:41Z","links":{"resolver":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2","bundle":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/bundle.json","state":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LBTLQQUCMFY4MLUYHMLL62TUG2","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":"8cc976ceb84d056060764dad19894d6ff5b1d991ba0528764689beace8fa6846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-23T13:14:02Z","title_canon_sha256":"148bde63d79e303032e4c0d1e2e87368ab93b066a12f43fd611def30c4fe3c25"},"schema_version":"1.0","source":{"id":"1104.4556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4556","created_at":"2026-05-18T03:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4556v2","created_at":"2026-05-18T03:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4556","created_at":"2026-05-18T03:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"LBTLQQUCMFY4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LBTLQQUCMFY4MLUY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LBTLQQUC","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:7a50253fa78bbab4cab47d6de964e89c6ad31e12ef3562ac78ecf83473dd83cb","target":"graph","created_at":"2026-05-18T03:51:25Z","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 graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\\Delta$ is called pure if all of its facets have the same cardinality. Let $\\mathcal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, we prove that for any simplicial complex or any graph, there is a corresponding graph in class $\\mathcal G$ with the same well-coveredness property. Then some necessary and sufficient conditions are presented to recognize fast when a graph in the class $\\cal G$ is well-covered or not. To","authors_text":"Rashid Zaare-Nahandi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-23T13:14:02Z","title":"Pure simplicial complexes and well-covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4556","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:c9917892ccfb626473888ffc91cdd0c2ddcfdb10fc1606d0dddd50d2bc72cc95","target":"record","created_at":"2026-05-18T03:51:25Z","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":"8cc976ceb84d056060764dad19894d6ff5b1d991ba0528764689beace8fa6846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-23T13:14:02Z","title_canon_sha256":"148bde63d79e303032e4c0d1e2e87368ab93b066a12f43fd611def30c4fe3c25"},"schema_version":"1.0","source":{"id":"1104.4556","kind":"arxiv","version":2}},"canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","first_computed_at":"2026-05-18T03:51:25.697826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:25.697826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvab5aYJfdL6F+oFwbFYQOReFXXA8FZR0AzZzeIZW9wtVGdcemouuBkbd03WnCoFTwGJ2UlRZ9soqwQcGlznBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:25.698523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9917892ccfb626473888ffc91cdd0c2ddcfdb10fc1606d0dddd50d2bc72cc95","sha256:7a50253fa78bbab4cab47d6de964e89c6ad31e12ef3562ac78ecf83473dd83cb"],"state_sha256":"a4ee64de6aebf226d4e7ed4e54a6ea3e78a90c29a72fe6f914748c1ec35f1c06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sj4ZFr5joXFcw06oZVruEw9gmugDYv0wapDmfXo+NSczVe0d5YXjJUkrwhr3DZVkiYcYBM7QseMm18tBRznuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:31:41.813014Z","bundle_sha256":"69067bf1ad454f4a05086f74a554c37d8fddea2e65cd664896a40f61613925ab"}}