{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V2JNOOTKVHY5LIBEE634WVB3MG","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":"a69d580cacec0300942c51cd7a6aefec7a9892f531b362f1136ee169ec2d89c5","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-30T06:35:49Z","title_canon_sha256":"9c5bbd4c1ad06dcae1615fde2c07d1306f18c3fa0b3090595163291c031bbb74"},"schema_version":"1.0","source":{"id":"1808.10137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10137","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10137v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10137","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"V2JNOOTKVHY5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V2JNOOTKVHY5LIBE","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V2JNOOTK","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:37369c26b23b956f77d1d8a30144d8f26e1f9607ecc68cc7800a209fd1010e68","target":"graph","created_at":"2026-05-18T00:06:49Z","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":"Let $B$ be an induced complete bipartite subgraph of $G$ on vertex sets of bipartition $B_{X}$ and $B_{Y}$. The subgraph $B$ is {\\it generating} if there exists an independent set $S$ such that each of $S \\cup B_{X}$ and $S \\cup B_{Y}$ is a maximal independent set in the graph. If $B$ is generating, it \\textit{produces} the restriction $w(B_{X})=w(B_{Y})$. Let $w:V(G) \\longrightarrow\\mathbb{R}$ be a weight function. We say that $G$ is $w$-well-covered if all maximal independent sets are of the same weight. The graph $G$ is $w$-well-covered if and only if $w$ satisfies all restrictions produced","authors_text":"David Tankus","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-30T06:35:49Z","title":"Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10137","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:1d1eb618a477ac887ee27ff8e219ba9ebc70f23ee73939b4d44c1ef697c72bdf","target":"record","created_at":"2026-05-18T00:06:49Z","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":"a69d580cacec0300942c51cd7a6aefec7a9892f531b362f1136ee169ec2d89c5","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-30T06:35:49Z","title_canon_sha256":"9c5bbd4c1ad06dcae1615fde2c07d1306f18c3fa0b3090595163291c031bbb74"},"schema_version":"1.0","source":{"id":"1808.10137","kind":"arxiv","version":1}},"canonical_sha256":"ae92d73a6aa9f1d5a02427b7cb543b618ebf592cc5157c9b875d1c30d695286d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae92d73a6aa9f1d5a02427b7cb543b618ebf592cc5157c9b875d1c30d695286d","first_computed_at":"2026-05-18T00:06:49.708388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:49.708388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DsxyiNqAk/EZ5JFWT2kg1Pe65Lx0QvBllz/XbKpKfjwuffF4xy6lxONcFZQCN+4T8NKKgvSaOeVujD6nam6bBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:49.709131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d1eb618a477ac887ee27ff8e219ba9ebc70f23ee73939b4d44c1ef697c72bdf","sha256:37369c26b23b956f77d1d8a30144d8f26e1f9607ecc68cc7800a209fd1010e68"],"state_sha256":"553e89c50874f0d35896403774c2f5ba70181457f943851646a31a810b4265c6"}