{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CISW2BES6QDMWZQAA3UDBP2KRL","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":"e8b023b3c2c381d8c4f4fb3507ffd6c7e6cfd1c1a3f09fec8e5f19ff99287d20","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-20T22:18:16Z","title_canon_sha256":"1e3564a710b7438e1cb87b985527e87b0e960c33366a8209f34e2c712fc30b77"},"schema_version":"1.0","source":{"id":"1706.06685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06685","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06685v1","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06685","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"CISW2BES6QDM","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CISW2BES6QDMWZQA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CISW2BES","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:0962c4e5a4fd8db4073970b89387575eed88a2145f83eb4c2b5269f924e71fa9","target":"graph","created_at":"2026-05-18T00:41:57Z","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":"EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an orthogonal grid. The class $B_k$-EPG is the subclass of EPG graphs where the path on the grid associated to each vertex has at most $k$ bends. Epstein et al. showed in 2013 that computing a maximum clique in $B_1$-EPG graphs is polynomial. As remarked in [Heldt et al., 2014], when the number of bends is at least $4$, the class contains $2$-interval graphs for which computing a maximum clique is an NP-hard problem. The complexity status of the Maximum Clique problem remains open for $B_2$ and $B_3$-EP","authors_text":"Marc Heinrich, Nicolas Bousquet","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-20T22:18:16Z","title":"Computing maximum cliques in $B_2$-EPG graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06685","kind":"arxiv","version":1},"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:399fbf5a6c0a3075284b74465ca5ac42b4b4be288df9295f717e830ecb96a44f","target":"record","created_at":"2026-05-18T00:41:57Z","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":"e8b023b3c2c381d8c4f4fb3507ffd6c7e6cfd1c1a3f09fec8e5f19ff99287d20","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-20T22:18:16Z","title_canon_sha256":"1e3564a710b7438e1cb87b985527e87b0e960c33366a8209f34e2c712fc30b77"},"schema_version":"1.0","source":{"id":"1706.06685","kind":"arxiv","version":1}},"canonical_sha256":"12256d0492f406cb660006e830bf4a8ad3770ce6e0b9fb6782553534ab2ddccf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12256d0492f406cb660006e830bf4a8ad3770ce6e0b9fb6782553534ab2ddccf","first_computed_at":"2026-05-18T00:41:57.157295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:57.157295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWNrSKhBffA9KqHgKNwyU2W/YteAcnglyLRfu/CU4WMsF081vDi3sbRoK2VtjWJzaWrR5pVWhmolRw0mxKZ9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:57.157942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:399fbf5a6c0a3075284b74465ca5ac42b4b4be288df9295f717e830ecb96a44f","sha256:0962c4e5a4fd8db4073970b89387575eed88a2145f83eb4c2b5269f924e71fa9"],"state_sha256":"f78a43e3d286ad838ace26dea781de32ced0fb6a6e422d11ecd67862a4f4629f"}