Pith. Sign in

RECORD

On Distance Magic Harary Graphs

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
A V Prajeesh, Krishnan Paramasivam

Combinatorics · Submitted 19 Sep 2018

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1809.07382 (version 1)
Pith ID3DFQUSZA, Pith's permanent record of this paper and its review
CitationA V Prajeesh, Krishnan Paramasivam. "On Distance Magic Harary Graphs." arXiv:1809.07382 (2018). https://pith.science/paper/3DFQUSZA
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 1,703 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.40 · human participants 0.01 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.16 · compares with prior results 0.09 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1. contribution 0.99 0.95 0.89 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.70 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites

Cites as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.