{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6L3YAZMYDZT4DLK3S4KGHAQBUK","short_pith_number":"pith:6L3YAZMY","schema_version":"1.0","canonical_sha256":"f2f78065981e67c1ad5b9714638201a29857f8a3d14fcb210132abef4e3527c8","source":{"kind":"arxiv","id":"2012.11372","version":11},"attestation_state":"computed","paper":{"title":"A study on Type-2 isomorphic circulant graphs and related Abelian groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"V. Vilfred Kamalappan","submitted_at":"2020-12-18T06:27:28Z","abstract_excerpt":"Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \\emph{Adam's isomorphic} if there exist some $a\\in \\mathbb{Z}_n^*$ such that $S = a R$ under arithmetic reflexive modulo $n$. In 1970, Elspas and Turner \\cite{eltu} raised a question on the isomorphism of $C_{16}(1, 3, 7)$ and $C_{16}(2, 3, 5)$ and Vilfred \\cite{v96} gave its answer by defining Type-2 isomorphism, different from Adam's isomorphism or Type-1 isomorphism, of $C_n(R)$ w.r.t. $m$ where $m > 1$ is a divisor of $\\gcd(n, r)$ and $r\\in R$. This paper is an extensive study on Type-2 isomorphic circulant graphs. Vilfred and Wilson \\c"},"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":"2012.11372","kind":"arxiv","version":11},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-12-18T06:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"0cf69c67e49377b9580b3c832810b6d9c31e65d147cdbd16fe05b6e3df04e9d9","abstract_canon_sha256":"230341ba97838ff973fe327fa93ce65249f5bb9d77136669bed941c69ae857b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:13.174495Z","signature_b64":"aGvQySBaQKupVT0X+puBgpI6UuxNVUCBYbL9zKv+KfDAEIk2fFykvjCtEJ+uXruTZhsU+8QXeaXjqOdNiVmODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2f78065981e67c1ad5b9714638201a29857f8a3d14fcb210132abef4e3527c8","last_reissued_at":"2026-07-05T09:40:13.174066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:13.174066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study on Type-2 isomorphic circulant graphs and related Abelian groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"V. Vilfred Kamalappan","submitted_at":"2020-12-18T06:27:28Z","abstract_excerpt":"Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \\emph{Adam's isomorphic} if there exist some $a\\in \\mathbb{Z}_n^*$ such that $S = a R$ under arithmetic reflexive modulo $n$. In 1970, Elspas and Turner \\cite{eltu} raised a question on the isomorphism of $C_{16}(1, 3, 7)$ and $C_{16}(2, 3, 5)$ and Vilfred \\cite{v96} gave its answer by defining Type-2 isomorphism, different from Adam's isomorphism or Type-1 isomorphism, of $C_n(R)$ w.r.t. $m$ where $m > 1$ is a divisor of $\\gcd(n, r)$ and $r\\in R$. This paper is an extensive study on Type-2 isomorphic circulant graphs. Vilfred and Wilson \\c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.11372","kind":"arxiv","version":11},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.11372/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2012.11372","created_at":"2026-07-05T09:40:13.174124+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.11372v11","created_at":"2026-07-05T09:40:13.174124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.11372","created_at":"2026-07-05T09:40:13.174124+00:00"},{"alias_kind":"pith_short_12","alias_value":"6L3YAZMYDZT4","created_at":"2026-07-05T09:40:13.174124+00:00"},{"alias_kind":"pith_short_16","alias_value":"6L3YAZMYDZT4DLK3","created_at":"2026-07-05T09:40:13.174124+00:00"},{"alias_kind":"pith_short_8","alias_value":"6L3YAZMY","created_at":"2026-07-05T09:40:13.174124+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20984","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 7: Isomorphism series, digraph and graph of $C_n(R)$","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2211.06970","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 10: Type-2 isomorphic $C_{np^3}(R)$ w.r.t. $m$ = $p$ and related groups","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2508.09384","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14140","citing_title":"A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\\&$ -2 isomorphic circulant graphs","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14402","citing_title":"A Study on Type-2 Isomorphic Circulant Graphs: Part 8: $C_{432}(R)$, $C_{6750}(S)$ -- each has 2 types of Type-2 isomorphic circulant graphs","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12859","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs $C_{54}(R)$","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12868","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups $(T2_{n,m}(C_n(R)), \\circ)$ and $(V_{n,m}(C_n(R)), \\circ)$","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12390","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11441","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs $C_n(R)$ w.r.t. $m$ = 2","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11466","citing_title":"A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs $C_{32}(R)$","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK","json":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK.json","graph_json":"https://pith.science/api/pith-number/6L3YAZMYDZT4DLK3S4KGHAQBUK/graph.json","events_json":"https://pith.science/api/pith-number/6L3YAZMYDZT4DLK3S4KGHAQBUK/events.json","paper":"https://pith.science/paper/6L3YAZMY"},"agent_actions":{"view_html":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK","download_json":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK.json","view_paper":"https://pith.science/paper/6L3YAZMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.11372&json=true","fetch_graph":"https://pith.science/api/pith-number/6L3YAZMYDZT4DLK3S4KGHAQBUK/graph.json","fetch_events":"https://pith.science/api/pith-number/6L3YAZMYDZT4DLK3S4KGHAQBUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK/action/storage_attestation","attest_author":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK/action/author_attestation","sign_citation":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK/action/citation_signature","submit_replication":"https://pith.science/pith/6L3YAZMYDZT4DLK3S4KGHAQBUK/action/replication_record"}},"created_at":"2026-07-05T09:40:13.174124+00:00","updated_at":"2026-07-05T09:40:13.174124+00:00"}