{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HCG6RWYZJV423FOF3LOGMJTYUB","short_pith_number":"pith:HCG6RWYZ","schema_version":"1.0","canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","source":{"kind":"arxiv","id":"2605.14140","version":1},"attestation_state":"computed","paper":{"title":"A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\\&$ -2 isomorphic circulant graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vilfred Kamalappan, Wilson Peraprakash","submitted_at":"2026-05-13T21:46:47Z","abstract_excerpt":"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 of $C_n(R)$ w.r.t. $m$ $\\ni$ $m$ = $\\gcd(n, r) > 1$, $r\\in R$ and $r,n\\in\\mathbb{N}$ and studied such graphs for $m$ = 2 in \\cite{v13,v20}. But obtaining Type-2 isomorphic circulant graphs is not easy. Using a $C^{++}$ computer program, the authors obtained families of Type-2 isomorphic $C_{n}(R)$ w.r.t. $m$ = 2,3,5,7 for $n\\in\\mathbb{N}$ as well as $C_{np^3}(R)$ w.r.t. $m$ = $p$ for $n\\in\\mathbb{N}$ and $p$ is an odd pr"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14140","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:46:47Z","cross_cats_sorted":[],"title_canon_sha256":"6aa26622ab3e18b30aef5e43a430fce4e78a5e1ea948122020b557fc6fe79169","abstract_canon_sha256":"a24eba99ae13e454d966dcf22697201e2644886d98df17f3006cd9979efd6152"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.698210Z","signature_b64":"jEHkgU8+03OQ7tAD/Dlh8kH12CY0mUyChSXFEnr0duZeVtBOl5v6uzg49tRX4NsA8Um5amVW4gedQVUYqU+kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","last_reissued_at":"2026-05-17T23:39:11.697517Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.697517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\\&$ -2 isomorphic circulant graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vilfred Kamalappan, Wilson Peraprakash","submitted_at":"2026-05-13T21:46:47Z","abstract_excerpt":"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 of $C_n(R)$ w.r.t. $m$ $\\ni$ $m$ = $\\gcd(n, r) > 1$, $r\\in R$ and $r,n\\in\\mathbb{N}$ and studied such graphs for $m$ = 2 in \\cite{v13,v20}. But obtaining Type-2 isomorphic circulant graphs is not easy. Using a $C^{++}$ computer program, the authors obtained families of Type-2 isomorphic $C_{n}(R)$ w.r.t. $m$ = 2,3,5,7 for $n\\in\\mathbb{N}$ as well as $C_{np^3}(R)$ w.r.t. $m$ = $p$ for $n\\in\\mathbb{N}$ and $p$ is an odd pr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using a C++ computer program, the authors obtained families of Type-2 isomorphic C_n(R) w.r.t. m = 2,3,5,7 for n in natural numbers as well as C_{np^3}(R) w.r.t. m = p for odd prime p.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The programs correctly implement the definitions of Type-1 and Type-2 isomorphism from the cited prior papers without coding errors or missed cases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3c4b7273fb4780b744e493870b39e1c48eb7222fbcb3f194a5c11178bcaa4256"},"source":{"id":"2605.14140","kind":"arxiv","version":1},"verdict":{"id":"f0e42807-d5e7-4d54-82d7-7112bc309a50","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:11:18.171518Z","strongest_claim":"Using a C++ computer program, the authors obtained families of Type-2 isomorphic C_n(R) w.r.t. m = 2,3,5,7 for n in natural numbers as well as C_{np^3}(R) w.r.t. m = p for odd prime p.","one_line_summary":"Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The programs correctly implement the definitions of Type-1 and Type-2 isomorphism from the cited prior papers without coding errors or missed cases.","pith_extraction_headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p."},"references":{"count":25,"sample":[{"doi":"","year":1967,"title":"A. Adam,Research problem 2-10, J. Combinatorial Theory,3(1967), 393","work_id":"7a43d6b0-2dfb-4412-99ad-96186a8a7489","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Bjarne Stroustrup,The C++ Programming Language, Addison-Wesley, 2013","work_id":"49961b69-5f89-485d-ac7f-ca5f2637357c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1970,"title":"B. Elspas and J. Turner,Graphs with circulant adjacency matrices, J. Combinatorial Theory,9(1970), 297-307","work_id":"d1c668b3-b8ac-436d-9047-2408b9c6f3ec","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Fisher Larence,Visual Basic.NET: An Introduction to Computer Programming, Kendall Hunt Publishing, USA","work_id":"86224c76-0cff-4f7d-8663-c9d0f1dc3fd0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Martin Grohe and Pascal Schweitzer,The graph isomorphism problem, Communication ACM,63 (11)(2020), 128–","work_id":"0f860eba-400e-4d08-9161-3bf95d5c109c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"fbea74ca420ab9f471674ce151f899eef3eb38acedbcfe8fe2138442ae597731","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":"2605.14140","created_at":"2026-05-17T23:39:11.697628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14140v1","created_at":"2026-05-17T23:39:11.697628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14140","created_at":"2026-05-17T23:39:11.697628+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCG6RWYZJV42","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCG6RWYZJV423FOF","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCG6RWYZ","created_at":"2026-05-18T12:33:37.589309+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/HCG6RWYZJV423FOF3LOGMJTYUB","json":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB.json","graph_json":"https://pith.science/api/pith-number/HCG6RWYZJV423FOF3LOGMJTYUB/graph.json","events_json":"https://pith.science/api/pith-number/HCG6RWYZJV423FOF3LOGMJTYUB/events.json","paper":"https://pith.science/paper/HCG6RWYZ"},"agent_actions":{"view_html":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB","download_json":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB.json","view_paper":"https://pith.science/paper/HCG6RWYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14140&json=true","fetch_graph":"https://pith.science/api/pith-number/HCG6RWYZJV423FOF3LOGMJTYUB/graph.json","fetch_events":"https://pith.science/api/pith-number/HCG6RWYZJV423FOF3LOGMJTYUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/action/storage_attestation","attest_author":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/action/author_attestation","sign_citation":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/action/citation_signature","submit_replication":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/action/replication_record"}},"created_at":"2026-05-17T23:39:11.697628+00:00","updated_at":"2026-05-17T23:39:11.697628+00:00"}