{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NTP3EQ7KMP7OSXDCYLSMLAKETW","short_pith_number":"pith:NTP3EQ7K","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"},"canonical_sha256":"6cdfb243ea63fee95c62c2e4c581449d96f2c0c9d6037c54ba29dc1889247851","source":{"kind":"arxiv","id":"2603.29629","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.29629","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.29629v3","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.29629","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"NTP3EQ7KMP7O","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"NTP3EQ7KMP7OSXDC","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"NTP3EQ7K","created_at":"2026-06-04T01:09:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NTP3EQ7KMP7OSXDCYLSMLAKETW","target":"record","payload":{"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"},"canonical_sha256":"6cdfb243ea63fee95c62c2e4c581449d96f2c0c9d6037c54ba29dc1889247851","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"},"source_kind":"arxiv","source_id":"2603.29629","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vKIsqvx4pIsNqQpyUltDT4QYXq5XxD+QSDguwr1xFh8rfIAkaKokLRWqnhgITYjHArjhqWr8n72E9Vm7KQ9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:31:15.639243Z"},"content_sha256":"d446257aa8a6445a6c9f8584eb33f8b81dd4180317a0131bb448cb3d712f3386","schema_version":"1.0","event_id":"sha256:d446257aa8a6445a6c9f8584eb33f8b81dd4180317a0131bb448cb3d712f3386"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NTP3EQ7KMP7OSXDCYLSMLAKETW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhDRCM9UTe5x3JB70JSpVPKTyEfYJ5fBP+lH06Mx/YAxodZ9fb8m3Vh+oOOCqH+efOTe5YTwJ/w8ivg7j0EwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:31:15.639637Z"},"content_sha256":"dac1db3501439ab69aa96a4b54a661b6eb10a68f4426e97600fb8b582dbb6e7a","schema_version":"1.0","event_id":"sha256:dac1db3501439ab69aa96a4b54a661b6eb10a68f4426e97600fb8b582dbb6e7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/bundle.json","state_url":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T17:31:15Z","links":{"resolver":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW","bundle":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/bundle.json","state":"https://pith.science/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTP3EQ7KMP7OSXDCYLSMLAKETW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NTP3EQ7KMP7OSXDCYLSMLAKETW","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":"5499d0e4b3e29afed5884f669836fee22b9dd2d5752ab8e927679f21bdaa1d38","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:52:38Z","title_canon_sha256":"59cce3fa5d457e07caf85910498393cf06c94e32fdefd2d75d22aba18def7052"},"schema_version":"1.0","source":{"id":"2603.29629","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.29629","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.29629v3","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.29629","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"NTP3EQ7KMP7O","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"NTP3EQ7KMP7OSXDC","created_at":"2026-06-04T01:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"NTP3EQ7K","created_at":"2026-06-04T01:09:49Z"}],"graph_snapshots":[{"event_id":"sha256:dac1db3501439ab69aa96a4b54a661b6eb10a68f4426e97600fb8b582dbb6e7a","target":"graph","created_at":"2026-06-04T01:09: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.29629/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:52:38Z","title":"On graph products and multi-word-representability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.29629","kind":"arxiv","version":3},"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:d446257aa8a6445a6c9f8584eb33f8b81dd4180317a0131bb448cb3d712f3386","target":"record","created_at":"2026-06-04T01:09: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":"5499d0e4b3e29afed5884f669836fee22b9dd2d5752ab8e927679f21bdaa1d38","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:52:38Z","title_canon_sha256":"59cce3fa5d457e07caf85910498393cf06c94e32fdefd2d75d22aba18def7052"},"schema_version":"1.0","source":{"id":"2603.29629","kind":"arxiv","version":3}},"canonical_sha256":"6cdfb243ea63fee95c62c2e4c581449d96f2c0c9d6037c54ba29dc1889247851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cdfb243ea63fee95c62c2e4c581449d96f2c0c9d6037c54ba29dc1889247851","first_computed_at":"2026-06-04T01:09:49.218427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:49.218427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8WYNrjxalxJy1BwPqo0fw8cQSEKLZdt2aQuJeomU/Lgoh2fjLwda2JPjLNdyERoZpopbEP6sA/0nBcCqOmBYBA==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:49.219605Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.29629","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d446257aa8a6445a6c9f8584eb33f8b81dd4180317a0131bb448cb3d712f3386","sha256:dac1db3501439ab69aa96a4b54a661b6eb10a68f4426e97600fb8b582dbb6e7a"],"state_sha256":"3c9f6a1fa690577d1b0c01b04cb8f14a59e6106217a54d6e840029696c3fd09b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOp39q8DTT8nJZ7um+L5yoCEfUYHgRReXb6xHbHE/OgHLF3jvFpzDCG4C5fINocDw5dWA1DKv6NwanTym57+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:31:15.641604Z","bundle_sha256":"297dcb4e898903d856d84048ad7a7823577ed76096886c0164691ce964bd3e39"}}