{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BUTGLG7PQLDIO3LIXXTOBT6NLO","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":"867f346534a1615c744e255223c00bc2608624d63e407c01e5721abdc2d968d2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-07T00:46:58Z","title_canon_sha256":"fe9eb81b082cb3b5952b01a6ee45f38505d3429d88465e02e0c541f557632a40"},"schema_version":"1.0","source":{"id":"1904.03558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03558","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03558v1","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03558","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"BUTGLG7PQLDI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BUTGLG7PQLDIO3LI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BUTGLG7P","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:74aa8d980ced5e16e8256be18270b4f8006182537faf63bc13a9353bf4db975c","target":"graph","created_at":"2026-05-17T23:49:08Z","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":"A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be solved in polynomial time. One may therefore be interested in finding 2-dimensional graphs that closely approximate a given graph of arbitrary order dimension.\n  In this paper we show that the maximal 2-dimensional subgraphs of a transitive graph G are induced by the optimal near-transitive orientations of the complement of G. The same characterization holds ","authors_text":"Henning Koehler","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-07T00:46:58Z","title":"A characterization of maximal 2-dimensional subgraphs of transitive graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03558","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:b4bf44de21b1f138a48464bc371e87248f6db3cb083d2e9d3d6bb0221c6fe864","target":"record","created_at":"2026-05-17T23:49:08Z","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":"867f346534a1615c744e255223c00bc2608624d63e407c01e5721abdc2d968d2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-07T00:46:58Z","title_canon_sha256":"fe9eb81b082cb3b5952b01a6ee45f38505d3429d88465e02e0c541f557632a40"},"schema_version":"1.0","source":{"id":"1904.03558","kind":"arxiv","version":1}},"canonical_sha256":"0d26659bef82c6876d68bde6e0cfcd5bb76ab1947d9cb6cc445755d5a79ee8c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d26659bef82c6876d68bde6e0cfcd5bb76ab1947d9cb6cc445755d5a79ee8c3","first_computed_at":"2026-05-17T23:49:08.416965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:08.416965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uwwy4ukZixipVDaffIxFPG6Sc8dGVHVRFkcE5q6xVwxBnVEh59vChFLocGlsiH/o0NHv7TRVO5SXKi0Zug+kAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:08.417689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4bf44de21b1f138a48464bc371e87248f6db3cb083d2e9d3d6bb0221c6fe864","sha256:74aa8d980ced5e16e8256be18270b4f8006182537faf63bc13a9353bf4db975c"],"state_sha256":"ba40e4458f3374ebd81227e0f3a8e87aa5149b9944805ed4d4f2a8ac5ad703d1"}