{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CHOIWUVXQILHV7XTHQVBGOIEJ4","short_pith_number":"pith:CHOIWUVX","schema_version":"1.0","canonical_sha256":"11dc8b52b782167afef33c2a1339044f0abc0af57eccd1189963fcceff799051","source":{"kind":"arxiv","id":"1108.5361","version":2},"attestation_state":"computed","paper":{"title":"Confluent Hasse diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SE"],"primary_cat":"cs.CG","authors_text":"David Eppstein, Joseph A. Simons","submitted_at":"2011-08-26T18:07:50Z","abstract_excerpt":"We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n) \\times O(n)$ grid in $O(n^2)$ time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with $O(n)$ features in an $O(n) \\times O(n)$ grid in $O(n)$ time from a series-parallel decomposition of the partial order. Our drawings are optimal in the number of confluent junctions they use."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.5361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-26T18:07:50Z","cross_cats_sorted":["cs.DS","cs.SE"],"title_canon_sha256":"017352430ade026d01752ffcbd1354ec5dd729add136628a17a4cec8736f2400","abstract_canon_sha256":"05e9845c11de71b2e2f67962e68196af231940ef6b925e01d004a2b088cf92fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:51.957862Z","signature_b64":"UCOQtfOx+XHdOnTbuSntpB9n+7E83Lc7H7Txpx17Ckm4gZDtchxnW/s6jcWhNBHd89fjprI2bKRcTzAYon7cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11dc8b52b782167afef33c2a1339044f0abc0af57eccd1189963fcceff799051","last_reissued_at":"2026-05-18T01:36:51.957345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:51.957345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Confluent Hasse diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SE"],"primary_cat":"cs.CG","authors_text":"David Eppstein, Joseph A. Simons","submitted_at":"2011-08-26T18:07:50Z","abstract_excerpt":"We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n) \\times O(n)$ grid in $O(n^2)$ time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with $O(n)$ features in an $O(n) \\times O(n)$ grid in $O(n)$ time from a series-parallel decomposition of the partial order. Our drawings are optimal in the number of confluent junctions they use."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5361","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.5361","created_at":"2026-05-18T01:36:51.957426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5361v2","created_at":"2026-05-18T01:36:51.957426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5361","created_at":"2026-05-18T01:36:51.957426+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHOIWUVXQILH","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHOIWUVXQILHV7XT","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHOIWUVX","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4","json":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4.json","graph_json":"https://pith.science/api/pith-number/CHOIWUVXQILHV7XTHQVBGOIEJ4/graph.json","events_json":"https://pith.science/api/pith-number/CHOIWUVXQILHV7XTHQVBGOIEJ4/events.json","paper":"https://pith.science/paper/CHOIWUVX"},"agent_actions":{"view_html":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4","download_json":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4.json","view_paper":"https://pith.science/paper/CHOIWUVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5361&json=true","fetch_graph":"https://pith.science/api/pith-number/CHOIWUVXQILHV7XTHQVBGOIEJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/CHOIWUVXQILHV7XTHQVBGOIEJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4/action/storage_attestation","attest_author":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4/action/author_attestation","sign_citation":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4/action/citation_signature","submit_replication":"https://pith.science/pith/CHOIWUVXQILHV7XTHQVBGOIEJ4/action/replication_record"}},"created_at":"2026-05-18T01:36:51.957426+00:00","updated_at":"2026-05-18T01:36:51.957426+00:00"}