{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3VSILOEAKL5VHBJHBMLIS5A3XF","short_pith_number":"pith:3VSILOEA","schema_version":"1.0","canonical_sha256":"dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607","source":{"kind":"arxiv","id":"1611.03181","version":1},"attestation_state":"computed","paper":{"title":"On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Mohsen Mollahajiaghaei","submitted_at":"2016-11-10T04:07:03Z","abstract_excerpt":"An assignment of numbers to the vertices of graph G is closed distinguishing if for any two adjacent vertices v and u the sum of labels of the vertices in the closed neighborhood of the vertex v differs from the sum of labels of the vertices in the closed neighborhood of the vertex u unless they have the same closed neighborhood (i.e. N[u]=N[v]). The closed distinguishing number of G, denoted by dis[G], is the smallest integer k such that there is a closed distinguishing labeling for G using integers from the set[k].Also, for each vertex $v \\in V(G)$, let L(v) denote a list of natural numbers "},"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":"1611.03181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T04:07:03Z","cross_cats_sorted":[],"title_canon_sha256":"7c5394eabd58a384f2745656140f4c96d62f1535c1e929ac727333f43b5054c3","abstract_canon_sha256":"b2a59c1eef69213e7c5cae145af306319e0048e258244b860857b175ed1caf71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:41.083839Z","signature_b64":"7et8tAM/9MeBli1G1Z4dFm4uI6fTF8hoT8Bz/ehgPnlOJ4ZS50fQ8r4IijNFeNOFU5c8Y32/rln2utz0QG+MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607","last_reissued_at":"2026-05-18T00:59:41.083131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:41.083131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Mohsen Mollahajiaghaei","submitted_at":"2016-11-10T04:07:03Z","abstract_excerpt":"An assignment of numbers to the vertices of graph G is closed distinguishing if for any two adjacent vertices v and u the sum of labels of the vertices in the closed neighborhood of the vertex v differs from the sum of labels of the vertices in the closed neighborhood of the vertex u unless they have the same closed neighborhood (i.e. N[u]=N[v]). The closed distinguishing number of G, denoted by dis[G], is the smallest integer k such that there is a closed distinguishing labeling for G using integers from the set[k].Also, for each vertex $v \\in V(G)$, let L(v) denote a list of natural numbers "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03181","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":"1611.03181","created_at":"2026-05-18T00:59:41.083288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03181v1","created_at":"2026-05-18T00:59:41.083288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03181","created_at":"2026-05-18T00:59:41.083288+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VSILOEAKL5V","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VSILOEAKL5VHBJH","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VSILOEA","created_at":"2026-05-18T12:29:58.707656+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/3VSILOEAKL5VHBJHBMLIS5A3XF","json":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF.json","graph_json":"https://pith.science/api/pith-number/3VSILOEAKL5VHBJHBMLIS5A3XF/graph.json","events_json":"https://pith.science/api/pith-number/3VSILOEAKL5VHBJHBMLIS5A3XF/events.json","paper":"https://pith.science/paper/3VSILOEA"},"agent_actions":{"view_html":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF","download_json":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF.json","view_paper":"https://pith.science/paper/3VSILOEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03181&json=true","fetch_graph":"https://pith.science/api/pith-number/3VSILOEAKL5VHBJHBMLIS5A3XF/graph.json","fetch_events":"https://pith.science/api/pith-number/3VSILOEAKL5VHBJHBMLIS5A3XF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/action/storage_attestation","attest_author":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/action/author_attestation","sign_citation":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/action/citation_signature","submit_replication":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/action/replication_record"}},"created_at":"2026-05-18T00:59:41.083288+00:00","updated_at":"2026-05-18T00:59:41.083288+00:00"}