{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DUM5JBDB6OXHF6FT62JHC7PUSU","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":"e2196758b9e1f8506ed4fe8e8cc81ff7785b7bee33c73ec5b6c23af6af8c5383","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T15:52:30Z","title_canon_sha256":"3b2bc83d3a612e81f85533ce8c2021973d096436aa1710cf1af2c39c3ace0f3f"},"schema_version":"1.0","source":{"id":"1908.08882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08882","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08882v1","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08882","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_12","alias_value":"DUM5JBDB6OXH","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_16","alias_value":"DUM5JBDB6OXHF6FT","created_at":"2026-07-04T23:59:24Z"},{"alias_kind":"pith_short_8","alias_value":"DUM5JBDB","created_at":"2026-07-04T23:59:24Z"}],"graph_snapshots":[{"event_id":"sha256:6b08d34717b76e2bd1fe12201417ff328e5c1d75c5ceee22f59a0c5fc857b762","target":"graph","created_at":"2026-07-04T23:59:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08882/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study of simultaneous representations is the sunflower case where all objects share the same common structure. While the recognition problem for general simultaneous interval graphs -- the simultaneous version of arguably one of the most well-studied graph classes -- is NP-complete, the complexity of the sunflower case for three or more simultaneous interval graphs is currently open. In this work we settle this question f","authors_text":"Darren Strash, Ignaz Rutter, Michael Vollmer, Peter Stumpf","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T15:52:30Z","title":"Simultaneous Representation of Proper and Unit Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08882","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:74308134589b6ec9be141408f992029056600ca4d8001ecf72d45f0722ce9a77","target":"record","created_at":"2026-07-04T23:59:24Z","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":"e2196758b9e1f8506ed4fe8e8cc81ff7785b7bee33c73ec5b6c23af6af8c5383","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T15:52:30Z","title_canon_sha256":"3b2bc83d3a612e81f85533ce8c2021973d096436aa1710cf1af2c39c3ace0f3f"},"schema_version":"1.0","source":{"id":"1908.08882","kind":"arxiv","version":1}},"canonical_sha256":"1d19d48461f3ae72f8b3f692717df4950565c3f520c0d6f3477d42f675c9dfd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d19d48461f3ae72f8b3f692717df4950565c3f520c0d6f3477d42f675c9dfd5","first_computed_at":"2026-07-04T23:59:24.854562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:24.854562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jOrX8gk2U9Sc4q1EUu8l3780Y441SBYFhtUtFMDxXaY+iVmebFp/0vhoa0LfaJ+Vf5tnCTTnAtOERxrwVUd/CA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:24.855040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74308134589b6ec9be141408f992029056600ca4d8001ecf72d45f0722ce9a77","sha256:6b08d34717b76e2bd1fe12201417ff328e5c1d75c5ceee22f59a0c5fc857b762"],"state_sha256":"0fdfecad9c47a01e9829b1eb5fab47fd47b5d20b257d96ac32a614613b323b23"}