{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VRL72RCA3HSS2WMBO34ETCLQKN","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":"e22183a4d179ba3afc473c2f58ba61a1b987c53d0079c1c2eb8e9bd0b6ab71ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:38:44Z","title_canon_sha256":"ff3ffc71e2ad223351bee6780ac2ed3c3d8a81334304598d426a45924547123a"},"schema_version":"1.0","source":{"id":"1211.2662","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2662","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2662v4","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2662","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"VRL72RCA3HSS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VRL72RCA3HSS2WMB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VRL72RCA","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:6b04b4dcef37ffa68fab29a567cff134fa81106165ca9f06072c3693cb265aa8","target":"graph","created_at":"2026-05-18T00:15:38Z","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"},"paper":{"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","authors_text":"Arash Rafiey","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:38:44Z","title":"Recognizing Interval Bigraphs by Forbidden Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2662","kind":"arxiv","version":4},"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:5d32061c568d66041ea3351d4d2c274c88abc9a15cd4678e0f055464d0212d56","target":"record","created_at":"2026-05-18T00:15:38Z","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":"e22183a4d179ba3afc473c2f58ba61a1b987c53d0079c1c2eb8e9bd0b6ab71ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-12T15:38:44Z","title_canon_sha256":"ff3ffc71e2ad223351bee6780ac2ed3c3d8a81334304598d426a45924547123a"},"schema_version":"1.0","source":{"id":"1211.2662","kind":"arxiv","version":4}},"canonical_sha256":"ac57fd4440d9e52d598176f8498970537b7b6388ee20b7a67ab9b64c0683f723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac57fd4440d9e52d598176f8498970537b7b6388ee20b7a67ab9b64c0683f723","first_computed_at":"2026-05-18T00:15:38.409747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:38.409747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpPAdZTqH/eZgTAe6+m2+U5MKDc/ukBNSXzSMm27W5svng9bfGNvB1mlrTXhTdEDMSlu5OmQ6k/B2PQbCUKZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:38.410409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2662","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d32061c568d66041ea3351d4d2c274c88abc9a15cd4678e0f055464d0212d56","sha256:6b04b4dcef37ffa68fab29a567cff134fa81106165ca9f06072c3693cb265aa8"],"state_sha256":"30bf5b96c77d4408b497bbc41115b8b0e06a94dcc8a8572e6094d135c039a7aa"}