{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5SY4UQVPJWSYN7TMBD3XTBMTIS","short_pith_number":"pith:5SY4UQVP","schema_version":"1.0","canonical_sha256":"ecb1ca42af4da586fe6c08f779859344ad68c762ca836ebc1c68193fdab4ab0b","source":{"kind":"arxiv","id":"1804.03884","version":1},"attestation_state":"computed","paper":{"title":"Weighted proper orientations of trees and graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ana Silva, Cl\\'audia Linhares Sales, Ignasi Sau, J\\'ulio Ara\\'ujo","submitted_at":"2018-04-11T09:16:44Z","abstract_excerpt":"Given a simple graph $G$, a weight function $w:E(G)\\rightarrow \\mathbb{N} \\setminus \\{0\\}$, and an orientation $D$ of $G$, we define $\\mu^-(D) = \\max_{v \\in V(G)} w_D^-(v)$, where $w^-_D(v) = \\sum_{u\\in N_D^{-}(v)}w(uv)$. We say that $D$ is a weighted proper orientation of $G$ if $w^-_D(u) \\neq w^-_D(v)$ whenever $u$ and $v$ are adjacent. We introduce the parameter weighted proper orientation number of $G$, denoted by $\\overrightarrow{\\chi}(G,w)$, which is the minimum, over all weighted proper orientations $D$ of $G$, of $\\mu^-(D)$. When all the weights are equal to 1, this parameter is equal "},"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":"1804.03884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T09:16:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8976c852e8038a011cef5a1b396214e6c8f96d697e743715b8942145392848ea","abstract_canon_sha256":"c1129ba4902b1acb8473232af62c0605b261d07f7f10a889ece510d33f944718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.792121Z","signature_b64":"nS0kZbamdCHW2Zyl1oGcbebSwu0hKSOmC1iF2MDK6vJqEiscFtCRCPh6qVfIBp3PTo8fLgysZdthY6zyznTrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb1ca42af4da586fe6c08f779859344ad68c762ca836ebc1c68193fdab4ab0b","last_reissued_at":"2026-05-18T00:18:42.791426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.791426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted proper orientations of trees and graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ana Silva, Cl\\'audia Linhares Sales, Ignasi Sau, J\\'ulio Ara\\'ujo","submitted_at":"2018-04-11T09:16:44Z","abstract_excerpt":"Given a simple graph $G$, a weight function $w:E(G)\\rightarrow \\mathbb{N} \\setminus \\{0\\}$, and an orientation $D$ of $G$, we define $\\mu^-(D) = \\max_{v \\in V(G)} w_D^-(v)$, where $w^-_D(v) = \\sum_{u\\in N_D^{-}(v)}w(uv)$. We say that $D$ is a weighted proper orientation of $G$ if $w^-_D(u) \\neq w^-_D(v)$ whenever $u$ and $v$ are adjacent. We introduce the parameter weighted proper orientation number of $G$, denoted by $\\overrightarrow{\\chi}(G,w)$, which is the minimum, over all weighted proper orientations $D$ of $G$, of $\\mu^-(D)$. When all the weights are equal to 1, this parameter is equal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03884","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":"1804.03884","created_at":"2026-05-18T00:18:42.791540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03884v1","created_at":"2026-05-18T00:18:42.791540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03884","created_at":"2026-05-18T00:18:42.791540+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SY4UQVPJWSY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SY4UQVPJWSYN7TM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SY4UQVP","created_at":"2026-05-18T12:32:08.215937+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/5SY4UQVPJWSYN7TMBD3XTBMTIS","json":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS.json","graph_json":"https://pith.science/api/pith-number/5SY4UQVPJWSYN7TMBD3XTBMTIS/graph.json","events_json":"https://pith.science/api/pith-number/5SY4UQVPJWSYN7TMBD3XTBMTIS/events.json","paper":"https://pith.science/paper/5SY4UQVP"},"agent_actions":{"view_html":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS","download_json":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS.json","view_paper":"https://pith.science/paper/5SY4UQVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03884&json=true","fetch_graph":"https://pith.science/api/pith-number/5SY4UQVPJWSYN7TMBD3XTBMTIS/graph.json","fetch_events":"https://pith.science/api/pith-number/5SY4UQVPJWSYN7TMBD3XTBMTIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS/action/storage_attestation","attest_author":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS/action/author_attestation","sign_citation":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS/action/citation_signature","submit_replication":"https://pith.science/pith/5SY4UQVPJWSYN7TMBD3XTBMTIS/action/replication_record"}},"created_at":"2026-05-18T00:18:42.791540+00:00","updated_at":"2026-05-18T00:18:42.791540+00:00"}