{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7SUCCMA4EDCF3YNKND5UCTJGMV","short_pith_number":"pith:7SUCCMA4","schema_version":"1.0","canonical_sha256":"fca821301c20c45de1aa68fb414d2665701d41575b74e62079a6f9f7af6690a4","source":{"kind":"arxiv","id":"1003.3968","version":3},"attestation_state":"computed","paper":{"title":"The Well-Covered Dimension of Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Isaac Birnbaum, Katherine Urabe, Megan Kuneli, Oscar Vega, Robyn McDonald","submitted_at":"2010-03-21T04:20:20Z","abstract_excerpt":"We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of $K_n\\times G$ is found, provided that $G$ has a largest greedy independent decomposition of length $c<n$.\n  Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given."},"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":"1003.3968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-21T04:20:20Z","cross_cats_sorted":[],"title_canon_sha256":"fbc2ac40ec7fca2519ecd0ab6b0743eeeabb4a67ebb60a28ed924de6f939da76","abstract_canon_sha256":"ac2df6eee7261c55417cee01c3f5f7fcdad0e92c8bed3d6d32c4f691f7ae5195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:36.434698Z","signature_b64":"kxvweGJMzJn3T66pEzBjqmZ+YfHwXeAbpsBNTZkIuPKF8GcTbj+UCUa0yICm7lJCo8CqRGJEqgMMJDnaTHBdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca821301c20c45de1aa68fb414d2665701d41575b74e62079a6f9f7af6690a4","last_reissued_at":"2026-05-18T02:24:36.434072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:36.434072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Well-Covered Dimension of Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Isaac Birnbaum, Katherine Urabe, Megan Kuneli, Oscar Vega, Robyn McDonald","submitted_at":"2010-03-21T04:20:20Z","abstract_excerpt":"We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of $K_n\\times G$ is found, provided that $G$ has a largest greedy independent decomposition of length $c<n$.\n  Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3968","kind":"arxiv","version":3},"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":"1003.3968","created_at":"2026-05-18T02:24:36.434175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3968v3","created_at":"2026-05-18T02:24:36.434175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3968","created_at":"2026-05-18T02:24:36.434175+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SUCCMA4EDCF","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SUCCMA4EDCF3YNK","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SUCCMA4","created_at":"2026-05-18T12:26:05.355336+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/7SUCCMA4EDCF3YNKND5UCTJGMV","json":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV.json","graph_json":"https://pith.science/api/pith-number/7SUCCMA4EDCF3YNKND5UCTJGMV/graph.json","events_json":"https://pith.science/api/pith-number/7SUCCMA4EDCF3YNKND5UCTJGMV/events.json","paper":"https://pith.science/paper/7SUCCMA4"},"agent_actions":{"view_html":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV","download_json":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV.json","view_paper":"https://pith.science/paper/7SUCCMA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3968&json=true","fetch_graph":"https://pith.science/api/pith-number/7SUCCMA4EDCF3YNKND5UCTJGMV/graph.json","fetch_events":"https://pith.science/api/pith-number/7SUCCMA4EDCF3YNKND5UCTJGMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV/action/storage_attestation","attest_author":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV/action/author_attestation","sign_citation":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV/action/citation_signature","submit_replication":"https://pith.science/pith/7SUCCMA4EDCF3YNKND5UCTJGMV/action/replication_record"}},"created_at":"2026-05-18T02:24:36.434175+00:00","updated_at":"2026-05-18T02:24:36.434175+00:00"}