{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6ROAPG364Q42I4WFZT2VS2DT4X","short_pith_number":"pith:6ROAPG36","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"},"canonical_sha256":"f45c079b7ee439a472c5ccf5596873e5cfd8a79d8c5873a540ebd81ce1c7e7e0","source":{"kind":"arxiv","id":"1701.06669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06669","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06669v1","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06669","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"6ROAPG364Q42","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ROAPG364Q42I4WF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ROAPG36","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6ROAPG364Q42I4WFZT2VS2DT4X","target":"record","payload":{"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"},"canonical_sha256":"f45c079b7ee439a472c5ccf5596873e5cfd8a79d8c5873a540ebd81ce1c7e7e0","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"},"source_kind":"arxiv","source_id":"1701.06669","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:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K78CjYI+lybFX4EJNUtSdgkwt1aQ7SvpDNOYBkq05XE2CDi7llXS/zzvj8iWTqdS/T4T+QrV1LvmstTfMvciCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:48:47.591724Z"},"content_sha256":"db2a78dcd4d0712179b8d5e7889466f355f90d6e857f2e34cdd6374a1d430cf2","schema_version":"1.0","event_id":"sha256:db2a78dcd4d0712179b8d5e7889466f355f90d6e857f2e34cdd6374a1d430cf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6ROAPG364Q42I4WFZT2VS2DT4X","target":"graph","payload":{"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"},"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:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDV4wMQcio3AuG7lpaQFOLD1nW/kdusrbmkY9VWkTupdb4gEHUT+iTY+TSuLwr4TkdZL+nTrLtxkPJBuyR70Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:48:47.592430Z"},"content_sha256":"082f76dd36b8be5b455d111a64a9cbc424894373d1d58d2ec9b9e04927a5ca35","schema_version":"1.0","event_id":"sha256:082f76dd36b8be5b455d111a64a9cbc424894373d1d58d2ec9b9e04927a5ca35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/bundle.json","state_url":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ROAPG364Q42I4WFZT2VS2DT4X/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-05-31T17:48:47Z","links":{"resolver":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X","bundle":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/bundle.json","state":"https://pith.science/pith/6ROAPG364Q42I4WFZT2VS2DT4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ROAPG364Q42I4WFZT2VS2DT4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ROAPG364Q42I4WFZT2VS2DT4X","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":"89749b928ae2f5788bd1b1e6632daad8b5d5f317fac454882bce265037d6a849","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T23:00:48Z","title_canon_sha256":"e7db5eda0a4cdbffe56a22588d41d41bcc36061b40f1f5f9e20ddbb305961385"},"schema_version":"1.0","source":{"id":"1701.06669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06669","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06669v1","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06669","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"6ROAPG364Q42","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ROAPG364Q42I4WF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ROAPG36","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:082f76dd36b8be5b455d111a64a9cbc424894373d1d58d2ec9b9e04927a5ca35","target":"graph","created_at":"2026-05-18T00:52:12Z","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 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.","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T23:00:48Z","title":"Algorithmic complexity of proper labeling problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06669","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:db2a78dcd4d0712179b8d5e7889466f355f90d6e857f2e34cdd6374a1d430cf2","target":"record","created_at":"2026-05-18T00:52:12Z","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":"89749b928ae2f5788bd1b1e6632daad8b5d5f317fac454882bce265037d6a849","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-23T23:00:48Z","title_canon_sha256":"e7db5eda0a4cdbffe56a22588d41d41bcc36061b40f1f5f9e20ddbb305961385"},"schema_version":"1.0","source":{"id":"1701.06669","kind":"arxiv","version":1}},"canonical_sha256":"f45c079b7ee439a472c5ccf5596873e5cfd8a79d8c5873a540ebd81ce1c7e7e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f45c079b7ee439a472c5ccf5596873e5cfd8a79d8c5873a540ebd81ce1c7e7e0","first_computed_at":"2026-05-18T00:52:12.408261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:12.408261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/OsFO/3hXQFZcfNTLUA7u3Lk2mJQRFpy4yVyFcFTV3o0CX18sVR6+1GyaDoUS79sDft4lnffhfOQ4A2oOUiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:12.408675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db2a78dcd4d0712179b8d5e7889466f355f90d6e857f2e34cdd6374a1d430cf2","sha256:082f76dd36b8be5b455d111a64a9cbc424894373d1d58d2ec9b9e04927a5ca35"],"state_sha256":"19456196c2cc5e9d606e7235cd4fb91d959c743a4feecc86a83678a97005e872"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfs8RItnt9QzWqeo1+lbLsb5qcS0icY6eYWXwpP2NiDZY1r6f2b0PNaweDnT9VWDzWf21TANw0PsViGb8SHfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:48:47.596081Z","bundle_sha256":"c6de249a4b09f6bd466b63b251a3461899358f10667340b9c587c8913e955e0a"}}