{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FEBTN5GCLK2CVCZI5O6JPWM7YM","short_pith_number":"pith:FEBTN5GC","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"},"canonical_sha256":"290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2","source":{"kind":"arxiv","id":"1701.06685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06685","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06685v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06685","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"FEBTN5GCLK2C","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEBTN5GCLK2CVCZI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEBTN5GC","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FEBTN5GCLK2CVCZI5O6JPWM7YM","target":"record","payload":{"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"},"canonical_sha256":"290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2","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"},"source_kind":"arxiv","source_id":"1701.06685","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4htqHIfG3ygcvAUXlByfukUVx3FrLFxM6N5qRBdBUtxjtR00N7Er9N/5qGDQ/7QWW3KLwZKj5oPDDHfQsSnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:02:30.097355Z"},"content_sha256":"3eb957e53c299e49f8519e99fbf466687d8dbab2f943ae789706ec3e57151963","schema_version":"1.0","event_id":"sha256:3eb957e53c299e49f8519e99fbf466687d8dbab2f943ae789706ec3e57151963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FEBTN5GCLK2CVCZI5O6JPWM7YM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nh3giU5ETmIE2fSBGvzQNrCVirDL2cRhrnyKpvfNQ5EQaPG6jYP3VHVNVOAUdgphDELM/k0toocgD+ja2iubCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:02:30.097715Z"},"content_sha256":"5c57da92a004a857a6c7a113f4cb7ea98855f7f2cbaf3600da289fb10ca7ad55","schema_version":"1.0","event_id":"sha256:5c57da92a004a857a6c7a113f4cb7ea98855f7f2cbaf3600da289fb10ca7ad55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/bundle.json","state_url":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T17:02:30Z","links":{"resolver":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM","bundle":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/bundle.json","state":"https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FEBTN5GCLK2CVCZI5O6JPWM7YM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65a6cc16d33732edbf36c37fbc8b84b6586aba1b354e2a961128b3b87ca70b82","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T23:49:48Z","title_canon_sha256":"92c9a3fa73364e959a9268f239ad40bf575fdf7714921062ece49883bf70999c"},"schema_version":"1.0","source":{"id":"1701.06685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06685","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06685v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06685","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"FEBTN5GCLK2C","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEBTN5GCLK2CVCZI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEBTN5GC","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:5c57da92a004a857a6c7a113f4cb7ea98855f7f2cbaf3600da289fb10ca7ad55","target":"graph","created_at":"2026-05-18T00:51:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ali Dehghan, Arash Ahadi, Morteza Saghafian","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T23:49:48Z","title":"Is there any polynomial upper bound for the universal labeling of graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06685","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3eb957e53c299e49f8519e99fbf466687d8dbab2f943ae789706ec3e57151963","target":"record","created_at":"2026-05-18T00:51:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"65a6cc16d33732edbf36c37fbc8b84b6586aba1b354e2a961128b3b87ca70b82","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T23:49:48Z","title_canon_sha256":"92c9a3fa73364e959a9268f239ad40bf575fdf7714921062ece49883bf70999c"},"schema_version":"1.0","source":{"id":"1701.06685","kind":"arxiv","version":1}},"canonical_sha256":"290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2","first_computed_at":"2026-05-18T00:51:29.894591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:29.894591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHMWgfp6095aAmp6R2qjhivEPAuCdbjTT84bNYlVzUQdZnTYfD6P/WnCEg3p7UDg0UBHXp+HhlTJu7gpZsXrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:29.895024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eb957e53c299e49f8519e99fbf466687d8dbab2f943ae789706ec3e57151963","sha256:5c57da92a004a857a6c7a113f4cb7ea98855f7f2cbaf3600da289fb10ca7ad55"],"state_sha256":"6fe8ed3123190ef653dc7bcd91547c09527e5371a66adc0650bfb8656c6f237d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFTWGTTGJPcygpSh7bobXZH3hLjjcUs5UWyXlciWWGEozuhwZi3IWFupqIjfL1O0fG7LGGtU1Mx2jN/4GfPJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:02:30.099880Z","bundle_sha256":"f2b4047a9516d770a9e6d4829c7cac7c490e0e08f608c2ce74d427f3d0aaa10c"}}