{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FEBTN5GCLK2CVCZI5O6JPWM7YM","short_pith_number":"pith:FEBTN5GC","schema_version":"1.0","canonical_sha256":"290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2","source":{"kind":"arxiv","id":"1701.06685","version":1},"attestation_state":"computed","paper":{"title":"Is there any polynomial upper bound for the universal labeling of graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi, Morteza Saghafian","submitted_at":"2017-01-23T23:49:48Z","abstract_excerpt":"A {\\it universal labeling} of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $\\ell$ of $G$ for every two adjacent vertices $v$ and $u$, the sum of incoming edges of $v$ and $u$ in the oriented graph are different from each other. The {\\it universal labeling number} of a graph $G$ is the minimum number $k$ such that $G$ has {\\it universal labeling} from $\\{1,2,\\ldots, k\\}$ denoted it by $\\overrightarrow{\\chi_{u}}(G) $. We have $2\\Delta(G)-2 \\leq \\overrightarrow{\\chi_{u}} (G)\\leq 2^{\\Delta(G)}$, where $\\Delta(G)$ denotes the maximum degree of $G$. In this work, w"},"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":"1701.06685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T23:49:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"92c9a3fa73364e959a9268f239ad40bf575fdf7714921062ece49883bf70999c","abstract_canon_sha256":"65a6cc16d33732edbf36c37fbc8b84b6586aba1b354e2a961128b3b87ca70b82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.895024Z","signature_b64":"pHMWgfp6095aAmp6R2qjhivEPAuCdbjTT84bNYlVzUQdZnTYfD6P/WnCEg3p7UDg0UBHXp+HhlTJu7gpZsXrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2","last_reissued_at":"2026-05-18T00:51:29.894591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.894591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is there any polynomial upper bound for the universal labeling of graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi, Morteza Saghafian","submitted_at":"2017-01-23T23:49:48Z","abstract_excerpt":"A {\\it universal labeling} of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $\\ell$ of $G$ for every two adjacent vertices $v$ and $u$, the sum of incoming edges of $v$ and $u$ in the oriented graph are different from each other. The {\\it universal labeling number} of a graph $G$ is the minimum number $k$ such that $G$ has {\\it universal labeling} from $\\{1,2,\\ldots, k\\}$ denoted it by $\\overrightarrow{\\chi_{u}}(G) $. We have $2\\Delta(G)-2 \\leq \\overrightarrow{\\chi_{u}} (G)\\leq 2^{\\Delta(G)}$, where $\\Delta(G)$ denotes the maximum degree of $G$. In this work, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06685","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":"1701.06685","created_at":"2026-05-18T00:51:29.894647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06685v1","created_at":"2026-05-18T00:51:29.894647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06685","created_at":"2026-05-18T00:51:29.894647+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEBTN5GCLK2C","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEBTN5GCLK2CVCZI","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEBTN5GC","created_at":"2026-05-18T12:31:15.632608+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/FEBTN5GCLK2CVCZI5O6JPWM7YM","json":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM.json","graph_json":"https://pith.science/api/pith-number/FEBTN5GCLK2CVCZI5O6JPWM7YM/graph.json","events_json":"https://pith.science/api/pith-number/FEBTN5GCLK2CVCZI5O6JPWM7YM/events.json","paper":"https://pith.science/paper/FEBTN5GC"},"agent_actions":{"view_html":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM","download_json":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM.json","view_paper":"https://pith.science/paper/FEBTN5GC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06685&json=true","fetch_graph":"https://pith.science/api/pith-number/FEBTN5GCLK2CVCZI5O6JPWM7YM/graph.json","fetch_events":"https://pith.science/api/pith-number/FEBTN5GCLK2CVCZI5O6JPWM7YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/action/storage_attestation","attest_author":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/action/author_attestation","sign_citation":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/action/citation_signature","submit_replication":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/action/replication_record"}},"created_at":"2026-05-18T00:51:29.894647+00:00","updated_at":"2026-05-18T00:51:29.894647+00:00"}