{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ROAPG364Q42I4WFZT2VS2DT4X","short_pith_number":"pith:6ROAPG36","schema_version":"1.0","canonical_sha256":"f45c079b7ee439a472c5ccf5596873e5cfd8a79d8c5873a540ebd81ce1c7e7e0","source":{"kind":"arxiv","id":"1701.06669","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic complexity of proper labeling problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","submitted_at":"2017-01-23T23:00:48Z","abstract_excerpt":"A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the proper labeling problems, we present some polynomial time algorithms and $ \\mathbf{NP} $-completeness results for them."},"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.06669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T23:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"e7db5eda0a4cdbffe56a22588d41d41bcc36061b40f1f5f9e20ddbb305961385","abstract_canon_sha256":"89749b928ae2f5788bd1b1e6632daad8b5d5f317fac454882bce265037d6a849"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.408675Z","signature_b64":"q/OsFO/3hXQFZcfNTLUA7u3Lk2mJQRFpy4yVyFcFTV3o0CX18sVR6+1GyaDoUS79sDft4lnffhfOQ4A2oOUiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45c079b7ee439a472c5ccf5596873e5cfd8a79d8c5873a540ebd81ce1c7e7e0","last_reissued_at":"2026-05-18T00:52:12.408261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.408261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic complexity of proper labeling problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","submitted_at":"2017-01-23T23:00:48Z","abstract_excerpt":"A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the proper labeling problems, we present some polynomial time algorithms and $ \\mathbf{NP} $-completeness results for them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06669","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.06669","created_at":"2026-05-18T00:52:12.408310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06669v1","created_at":"2026-05-18T00:52:12.408310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06669","created_at":"2026-05-18T00:52:12.408310+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ROAPG364Q42","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ROAPG364Q42I4WF","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ROAPG36","created_at":"2026-05-18T12:31:03.183658+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/6ROAPG364Q42I4WFZT2VS2DT4X","json":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X.json","graph_json":"https://pith.science/api/pith-number/6ROAPG364Q42I4WFZT2VS2DT4X/graph.json","events_json":"https://pith.science/api/pith-number/6ROAPG364Q42I4WFZT2VS2DT4X/events.json","paper":"https://pith.science/paper/6ROAPG36"},"agent_actions":{"view_html":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X","download_json":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X.json","view_paper":"https://pith.science/paper/6ROAPG36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06669&json=true","fetch_graph":"https://pith.science/api/pith-number/6ROAPG364Q42I4WFZT2VS2DT4X/graph.json","fetch_events":"https://pith.science/api/pith-number/6ROAPG364Q42I4WFZT2VS2DT4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/action/storage_attestation","attest_author":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/action/author_attestation","sign_citation":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/action/citation_signature","submit_replication":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/action/replication_record"}},"created_at":"2026-05-18T00:52:12.408310+00:00","updated_at":"2026-05-18T00:52:12.408310+00:00"}