{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M3LYK7AIX5XXMAB6B5NLDMB7CP","short_pith_number":"pith:M3LYK7AI","schema_version":"1.0","canonical_sha256":"66d7857c08bf6f76003e0f5ab1b03f13e5016c64a40431f5df897a4c7107372e","source":{"kind":"arxiv","id":"1801.06494","version":2},"attestation_state":"computed","paper":{"title":"Quasimonotone graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Haiko M\\\"uller, Martin Dyer","submitted_at":"2018-01-19T17:12:07Z","abstract_excerpt":"For any class $\\mathcal{C}$ of bipartite graphs, we define quasi-$\\cal C$ to be the class of all graphs $G$ such that every bipartition of $G$ belongs to $\\cal C$. This definition is motivated by a generalisation of the switch Markov chain on perfect matchings from bipartite graphs to nonbipartite graphs. The monotone graphs, also known as bipartite permutation graphs and proper interval bigraphs, are such a class of bipartite graphs. We investigate the structure of quasi-monotone graphs and hence construct a polynomial time recognition algorithm for graphs in this class."},"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":"1801.06494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-19T17:12:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cf9b61eaa646bd62dd0725c9e67481a55d1db37ec9a100275bef83e0bab08b97","abstract_canon_sha256":"9056f01f5c694d6f1bcc1d8924dba27909ce460fc0abe5f155afdcbad0b02bfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:38.927142Z","signature_b64":"swsZpNlb8hMTNkd7LNsJjPiwsSD4eS1xDBLAK4//lyG6xiwGXIg2RCZXY1Cuw6/C4OtiyszlIHYNdkrFVbNwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d7857c08bf6f76003e0f5ab1b03f13e5016c64a40431f5df897a4c7107372e","last_reissued_at":"2026-05-18T00:22:38.926760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:38.926760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasimonotone graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Haiko M\\\"uller, Martin Dyer","submitted_at":"2018-01-19T17:12:07Z","abstract_excerpt":"For any class $\\mathcal{C}$ of bipartite graphs, we define quasi-$\\cal C$ to be the class of all graphs $G$ such that every bipartition of $G$ belongs to $\\cal C$. This definition is motivated by a generalisation of the switch Markov chain on perfect matchings from bipartite graphs to nonbipartite graphs. The monotone graphs, also known as bipartite permutation graphs and proper interval bigraphs, are such a class of bipartite graphs. We investigate the structure of quasi-monotone graphs and hence construct a polynomial time recognition algorithm for graphs in this class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06494","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1801.06494","created_at":"2026-05-18T00:22:38.926822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06494v2","created_at":"2026-05-18T00:22:38.926822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06494","created_at":"2026-05-18T00:22:38.926822+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3LYK7AIX5XX","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3LYK7AIX5XXMAB6","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3LYK7AI","created_at":"2026-05-18T12:32:37.024351+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/M3LYK7AIX5XXMAB6B5NLDMB7CP","json":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP.json","graph_json":"https://pith.science/api/pith-number/M3LYK7AIX5XXMAB6B5NLDMB7CP/graph.json","events_json":"https://pith.science/api/pith-number/M3LYK7AIX5XXMAB6B5NLDMB7CP/events.json","paper":"https://pith.science/paper/M3LYK7AI"},"agent_actions":{"view_html":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP","download_json":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP.json","view_paper":"https://pith.science/paper/M3LYK7AI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06494&json=true","fetch_graph":"https://pith.science/api/pith-number/M3LYK7AIX5XXMAB6B5NLDMB7CP/graph.json","fetch_events":"https://pith.science/api/pith-number/M3LYK7AIX5XXMAB6B5NLDMB7CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP/action/storage_attestation","attest_author":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP/action/author_attestation","sign_citation":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP/action/citation_signature","submit_replication":"https://pith.science/pith/M3LYK7AIX5XXMAB6B5NLDMB7CP/action/replication_record"}},"created_at":"2026-05-18T00:22:38.926822+00:00","updated_at":"2026-05-18T00:22:38.926822+00:00"}