{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XLJ4FINASUZNHNCMBJCUGDWVXU","short_pith_number":"pith:XLJ4FINA","schema_version":"1.0","canonical_sha256":"bad3c2a1a09532d3b44c0a45430ed5bd000cc3254cba972e8249607505624fe0","source":{"kind":"arxiv","id":"1703.08716","version":1},"attestation_state":"computed","paper":{"title":"On well-covered Cartesian products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bert L. Hartnell, Douglas F. Rall, Kirsti Wash","submitted_at":"2017-03-25T17:24:20Z","abstract_excerpt":"In 1970, Plummer defined a well-covered graph to be a graph $G$ in which all maximal independent sets are in fact maximum. Later Hartnell and Rall showed that if the Cartesian product $G \\Box H$ is well-covered, then at least one of $G$ or $H$ is well-covered. In this paper, we consider the problem of classifying all well-covered Cartesian products. In particular, we show that if the Cartesian product of two nontrivial, connected graphs of girth at least $4$ is well-covered, then at least one of the graphs is $K_2$. Moreover, we show that $K_2 \\Box K_2$ and $C_5 \\Box K_2$ are the only well-cov"},"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":"1703.08716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T17:24:20Z","cross_cats_sorted":[],"title_canon_sha256":"567727ec2bb6b85ffb34dc29f43951a042eabb690e6cd19f2e7abc7dd5635ef1","abstract_canon_sha256":"52c7e38c5298b5282dba5c19abe6203361e215336c006d9cbb7661f87cbfcabf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.772036Z","signature_b64":"P/0vQ59WWk5Y2VWJJy/CyTMTCRVx9Z17DuGyp6Zrw038encbmStOF3JCOnESLYDNoLQu/gvuDPND+Q4IHvw5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bad3c2a1a09532d3b44c0a45430ed5bd000cc3254cba972e8249607505624fe0","last_reissued_at":"2026-05-18T00:47:55.771493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.771493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On well-covered Cartesian products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bert L. Hartnell, Douglas F. Rall, Kirsti Wash","submitted_at":"2017-03-25T17:24:20Z","abstract_excerpt":"In 1970, Plummer defined a well-covered graph to be a graph $G$ in which all maximal independent sets are in fact maximum. Later Hartnell and Rall showed that if the Cartesian product $G \\Box H$ is well-covered, then at least one of $G$ or $H$ is well-covered. In this paper, we consider the problem of classifying all well-covered Cartesian products. In particular, we show that if the Cartesian product of two nontrivial, connected graphs of girth at least $4$ is well-covered, then at least one of the graphs is $K_2$. Moreover, we show that $K_2 \\Box K_2$ and $C_5 \\Box K_2$ are the only well-cov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08716","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":"1703.08716","created_at":"2026-05-18T00:47:55.771557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08716v1","created_at":"2026-05-18T00:47:55.771557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08716","created_at":"2026-05-18T00:47:55.771557+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLJ4FINASUZN","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLJ4FINASUZNHNCM","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLJ4FINA","created_at":"2026-05-18T12:31:56.362134+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/XLJ4FINASUZNHNCMBJCUGDWVXU","json":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU.json","graph_json":"https://pith.science/api/pith-number/XLJ4FINASUZNHNCMBJCUGDWVXU/graph.json","events_json":"https://pith.science/api/pith-number/XLJ4FINASUZNHNCMBJCUGDWVXU/events.json","paper":"https://pith.science/paper/XLJ4FINA"},"agent_actions":{"view_html":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU","download_json":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU.json","view_paper":"https://pith.science/paper/XLJ4FINA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08716&json=true","fetch_graph":"https://pith.science/api/pith-number/XLJ4FINASUZNHNCMBJCUGDWVXU/graph.json","fetch_events":"https://pith.science/api/pith-number/XLJ4FINASUZNHNCMBJCUGDWVXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU/action/storage_attestation","attest_author":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU/action/author_attestation","sign_citation":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU/action/citation_signature","submit_replication":"https://pith.science/pith/XLJ4FINASUZNHNCMBJCUGDWVXU/action/replication_record"}},"created_at":"2026-05-18T00:47:55.771557+00:00","updated_at":"2026-05-18T00:47:55.771557+00:00"}