{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YYAG5LHENZFBASABCHLJZWFKKK","short_pith_number":"pith:YYAG5LHE","schema_version":"1.0","canonical_sha256":"c6006eace46e4a10480111d69cd8aa5285024330967efbd0aa2ee3aa30f8baeb","source":{"kind":"arxiv","id":"1609.06778","version":1},"attestation_state":"computed","paper":{"title":"Proper Orientations of Planar Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Cl\\'audia Linhares Sales, Fiachra Knox, Sebasti\\'an Gonz\\'alez Hermosillo de la Maza","submitted_at":"2016-09-21T23:38:25Z","abstract_excerpt":"An orientation of a graph $G$ is proper if any two adjacent vertices have different indegrees. The proper orientation number $\\overrightarrow{\\chi}(G)$ of a graph $G$ is the minimum of the maximum indegree, taken over all proper orientations of $G$. In this paper, we show that a connected bipartite graph may be properly oriented even if we are only allowed to control the orientation of a specific set of edges, namely, the edges of a spanning tree and all the edges incident to one of its leaves. As a consequence of this result, we prove that 3-connected planar bipartite graphs have proper orien"},"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":"1609.06778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-21T23:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"0ff467e34a8a092e21449f9b7bff6ceff50780c386b8507a24f16a48ba2d53ff","abstract_canon_sha256":"17d32847ec599ae2822c75922853c501fe8da6266c9755e08e983eda73288ebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:05.117873Z","signature_b64":"6PI0VBFE7m1NqrikhmJYjLk2dS2msDzP6DeT2w3F2AY8jD2+9bNUQXo4IQCfW8/LWYA9zacAXNFTD5wZYd/DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6006eace46e4a10480111d69cd8aa5285024330967efbd0aa2ee3aa30f8baeb","last_reissued_at":"2026-05-18T01:04:05.117431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:05.117431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proper Orientations of Planar Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Cl\\'audia Linhares Sales, Fiachra Knox, Sebasti\\'an Gonz\\'alez Hermosillo de la Maza","submitted_at":"2016-09-21T23:38:25Z","abstract_excerpt":"An orientation of a graph $G$ is proper if any two adjacent vertices have different indegrees. The proper orientation number $\\overrightarrow{\\chi}(G)$ of a graph $G$ is the minimum of the maximum indegree, taken over all proper orientations of $G$. In this paper, we show that a connected bipartite graph may be properly oriented even if we are only allowed to control the orientation of a specific set of edges, namely, the edges of a spanning tree and all the edges incident to one of its leaves. As a consequence of this result, we prove that 3-connected planar bipartite graphs have proper orien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06778","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":"1609.06778","created_at":"2026-05-18T01:04:05.117502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06778v1","created_at":"2026-05-18T01:04:05.117502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06778","created_at":"2026-05-18T01:04:05.117502+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYAG5LHENZFB","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYAG5LHENZFBASAB","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYAG5LHE","created_at":"2026-05-18T12:30:53.716459+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/YYAG5LHENZFBASABCHLJZWFKKK","json":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK.json","graph_json":"https://pith.science/api/pith-number/YYAG5LHENZFBASABCHLJZWFKKK/graph.json","events_json":"https://pith.science/api/pith-number/YYAG5LHENZFBASABCHLJZWFKKK/events.json","paper":"https://pith.science/paper/YYAG5LHE"},"agent_actions":{"view_html":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK","download_json":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK.json","view_paper":"https://pith.science/paper/YYAG5LHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06778&json=true","fetch_graph":"https://pith.science/api/pith-number/YYAG5LHENZFBASABCHLJZWFKKK/graph.json","fetch_events":"https://pith.science/api/pith-number/YYAG5LHENZFBASABCHLJZWFKKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK/action/storage_attestation","attest_author":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK/action/author_attestation","sign_citation":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK/action/citation_signature","submit_replication":"https://pith.science/pith/YYAG5LHENZFBASABCHLJZWFKKK/action/replication_record"}},"created_at":"2026-05-18T01:04:05.117502+00:00","updated_at":"2026-05-18T01:04:05.117502+00:00"}