{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VRL72RCA3HSS2WMBO34ETCLQKN","short_pith_number":"pith:VRL72RCA","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"},"canonical_sha256":"ac57fd4440d9e52d598176f8498970537b7b6388ee20b7a67ab9b64c0683f723","source":{"kind":"arxiv","id":"1211.2662","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VRL72RCA3HSS2WMBO34ETCLQKN","target":"record","payload":{"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"},"canonical_sha256":"ac57fd4440d9e52d598176f8498970537b7b6388ee20b7a67ab9b64c0683f723","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"},"source_kind":"arxiv","source_id":"1211.2662","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skPdBVKvDAEwlPSkqLX/3sAq9lX9lO2WEv4EkpENKxATcebZL2Z0UkdED/4vBUj1U+tENM7UK3vj5+uSTtfqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:24:05.377500Z"},"content_sha256":"5d32061c568d66041ea3351d4d2c274c88abc9a15cd4678e0f055464d0212d56","schema_version":"1.0","event_id":"sha256:5d32061c568d66041ea3351d4d2c274c88abc9a15cd4678e0f055464d0212d56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VRL72RCA3HSS2WMBO34ETCLQKN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYOkVAE2gFeix4rmkMOLYwKLPxpbZIPB+xI7S0J92yudZomjoDc87FORY8rHEIFyHrqizqNon+omKNRQUmE9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:24:05.377850Z"},"content_sha256":"6b04b4dcef37ffa68fab29a567cff134fa81106165ca9f06072c3693cb265aa8","schema_version":"1.0","event_id":"sha256:6b04b4dcef37ffa68fab29a567cff134fa81106165ca9f06072c3693cb265aa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/bundle.json","state_url":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRL72RCA3HSS2WMBO34ETCLQKN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T11:24:05Z","links":{"resolver":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN","bundle":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/bundle.json","state":"https://pith.science/pith/VRL72RCA3HSS2WMBO34ETCLQKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRL72RCA3HSS2WMBO34ETCLQKN/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esc39Njjs9ODdfDnNwusSFXDiQzPu3alZ/S2RqQdZmon2tzk2orVUD0ATXNlXTJ4ZNzNQ9aMGz7rjgZbmfIlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:24:05.379722Z","bundle_sha256":"bb2aaba1d9ce23b0d967949939d387c4ef94fc76d998e59ea5ed1151269f011a"}}