{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NTP3EQ7KMP7OSXDCYLSMLAKETW","short_pith_number":"pith:NTP3EQ7K","schema_version":"1.0","canonical_sha256":"6cdfb243ea63fee95c62c2e4c581449d96f2c0c9d6037c54ba29dc1889247851","source":{"kind":"arxiv","id":"2603.29629","version":3},"attestation_state":"computed","paper":{"title":"On graph products and multi-word-representability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan","submitted_at":"2026-03-31T11:52:38Z","abstract_excerpt":"The multi-word-representation number $\\mu(G)$ of a graph $G$ is the minimum number of word-representable graphs whose union is $G$. We study the behavior of $\\mu$ under four standard graph products: the lexicographic, Cartesian, rooted, and corona products.\n  For the Cartesian and rooted products, we show that the multi-word-representation number of the product equals $\\max\\{\\mu(G_1),\\mu(G_2)\\}$. For the corona product, we prove that it is at most $\\max\\{\\mu(G_1),\\mu(G_2)\\}+1$, and we identify a condition under which equality with the maximum holds.\n  For the lexicographic product, we establis"},"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":"2603.29629","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:52:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"59cce3fa5d457e07caf85910498393cf06c94e32fdefd2d75d22aba18def7052","abstract_canon_sha256":"5499d0e4b3e29afed5884f669836fee22b9dd2d5752ab8e927679f21bdaa1d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:49.219605Z","signature_b64":"8WYNrjxalxJy1BwPqo0fw8cQSEKLZdt2aQuJeomU/Lgoh2fjLwda2JPjLNdyERoZpopbEP6sA/0nBcCqOmBYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cdfb243ea63fee95c62c2e4c581449d96f2c0c9d6037c54ba29dc1889247851","last_reissued_at":"2026-06-04T01:09:49.218427Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:49.218427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graph products and multi-word-representability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan","submitted_at":"2026-03-31T11:52:38Z","abstract_excerpt":"The multi-word-representation number $\\mu(G)$ of a graph $G$ is the minimum number of word-representable graphs whose union is $G$. We study the behavior of $\\mu$ under four standard graph products: the lexicographic, Cartesian, rooted, and corona products.\n  For the Cartesian and rooted products, we show that the multi-word-representation number of the product equals $\\max\\{\\mu(G_1),\\mu(G_2)\\}$. For the corona product, we prove that it is at most $\\max\\{\\mu(G_1),\\mu(G_2)\\}+1$, and we identify a condition under which equality with the maximum holds.\n  For the lexicographic product, we establis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.29629","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.29629/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2603.29629","created_at":"2026-06-04T01:09:49.218600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.29629v3","created_at":"2026-06-04T01:09:49.218600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.29629","created_at":"2026-06-04T01:09:49.218600+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTP3EQ7KMP7O","created_at":"2026-06-04T01:09:49.218600+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTP3EQ7KMP7OSXDC","created_at":"2026-06-04T01:09:49.218600+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTP3EQ7K","created_at":"2026-06-04T01:09:49.218600+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/NTP3EQ7KMP7OSXDCYLSMLAKETW","json":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW.json","graph_json":"https://pith.science/api/pith-number/NTP3EQ7KMP7OSXDCYLSMLAKETW/graph.json","events_json":"https://pith.science/api/pith-number/NTP3EQ7KMP7OSXDCYLSMLAKETW/events.json","paper":"https://pith.science/paper/NTP3EQ7K"},"agent_actions":{"view_html":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW","download_json":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW.json","view_paper":"https://pith.science/paper/NTP3EQ7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.29629&json=true","fetch_graph":"https://pith.science/api/pith-number/NTP3EQ7KMP7OSXDCYLSMLAKETW/graph.json","fetch_events":"https://pith.science/api/pith-number/NTP3EQ7KMP7OSXDCYLSMLAKETW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/action/storage_attestation","attest_author":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/action/author_attestation","sign_citation":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/action/citation_signature","submit_replication":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/action/replication_record"}},"created_at":"2026-06-04T01:09:49.218600+00:00","updated_at":"2026-06-04T01:09:49.218600+00:00"}