{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FBBELARJDLGW5IKE7ATHQ4BG3U","short_pith_number":"pith:FBBELARJ","schema_version":"1.0","canonical_sha256":"28424582291acd6ea144f826787026dd24d3c7eef9e54f0f8b7451845ec8ce44","source":{"kind":"arxiv","id":"1905.02867","version":1},"attestation_state":"computed","paper":{"title":"On the semi-proper orientations of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Dehghan","submitted_at":"2019-05-08T02:05:22Z","abstract_excerpt":"A {\\it semi-proper orientation} of a given graph $G$ is a function $(D,w)$ that assigns an orientation $D(e)$ and a positive integer weight $ w(e)$ to each edge $e$ such that for every two adjacent vertices $v$ and $u$, $S_{(D,w)}(v) \\neq S_{(D,w)}(u) $, where $S_{(D,w)}(v) $ is the sum of the weights of edges with head $v$ in $D$. The {\\it semi-proper orientation number} of a graph $G$, denoted by $\\overrightarrow{\\chi}_s (G)$, is $ \\min_{(D,w)\\in \\Gamma} \\max_{v\\in V(G)} S_{(D,w)}(v) $, where $\\Gamma$ is the set of all semi-proper orientations of $G$. The {\\it optimal semi-proper orientation"},"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":"1905.02867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-08T02:05:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1705d12486cb44da19b088a456892c1c19dc99fec8de862d5cb44ebcfc6d0b18","abstract_canon_sha256":"9e5a2d10d91afe9cdc5681eb67d2f3d592bd5125e9dafdd960b395d3a070ceb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.147766Z","signature_b64":"x0Nmt4aqYpHpoHCxvPBtUId7FPnkLe8VDtxQEUtsa3eddi95wkYLJqTIMj2aVvODGgr4GDansv8P+5d0XBxTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28424582291acd6ea144f826787026dd24d3c7eef9e54f0f8b7451845ec8ce44","last_reissued_at":"2026-05-17T23:46:45.147337Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.147337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the semi-proper orientations of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Dehghan","submitted_at":"2019-05-08T02:05:22Z","abstract_excerpt":"A {\\it semi-proper orientation} of a given graph $G$ is a function $(D,w)$ that assigns an orientation $D(e)$ and a positive integer weight $ w(e)$ to each edge $e$ such that for every two adjacent vertices $v$ and $u$, $S_{(D,w)}(v) \\neq S_{(D,w)}(u) $, where $S_{(D,w)}(v) $ is the sum of the weights of edges with head $v$ in $D$. The {\\it semi-proper orientation number} of a graph $G$, denoted by $\\overrightarrow{\\chi}_s (G)$, is $ \\min_{(D,w)\\in \\Gamma} \\max_{v\\in V(G)} S_{(D,w)}(v) $, where $\\Gamma$ is the set of all semi-proper orientations of $G$. The {\\it optimal semi-proper orientation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02867","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":"1905.02867","created_at":"2026-05-17T23:46:45.147414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02867v1","created_at":"2026-05-17T23:46:45.147414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02867","created_at":"2026-05-17T23:46:45.147414+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBBELARJDLGW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBBELARJDLGW5IKE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBBELARJ","created_at":"2026-05-18T12:33:15.570797+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/FBBELARJDLGW5IKE7ATHQ4BG3U","json":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U.json","graph_json":"https://pith.science/api/pith-number/FBBELARJDLGW5IKE7ATHQ4BG3U/graph.json","events_json":"https://pith.science/api/pith-number/FBBELARJDLGW5IKE7ATHQ4BG3U/events.json","paper":"https://pith.science/paper/FBBELARJ"},"agent_actions":{"view_html":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U","download_json":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U.json","view_paper":"https://pith.science/paper/FBBELARJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02867&json=true","fetch_graph":"https://pith.science/api/pith-number/FBBELARJDLGW5IKE7ATHQ4BG3U/graph.json","fetch_events":"https://pith.science/api/pith-number/FBBELARJDLGW5IKE7ATHQ4BG3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U/action/storage_attestation","attest_author":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U/action/author_attestation","sign_citation":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U/action/citation_signature","submit_replication":"https://pith.science/pith/FBBELARJDLGW5IKE7ATHQ4BG3U/action/replication_record"}},"created_at":"2026-05-17T23:46:45.147414+00:00","updated_at":"2026-05-17T23:46:45.147414+00:00"}