{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7OWBKUFSTAIXSWPNOFWSNU2FMI","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":"371b67429ce83454db38f4afcbe88b52e5e0753bb40a78d607144227988536a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-18T14:26:27Z","title_canon_sha256":"594e22213e4fc08ed4b2ad00b9b439fa83f81c1d1b20cb1a33931bedecca5525"},"schema_version":"1.0","source":{"id":"2303.11985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.11985","created_at":"2026-07-05T05:53:24Z"},{"alias_kind":"arxiv_version","alias_value":"2303.11985v1","created_at":"2026-07-05T05:53:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11985","created_at":"2026-07-05T05:53:24Z"},{"alias_kind":"pith_short_12","alias_value":"7OWBKUFSTAIX","created_at":"2026-07-05T05:53:24Z"},{"alias_kind":"pith_short_16","alias_value":"7OWBKUFSTAIXSWPN","created_at":"2026-07-05T05:53:24Z"},{"alias_kind":"pith_short_8","alias_value":"7OWBKUFS","created_at":"2026-07-05T05:53:24Z"}],"graph_snapshots":[{"event_id":"sha256:7014c21979b4cd1959c8850be3d5e44f457cd65b83241d3a8bc5e2afe7f13864","target":"graph","created_at":"2026-07-05T05:53:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.11985/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph of order $n$ and $N = \\{N(u_{i})\\}^k_{i=1}$ be a sequence of neighbourhood(nbh)s in $G$ where $N(u)$ = $\\{v\\in V(G):$ $uv\\in E(G)\\}$. \\emph{Nbh sequence graph $H$ of} $N$ in $G$ is defined as the union of all induced subgraphs of closed nbh $N[u_{i}]$ in $G$, $1 \\leq i \\leq k$, $k\\in\\mathbb{N}$. A labeling $f: V(G) \\rightarrow \\left\\{1,2,\\ldots,n\\right\\} $ is called a \\emph{Distance Magic Labeling (DML)} of $G$ if ~ ${\\sum_{v \\in N(u)}} f(v) $ is a constant for every $u\\in V(G)$. $G$ is called a \\emph{Distance Magic graph (DMG)} if it has a DML, otherwise it is called a \\emp","authors_text":"Sajidha P, V. Vilfred Kamalappan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-18T14:26:27Z","title":"Finding Non-Distance Magic Graphs using neighbourhood chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11985","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:0940f78223f761b9e838b907efc3f5c45e6404ae9028610ba8149a5e300b23fc","target":"record","created_at":"2026-07-05T05:53:24Z","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":"371b67429ce83454db38f4afcbe88b52e5e0753bb40a78d607144227988536a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-18T14:26:27Z","title_canon_sha256":"594e22213e4fc08ed4b2ad00b9b439fa83f81c1d1b20cb1a33931bedecca5525"},"schema_version":"1.0","source":{"id":"2303.11985","kind":"arxiv","version":1}},"canonical_sha256":"fbac1550b298117959ed716d26d345622ec87fe0023a231e72ccc78ff118fb72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbac1550b298117959ed716d26d345622ec87fe0023a231e72ccc78ff118fb72","first_computed_at":"2026-07-05T05:53:24.329086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:53:24.329086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpwqQTIE2N9GUVIMX/KQ1EkiprHo6HU2sV/eeMy71VM9V5D2clGZzKP5Yo/56gLLfxuZFI3LIz4n1L23HtNvCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:53:24.329558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.11985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0940f78223f761b9e838b907efc3f5c45e6404ae9028610ba8149a5e300b23fc","sha256:7014c21979b4cd1959c8850be3d5e44f457cd65b83241d3a8bc5e2afe7f13864"],"state_sha256":"8fe6e17e47bad25869e21a3f34f7b672d43c2b6d101ccdf7b38288bf38d3a38d"}