{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VRL72RCA3HSS2WMBO34ETCLQKN","short_pith_number":"pith:VRL72RCA","schema_version":"1.0","canonical_sha256":"ac57fd4440d9e52d598176f8498970537b7b6388ee20b7a67ab9b64c0683f723","source":{"kind":"arxiv","id":"1211.2662","version":4},"attestation_state":"computed","paper":{"title":"Recognizing Interval Bigraphs by Forbidden Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey","submitted_at":"2012-11-12T15:38:44Z","abstract_excerpt":"Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complexity O(nm^6(m + n) \\log n) and it was developed in 1997 [18]. Our approach is based on an ordering characterization of interval bigraphs introduced by Hell and Huang [13]. We transform the problem of finding the desired ordering to choosing strong components of a pair-digraph without creating conflicts. We make use of the structure of the pair-digraph as well as decomposition of bigraph H based on the special componen"},"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":"1211.2662","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:38:44Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ff3ffc71e2ad223351bee6780ac2ed3c3d8a81334304598d426a45924547123a","abstract_canon_sha256":"e22183a4d179ba3afc473c2f58ba61a1b987c53d0079c1c2eb8e9bd0b6ab71ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.410409Z","signature_b64":"zpPAdZTqH/eZgTAe6+m2+U5MKDc/ukBNSXzSMm27W5svng9bfGNvB1mlrTXhTdEDMSlu5OmQ6k/B2PQbCUKZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac57fd4440d9e52d598176f8498970537b7b6388ee20b7a67ab9b64c0683f723","last_reissued_at":"2026-05-18T00:15:38.409747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.409747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing Interval Bigraphs by Forbidden Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey","submitted_at":"2012-11-12T15:38:44Z","abstract_excerpt":"Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complexity O(nm^6(m + n) \\log n) and it was developed in 1997 [18]. Our approach is based on an ordering characterization of interval bigraphs introduced by Hell and Huang [13]. We transform the problem of finding the desired ordering to choosing strong components of a pair-digraph without creating conflicts. We make use of the structure of the pair-digraph as well as decomposition of bigraph H based on the special componen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2662","kind":"arxiv","version":4},"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":"1211.2662","created_at":"2026-05-18T00:15:38.409851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2662v4","created_at":"2026-05-18T00:15:38.409851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2662","created_at":"2026-05-18T00:15:38.409851+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRL72RCA3HSS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRL72RCA3HSS2WMB","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRL72RCA","created_at":"2026-05-18T12:27:25.539911+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/VRL72RCA3HSS2WMBO34ETCLQKN","json":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN.json","graph_json":"https://pith.science/api/pith-number/VRL72RCA3HSS2WMBO34ETCLQKN/graph.json","events_json":"https://pith.science/api/pith-number/VRL72RCA3HSS2WMBO34ETCLQKN/events.json","paper":"https://pith.science/paper/VRL72RCA"},"agent_actions":{"view_html":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN","download_json":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN.json","view_paper":"https://pith.science/paper/VRL72RCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2662&json=true","fetch_graph":"https://pith.science/api/pith-number/VRL72RCA3HSS2WMBO34ETCLQKN/graph.json","fetch_events":"https://pith.science/api/pith-number/VRL72RCA3HSS2WMBO34ETCLQKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/action/storage_attestation","attest_author":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/action/author_attestation","sign_citation":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/action/citation_signature","submit_replication":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/action/replication_record"}},"created_at":"2026-05-18T00:15:38.409851+00:00","updated_at":"2026-05-18T00:15:38.409851+00:00"}