{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MFRRJ2RBH6AN3SNMCX7KWHDLQC","short_pith_number":"pith:MFRRJ2RB","schema_version":"1.0","canonical_sha256":"616314ea213f80ddc9ac15feab1c6b80b527c46c003e65fe044ca80dfe39019a","source":{"kind":"arxiv","id":"2311.13980","version":1},"attestation_state":"computed","paper":{"title":"On the Permutation-Representation Number of Bipartite Graphs using Neighborhood Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Khyodeno Mozhui, K. V. Krishna","submitted_at":"2023-11-23T12:52:09Z","abstract_excerpt":"The problems of determining the permutation-representation number (prn) and the representation number of bipartite graphs are open in the literature. Moreover, the decision problem corresponding to the determination of the prn of a bipartite graph is NP-complete. However, these numbers were established for certain subclasses of bipartite graphs, e.g., for crown graphs. Further, it was conjectured that the crown graphs have the highest representation number among the bipartite graphs. In this work, first, we reconcile the relation between the prn of a comparability graph and the dimension of it"},"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":"2311.13980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-11-23T12:52:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5c7681e9e1e02341cff52bc226296ee6025a762c21244b24b8799a4f363786d5","abstract_canon_sha256":"77d8b4e1e8b404eb4fb34289b9539fc2169a4c3822eb22bc74032e2d0e6a462a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:11.692737Z","signature_b64":"0OystCq7f0KjaAOdNwokY+ZM4YKVc1Je3WmYQP/HRFZ2eB2eNDSba8UlVVRInuCMWnuquVJLssBccIyMPpkbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"616314ea213f80ddc9ac15feab1c6b80b527c46c003e65fe044ca80dfe39019a","last_reissued_at":"2026-07-05T07:16:11.692185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:11.692185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Permutation-Representation Number of Bipartite Graphs using Neighborhood Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Khyodeno Mozhui, K. V. Krishna","submitted_at":"2023-11-23T12:52:09Z","abstract_excerpt":"The problems of determining the permutation-representation number (prn) and the representation number of bipartite graphs are open in the literature. Moreover, the decision problem corresponding to the determination of the prn of a bipartite graph is NP-complete. However, these numbers were established for certain subclasses of bipartite graphs, e.g., for crown graphs. Further, it was conjectured that the crown graphs have the highest representation number among the bipartite graphs. In this work, first, we reconcile the relation between the prn of a comparability graph and the dimension of it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13980","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/2311.13980/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":"2311.13980","created_at":"2026-07-05T07:16:11.692247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13980v1","created_at":"2026-07-05T07:16:11.692247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13980","created_at":"2026-07-05T07:16:11.692247+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFRRJ2RBH6AN","created_at":"2026-07-05T07:16:11.692247+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFRRJ2RBH6AN3SNM","created_at":"2026-07-05T07:16:11.692247+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFRRJ2RB","created_at":"2026-07-05T07:16:11.692247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00872","citing_title":"Representation Number of Word-Representable Split Graphs","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC","json":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC.json","graph_json":"https://pith.science/api/pith-number/MFRRJ2RBH6AN3SNMCX7KWHDLQC/graph.json","events_json":"https://pith.science/api/pith-number/MFRRJ2RBH6AN3SNMCX7KWHDLQC/events.json","paper":"https://pith.science/paper/MFRRJ2RB"},"agent_actions":{"view_html":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC","download_json":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC.json","view_paper":"https://pith.science/paper/MFRRJ2RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13980&json=true","fetch_graph":"https://pith.science/api/pith-number/MFRRJ2RBH6AN3SNMCX7KWHDLQC/graph.json","fetch_events":"https://pith.science/api/pith-number/MFRRJ2RBH6AN3SNMCX7KWHDLQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC/action/storage_attestation","attest_author":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC/action/author_attestation","sign_citation":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC/action/citation_signature","submit_replication":"https://pith.science/pith/MFRRJ2RBH6AN3SNMCX7KWHDLQC/action/replication_record"}},"created_at":"2026-07-05T07:16:11.692247+00:00","updated_at":"2026-07-05T07:16:11.692247+00:00"}