{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QD7QTSAUXUMIP2Y3O3U56VNNNW","short_pith_number":"pith:QD7QTSAU","schema_version":"1.0","canonical_sha256":"80ff09c814bd1887eb1b76e9df55ad6db184ec33b66e6ee300bb621b3a61deb2","source":{"kind":"arxiv","id":"1511.00873","version":1},"attestation_state":"computed","paper":{"title":"The (3,1)-ordering for 4-connected planar triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin Derka, Therese Biedl","submitted_at":"2015-11-03T12:17:51Z","abstract_excerpt":"Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an $(r,s)$-canonical order, which unifies many of the existing variants of canonical orderings. We then show that $(3,1)$-canonical ordering for 4-connected triangulations always exist; to our knowledge this variant of canonical ordering was not previously known. We use it to give much simpler proofs of two previously known graph drawing results for 4-connected planar triangulations, namely, rectangular duals and rectangle-of-influence drawings."},"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":"1511.00873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-03T12:17:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0a3f1745e65b7a7758907c1cc2b90dc9de77c0d9f47c3e16afaf3f159f1ce82c","abstract_canon_sha256":"dac5c6331af9a3699d049f680463059457d2bc40b83d5563414404a52cf2f2e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:55.967836Z","signature_b64":"fJifE1MifJwGJO7kwskNaH0U8Nfa37Z8KZxZSzGuWsGIbhK+FFobsm9MbF4N2OwVKPQvI3F0/saAPlw4Un6qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80ff09c814bd1887eb1b76e9df55ad6db184ec33b66e6ee300bb621b3a61deb2","last_reissued_at":"2026-05-18T01:27:55.966927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:55.966927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The (3,1)-ordering for 4-connected planar triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin Derka, Therese Biedl","submitted_at":"2015-11-03T12:17:51Z","abstract_excerpt":"Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an $(r,s)$-canonical order, which unifies many of the existing variants of canonical orderings. We then show that $(3,1)$-canonical ordering for 4-connected triangulations always exist; to our knowledge this variant of canonical ordering was not previously known. We use it to give much simpler proofs of two previously known graph drawing results for 4-connected planar triangulations, namely, rectangular duals and rectangle-of-influence drawings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00873","kind":"arxiv","version":1},"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":"1511.00873","created_at":"2026-05-18T01:27:55.967066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00873v1","created_at":"2026-05-18T01:27:55.967066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00873","created_at":"2026-05-18T01:27:55.967066+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD7QTSAUXUMI","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD7QTSAUXUMIP2Y3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD7QTSAU","created_at":"2026-05-18T12:29:37.295048+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/QD7QTSAUXUMIP2Y3O3U56VNNNW","json":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW.json","graph_json":"https://pith.science/api/pith-number/QD7QTSAUXUMIP2Y3O3U56VNNNW/graph.json","events_json":"https://pith.science/api/pith-number/QD7QTSAUXUMIP2Y3O3U56VNNNW/events.json","paper":"https://pith.science/paper/QD7QTSAU"},"agent_actions":{"view_html":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW","download_json":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW.json","view_paper":"https://pith.science/paper/QD7QTSAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00873&json=true","fetch_graph":"https://pith.science/api/pith-number/QD7QTSAUXUMIP2Y3O3U56VNNNW/graph.json","fetch_events":"https://pith.science/api/pith-number/QD7QTSAUXUMIP2Y3O3U56VNNNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW/action/storage_attestation","attest_author":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW/action/author_attestation","sign_citation":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW/action/citation_signature","submit_replication":"https://pith.science/pith/QD7QTSAUXUMIP2Y3O3U56VNNNW/action/replication_record"}},"created_at":"2026-05-18T01:27:55.967066+00:00","updated_at":"2026-05-18T01:27:55.967066+00:00"}