{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3VSILOEAKL5VHBJHBMLIS5A3XF","short_pith_number":"pith:3VSILOEA","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"},"canonical_sha256":"dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607","source":{"kind":"arxiv","id":"1611.03181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03181","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03181v1","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03181","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"3VSILOEAKL5V","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3VSILOEAKL5VHBJH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3VSILOEA","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3VSILOEAKL5VHBJHBMLIS5A3XF","target":"record","payload":{"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"},"canonical_sha256":"dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607","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"},"source_kind":"arxiv","source_id":"1611.03181","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:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8NSJiMM9prCz57yWcvpl2lc2HBgCx1kPv0Swl2NmmKzt+1rRRn086CHPh6CSMgiBgAobRT91R1f9vAQbzGfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:24:36.241276Z"},"content_sha256":"a652da53f6c9f497dc8918c6807d39639f3dbc6559fe54974be5b3798ee4293e","schema_version":"1.0","event_id":"sha256:a652da53f6c9f497dc8918c6807d39639f3dbc6559fe54974be5b3798ee4293e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3VSILOEAKL5VHBJHBMLIS5A3XF","target":"graph","payload":{"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"},"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:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SuYA7y2OIPAzgTmxowH+bTb8tydv+AW78FR3PXjMg2NJpZT1i8OXBIvaFZiOfksE09hU225NA9QV/bEaqI5qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:24:36.241938Z"},"content_sha256":"9d5cf2d474161458725bf01b82cb55b77970d2bec41895d288cfc34bbf48ed04","schema_version":"1.0","event_id":"sha256:9d5cf2d474161458725bf01b82cb55b77970d2bec41895d288cfc34bbf48ed04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/bundle.json","state_url":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/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-02T14:24:36Z","links":{"resolver":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF","bundle":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/bundle.json","state":"https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VSILOEAKL5VHBJHBMLIS5A3XF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3VSILOEAKL5VHBJHBMLIS5A3XF","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":"b2a59c1eef69213e7c5cae145af306319e0048e258244b860857b175ed1caf71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T04:07:03Z","title_canon_sha256":"7c5394eabd58a384f2745656140f4c96d62f1535c1e929ac727333f43b5054c3"},"schema_version":"1.0","source":{"id":"1611.03181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03181","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03181v1","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03181","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"3VSILOEAKL5V","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3VSILOEAKL5VHBJH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3VSILOEA","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:9d5cf2d474161458725bf01b82cb55b77970d2bec41895d288cfc34bbf48ed04","target":"graph","created_at":"2026-05-18T00:59:41Z","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":"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 ","authors_text":"Ali Dehghan, Mohsen Mollahajiaghaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T04:07:03Z","title":"On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03181","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:a652da53f6c9f497dc8918c6807d39639f3dbc6559fe54974be5b3798ee4293e","target":"record","created_at":"2026-05-18T00:59:41Z","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":"b2a59c1eef69213e7c5cae145af306319e0048e258244b860857b175ed1caf71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T04:07:03Z","title_canon_sha256":"7c5394eabd58a384f2745656140f4c96d62f1535c1e929ac727333f43b5054c3"},"schema_version":"1.0","source":{"id":"1611.03181","kind":"arxiv","version":1}},"canonical_sha256":"dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607","first_computed_at":"2026-05-18T00:59:41.083131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:41.083131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7et8tAM/9MeBli1G1Z4dFm4uI6fTF8hoT8Bz/ehgPnlOJ4ZS50fQ8r4IijNFeNOFU5c8Y32/rln2utz0QG+MAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:41.083839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a652da53f6c9f497dc8918c6807d39639f3dbc6559fe54974be5b3798ee4293e","sha256:9d5cf2d474161458725bf01b82cb55b77970d2bec41895d288cfc34bbf48ed04"],"state_sha256":"40cdc4226c9998fb8d64e851149007a90af6676f79b63121e2ba30d0e48666bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4ieqBRJW/Ry2bmjz/urJd4OVy1ujNxkNqK3+12bQWGJr22ZdeJpkB+kg6oHiLKiE2YMtD2//0w6XmJNQ5weCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:24:36.245197Z","bundle_sha256":"1a7a59a1bacce3cfd278fb28e7e24b2a8315b3f58d84486c643609cce55e5487"}}