{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BYBMYAEF7OJUKWX2ZTWZZ2C32T","short_pith_number":"pith:BYBMYAEF","canonical_record":{"source":{"id":"2412.17648","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:24:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0caa603e4251aed08f10e02dccc91cf87ff38e9208c4bdc4fde7d7f1d5c10636","abstract_canon_sha256":"34487bce7c8ec1e4d50b503b4368250b360d71e6e81a8c000823f1da1a7e0957"},"schema_version":"1.0"},"canonical_sha256":"0e02cc0085fb93455afacced9ce85bd4c9e36a4e90d04f1e242d48aa3d157974","source":{"kind":"arxiv","id":"2412.17648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17648","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17648v1","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17648","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_12","alias_value":"BYBMYAEF7OJU","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_16","alias_value":"BYBMYAEF7OJUKWX2","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_8","alias_value":"BYBMYAEF","created_at":"2026-07-05T09:53:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BYBMYAEF7OJUKWX2ZTWZZ2C32T","target":"record","payload":{"canonical_record":{"source":{"id":"2412.17648","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:24:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0caa603e4251aed08f10e02dccc91cf87ff38e9208c4bdc4fde7d7f1d5c10636","abstract_canon_sha256":"34487bce7c8ec1e4d50b503b4368250b360d71e6e81a8c000823f1da1a7e0957"},"schema_version":"1.0"},"canonical_sha256":"0e02cc0085fb93455afacced9ce85bd4c9e36a4e90d04f1e242d48aa3d157974","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:25.476491Z","signature_b64":"4g8+GOkeE2gEFRlL5dU+YAzycogbq42ET8XnH/IHEYBm2vU8VGZBB0/vfKySbhRJ9OtATVziPd0Seaqb4/csDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e02cc0085fb93455afacced9ce85bd4c9e36a4e90d04f1e242d48aa3d157974","last_reissued_at":"2026-07-05T09:53:25.476058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:25.476058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.17648","source_version":1,"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-07-05T09:53:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1cutK2gY7Whx3hU6A8eKtI6zZAPnHwcznUe5sVayyj8AdpW7Ku4InIU4KF1spc006tHHE6yRQ3g0usAP+qlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:37:56.362651Z"},"content_sha256":"3ce000224c45eecd99617782419ea18fa451825aada53ea6384c207f74230aac","schema_version":"1.0","event_id":"sha256:3ce000224c45eecd99617782419ea18fa451825aada53ea6384c207f74230aac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BYBMYAEF7OJUKWX2ZTWZZ2C32T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of Word-Representable Graphs using Modular Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"K. V. Krishna, Tithi Dwary","submitted_at":"2024-12-23T15:24:05Z","abstract_excerpt":"In this work, we characterize the class of word-representable graphs with respect to the modular decomposition. Consequently, we determine the representation number of a word-representable graph in terms of the permutation-representation numbers of the modules and the representation number of the associated quotient graph. In this connection, we also obtain a complete answer to the open problem posed by Kitaev and Lozin on the word-representability of the lexicographical product of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.17648/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-07-05T09:53:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkBB1Tli//4hYxpvcZZBbC2Iq4ilhARlMpNH3D8waQYxCRlwdHLPEUCOINNBYJKw//V3BCiO8CPEKiKmNNdMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:37:56.363056Z"},"content_sha256":"0cdfa50ab0c7a0ffbee8b427ada56b841f986d590fa50de2419c103f4ebf3926","schema_version":"1.0","event_id":"sha256:0cdfa50ab0c7a0ffbee8b427ada56b841f986d590fa50de2419c103f4ebf3926"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T/bundle.json","state_url":"https://pith.science/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T/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-08-23T13:37:56Z","links":{"resolver":"https://pith.science/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T","bundle":"https://pith.science/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T/bundle.json","state":"https://pith.science/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYBMYAEF7OJUKWX2ZTWZZ2C32T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BYBMYAEF7OJUKWX2ZTWZZ2C32T","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":"34487bce7c8ec1e4d50b503b4368250b360d71e6e81a8c000823f1da1a7e0957","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:24:05Z","title_canon_sha256":"0caa603e4251aed08f10e02dccc91cf87ff38e9208c4bdc4fde7d7f1d5c10636"},"schema_version":"1.0","source":{"id":"2412.17648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17648","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17648v1","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17648","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_12","alias_value":"BYBMYAEF7OJU","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_16","alias_value":"BYBMYAEF7OJUKWX2","created_at":"2026-07-05T09:53:25Z"},{"alias_kind":"pith_short_8","alias_value":"BYBMYAEF","created_at":"2026-07-05T09:53:25Z"}],"graph_snapshots":[{"event_id":"sha256:0cdfa50ab0c7a0ffbee8b427ada56b841f986d590fa50de2419c103f4ebf3926","target":"graph","created_at":"2026-07-05T09:53:25Z","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/2412.17648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we characterize the class of word-representable graphs with respect to the modular decomposition. Consequently, we determine the representation number of a word-representable graph in terms of the permutation-representation numbers of the modules and the representation number of the associated quotient graph. In this connection, we also obtain a complete answer to the open problem posed by Kitaev and Lozin on the word-representability of the lexicographical product of graphs.","authors_text":"K. V. Krishna, Tithi Dwary","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:24:05Z","title":"Characterization of Word-Representable Graphs using Modular Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17648","kind":"arxiv","version":1},"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:3ce000224c45eecd99617782419ea18fa451825aada53ea6384c207f74230aac","target":"record","created_at":"2026-07-05T09:53:25Z","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":"34487bce7c8ec1e4d50b503b4368250b360d71e6e81a8c000823f1da1a7e0957","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T15:24:05Z","title_canon_sha256":"0caa603e4251aed08f10e02dccc91cf87ff38e9208c4bdc4fde7d7f1d5c10636"},"schema_version":"1.0","source":{"id":"2412.17648","kind":"arxiv","version":1}},"canonical_sha256":"0e02cc0085fb93455afacced9ce85bd4c9e36a4e90d04f1e242d48aa3d157974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e02cc0085fb93455afacced9ce85bd4c9e36a4e90d04f1e242d48aa3d157974","first_computed_at":"2026-07-05T09:53:25.476058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:25.476058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4g8+GOkeE2gEFRlL5dU+YAzycogbq42ET8XnH/IHEYBm2vU8VGZBB0/vfKySbhRJ9OtATVziPd0Seaqb4/csDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:25.476491Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ce000224c45eecd99617782419ea18fa451825aada53ea6384c207f74230aac","sha256:0cdfa50ab0c7a0ffbee8b427ada56b841f986d590fa50de2419c103f4ebf3926"],"state_sha256":"003fa912a7bf3c4ca6268fa5e215ca2b4f1c2229fe9e363b2e3bc983ec124646"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBA5Ccs3p2iF3fQie8G7+MC1DFL0repWK6CdL9cgPU/pPZ22130lBVdmDxX8WaWr86qoNkno1J7+XJsHMwqNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T13:37:56.365680Z","bundle_sha256":"5d9ed68e09c9f257f607f4e2d1c8fee837bcc776c46302c43e414da897972966"}}