{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5OHCMPXZEAWUPYGUORO7ZB5U4E","short_pith_number":"pith:5OHCMPXZ","schema_version":"1.0","canonical_sha256":"eb8e263ef9202d47e0d4745dfc87b4e120b77661aedd8f7a63faa383c5f9feb3","source":{"kind":"arxiv","id":"1311.0750","version":4},"attestation_state":"computed","paper":{"title":"Mondshein Sequences (a.k.a. (2,1)-Orders)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jens M. Schmidt","submitted_at":"2013-11-04T16:16:33Z","abstract_excerpt":"Canonical orderings [STOC'88, FOCS'92] have been used as a key tool in graph drawing, graph encoding and visibility representations for the last decades. We study a far-reaching generalization of canonical orderings to non-planar graphs that was published by Lee Mondshein in a PhD-thesis at M.I.T. as early as 1971.\n  Mondshein proposed to order the vertices of a graph in a sequence such that, for any i, the vertices from 1 to i induce essentially a 2-connected graph while the remaining vertices from i+1 to n induce a connected graph. Mondshein's sequence generalizes canonical orderings and bec"},"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":"1311.0750","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-04T16:16:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"9345a15db3b9dd6141891f746cedfc75361f04f2121523dbd33f0481cdd13df1","abstract_canon_sha256":"9daa8d738f37dabff0616a6c852a539866bc3dd10db83dd03ede71b4f1a55154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:29.272987Z","signature_b64":"Zygk7PydErrMma6Gc4NzN3VYRH/xwlsGbVN/X0bbCIESZ8gWks9/VVIRU/3xaEUNJPVRnAhzJl6IWmbrVqaTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb8e263ef9202d47e0d4745dfc87b4e120b77661aedd8f7a63faa383c5f9feb3","last_reissued_at":"2026-05-18T01:08:29.272386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:29.272386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mondshein Sequences (a.k.a. (2,1)-Orders)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jens M. Schmidt","submitted_at":"2013-11-04T16:16:33Z","abstract_excerpt":"Canonical orderings [STOC'88, FOCS'92] have been used as a key tool in graph drawing, graph encoding and visibility representations for the last decades. We study a far-reaching generalization of canonical orderings to non-planar graphs that was published by Lee Mondshein in a PhD-thesis at M.I.T. as early as 1971.\n  Mondshein proposed to order the vertices of a graph in a sequence such that, for any i, the vertices from 1 to i induce essentially a 2-connected graph while the remaining vertices from i+1 to n induce a connected graph. Mondshein's sequence generalizes canonical orderings and bec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0750","kind":"arxiv","version":4},"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":"1311.0750","created_at":"2026-05-18T01:08:29.272487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0750v4","created_at":"2026-05-18T01:08:29.272487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0750","created_at":"2026-05-18T01:08:29.272487+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OHCMPXZEAWU","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OHCMPXZEAWUPYGU","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OHCMPXZ","created_at":"2026-05-18T12:27:34.582898+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/5OHCMPXZEAWUPYGUORO7ZB5U4E","json":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E.json","graph_json":"https://pith.science/api/pith-number/5OHCMPXZEAWUPYGUORO7ZB5U4E/graph.json","events_json":"https://pith.science/api/pith-number/5OHCMPXZEAWUPYGUORO7ZB5U4E/events.json","paper":"https://pith.science/paper/5OHCMPXZ"},"agent_actions":{"view_html":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E","download_json":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E.json","view_paper":"https://pith.science/paper/5OHCMPXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0750&json=true","fetch_graph":"https://pith.science/api/pith-number/5OHCMPXZEAWUPYGUORO7ZB5U4E/graph.json","fetch_events":"https://pith.science/api/pith-number/5OHCMPXZEAWUPYGUORO7ZB5U4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E/action/storage_attestation","attest_author":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E/action/author_attestation","sign_citation":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E/action/citation_signature","submit_replication":"https://pith.science/pith/5OHCMPXZEAWUPYGUORO7ZB5U4E/action/replication_record"}},"created_at":"2026-05-18T01:08:29.272487+00:00","updated_at":"2026-05-18T01:08:29.272487+00:00"}