{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WDYWKZ57WDSBGRA26UHYW4SWAP","short_pith_number":"pith:WDYWKZ57","schema_version":"1.0","canonical_sha256":"b0f16567bfb0e413441af50f8b725603e101e51d9bb0adb518c85757a95671f3","source":{"kind":"arxiv","id":"1901.03218","version":1},"attestation_state":"computed","paper":{"title":"On well-covered direct products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Kirsti Kuenzel","submitted_at":"2019-01-10T15:28:37Z","abstract_excerpt":"A graph $G$ is well-covered if all maximal independent sets of $G$ have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the standard graph products. In particular, they showed that both factors of a well-covered direct product are also well-covered and proved that the direct product of two complete graphs (respectively, two cycles) is well-covered precisely when they have the same order (respectively, both have order 3 or 4). Furthermore, they proved that the direct product of two well"},"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":"1901.03218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T15:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"f08d096d61000f4f62d0a6f97799487f9b1b5d41dbda32aa0140bc19b7373368","abstract_canon_sha256":"6f9873030aa44f1c6ab0911cf2fca47612a3e7f0e66593ff6e5a5b817f53d95c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.198985Z","signature_b64":"qPb/D4smLcnN8iIy1vl1dK9Zw0RJxEdp5Z8ThJJTnnELcj8e7tHrTiMU7brQaxlI+CcjF4QGaOp7PJc4EZYUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0f16567bfb0e413441af50f8b725603e101e51d9bb0adb518c85757a95671f3","last_reissued_at":"2026-05-17T23:56:35.198275Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.198275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On well-covered direct products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Kirsti Kuenzel","submitted_at":"2019-01-10T15:28:37Z","abstract_excerpt":"A graph $G$ is well-covered if all maximal independent sets of $G$ have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the standard graph products. In particular, they showed that both factors of a well-covered direct product are also well-covered and proved that the direct product of two complete graphs (respectively, two cycles) is well-covered precisely when they have the same order (respectively, both have order 3 or 4). Furthermore, they proved that the direct product of two well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03218","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":"1901.03218","created_at":"2026-05-17T23:56:35.198409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03218v1","created_at":"2026-05-17T23:56:35.198409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03218","created_at":"2026-05-17T23:56:35.198409+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDYWKZ57WDSB","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDYWKZ57WDSBGRA2","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDYWKZ57","created_at":"2026-05-18T12:33:30.264802+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/WDYWKZ57WDSBGRA26UHYW4SWAP","json":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP.json","graph_json":"https://pith.science/api/pith-number/WDYWKZ57WDSBGRA26UHYW4SWAP/graph.json","events_json":"https://pith.science/api/pith-number/WDYWKZ57WDSBGRA26UHYW4SWAP/events.json","paper":"https://pith.science/paper/WDYWKZ57"},"agent_actions":{"view_html":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP","download_json":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP.json","view_paper":"https://pith.science/paper/WDYWKZ57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03218&json=true","fetch_graph":"https://pith.science/api/pith-number/WDYWKZ57WDSBGRA26UHYW4SWAP/graph.json","fetch_events":"https://pith.science/api/pith-number/WDYWKZ57WDSBGRA26UHYW4SWAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP/action/storage_attestation","attest_author":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP/action/author_attestation","sign_citation":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP/action/citation_signature","submit_replication":"https://pith.science/pith/WDYWKZ57WDSBGRA26UHYW4SWAP/action/replication_record"}},"created_at":"2026-05-17T23:56:35.198409+00:00","updated_at":"2026-05-17T23:56:35.198409+00:00"}