{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q6FODKTPEAGEAGIIRGSAK32SST","short_pith_number":"pith:Q6FODKTP","schema_version":"1.0","canonical_sha256":"878ae1aa6f200c40190889a4056f5294d6f4d4b0f66811b203c7f7a9a66a7750","source":{"kind":"arxiv","id":"2506.01057","version":1},"attestation_state":"computed","paper":{"title":"On the Conjecture of the Representation Number of Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Khyodeno Mozhui, K. V. Krishna","submitted_at":"2025-06-01T15:52:23Z","abstract_excerpt":"While the problem of determining the representation number of an arbitrary word-representable graph is NP-hard, this problem is open even for bipartite graphs. The representation numbers are known for certain bipartite graphs including all the graphs with at most nine vertices. For bipartite graphs with partite sets of sizes $m$ and $n$, Glen et al. conjectured that the representation number is at most $\\lceil \\frac{m+n}{4}\\rceil$, where $m+n \\ge 9$.\n  In this paper, we show that every bipartite graph is $\\left( 1+ \\lceil \\frac{m}{2} \\rceil \\right)$-representable, where $m$ is the size of its "},"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":"2506.01057","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T15:52:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"418f8c36e2f922c64182898b5d05d97daff2b4d98a503291393835ea690bbc9c","abstract_canon_sha256":"79beb6a436abbe84debb6f317d0b61414e086ee3a3ebfc2fe732fdaf1e44a9d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:45.245061Z","signature_b64":"nwftLo0vQ1xXDcDuyhirYEv/jNqajgwTkLbm9iGvefSOdGfowB2xVArg0jVLB9Fqxxoeyr6AdXh2+qruya+jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"878ae1aa6f200c40190889a4056f5294d6f4d4b0f66811b203c7f7a9a66a7750","last_reissued_at":"2026-07-05T11:13:45.244553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:45.244553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Conjecture of the Representation Number of Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Khyodeno Mozhui, K. V. Krishna","submitted_at":"2025-06-01T15:52:23Z","abstract_excerpt":"While the problem of determining the representation number of an arbitrary word-representable graph is NP-hard, this problem is open even for bipartite graphs. The representation numbers are known for certain bipartite graphs including all the graphs with at most nine vertices. For bipartite graphs with partite sets of sizes $m$ and $n$, Glen et al. conjectured that the representation number is at most $\\lceil \\frac{m+n}{4}\\rceil$, where $m+n \\ge 9$.\n  In this paper, we show that every bipartite graph is $\\left( 1+ \\lceil \\frac{m}{2} \\rceil \\right)$-representable, where $m$ is the size of its "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01057","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/2506.01057/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":"2506.01057","created_at":"2026-07-05T11:13:45.244618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01057v1","created_at":"2026-07-05T11:13:45.244618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01057","created_at":"2026-07-05T11:13:45.244618+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6FODKTPEAGE","created_at":"2026-07-05T11:13:45.244618+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6FODKTPEAGEAGII","created_at":"2026-07-05T11:13:45.244618+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6FODKTP","created_at":"2026-07-05T11:13:45.244618+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/Q6FODKTPEAGEAGIIRGSAK32SST","json":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST.json","graph_json":"https://pith.science/api/pith-number/Q6FODKTPEAGEAGIIRGSAK32SST/graph.json","events_json":"https://pith.science/api/pith-number/Q6FODKTPEAGEAGIIRGSAK32SST/events.json","paper":"https://pith.science/paper/Q6FODKTP"},"agent_actions":{"view_html":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST","download_json":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST.json","view_paper":"https://pith.science/paper/Q6FODKTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01057&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6FODKTPEAGEAGIIRGSAK32SST/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6FODKTPEAGEAGIIRGSAK32SST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST/action/storage_attestation","attest_author":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST/action/author_attestation","sign_citation":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST/action/citation_signature","submit_replication":"https://pith.science/pith/Q6FODKTPEAGEAGIIRGSAK32SST/action/replication_record"}},"created_at":"2026-07-05T11:13:45.244618+00:00","updated_at":"2026-07-05T11:13:45.244618+00:00"}