{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:P5TWSAVK5HBJW6JJXG4VP2LBF4","short_pith_number":"pith:P5TWSAVK","canonical_record":{"source":{"id":"2605.12859","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T01:09:40Z","cross_cats_sorted":[],"title_canon_sha256":"ab08a782e03e64e741be3da9f55e1d33e0ea5d1c50ca3d86a182cea08011a438","abstract_canon_sha256":"7778b5160a87457f185353c153b995a30fb50a3d7db76c1a3a6c59ccf46393da"},"schema_version":"1.0"},"canonical_sha256":"7f676902aae9c29b7929b9b957e9612f03a4b52cd275bb0f864b0c41b908bac2","source":{"kind":"arxiv","id":"2605.12859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12859","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12859v1","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12859","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"P5TWSAVK5HBJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5TWSAVK5HBJW6JJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5TWSAVK","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:P5TWSAVK5HBJW6JJXG4VP2LBF4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12859","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T01:09:40Z","cross_cats_sorted":[],"title_canon_sha256":"ab08a782e03e64e741be3da9f55e1d33e0ea5d1c50ca3d86a182cea08011a438","abstract_canon_sha256":"7778b5160a87457f185353c153b995a30fb50a3d7db76c1a3a6c59ccf46393da"},"schema_version":"1.0"},"canonical_sha256":"7f676902aae9c29b7929b9b957e9612f03a4b52cd275bb0f864b0c41b908bac2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:11.683700Z","signature_b64":"MNZqPRH620Eup7OiN/3eAu+dCxNZVDJVauqjnzBjOceljKZYs4YjeuKMZ+O7O/uDcg+OqZbn/RdP32pTIsIVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f676902aae9c29b7929b9b957e9612f03a4b52cd275bb0f864b0c41b908bac2","last_reissued_at":"2026-05-18T03:09:11.683059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:11.683059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12859","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-18T03:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvrgIA1Klqt/WPgMyPQ3gT/OfemwU4w8iKAp4/vbu749ig9jfWkJSNe/+PlQzXJLSedBEKV9LGc3BrDRcO5HCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:30:26.242347Z"},"content_sha256":"0deba36489e369e823d523ca46ba4b603af658c3268f2c9e93508f73fc6e3abf","schema_version":"1.0","event_id":"sha256:0deba36489e369e823d523ca46ba4b603af658c3268f2c9e93508f73fc6e3abf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:P5TWSAVK5HBJW6JJXG4VP2LBF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs $C_{54}(R)$","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"There are 960 triples of Type-2 isomorphic circulant graphs of order 54, each with respect to m=3.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vilfred Kamalappan","submitted_at":"2026-05-13T01:09:40Z","abstract_excerpt":"This study is the $4^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \\cite{v2-1}-\\cite{v2-10} and is a continuation of Part 3. Here, we study Type-2 isomorphic circulant graphs of order 54 and show that there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. $m$ = 3."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. m = 3.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The enumeration procedure from the prior parts of the series correctly and exhaustively identifies all Type-2 isomorphic triples for order 54 without omissions or duplicates.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"There are 960 triples of Type-2 isomorphic circulant graphs C_54(R) where each triple is Type-2 isomorphic with m=3.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"There are 960 triples of Type-2 isomorphic circulant graphs of order 54, each with respect to m=3.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b8972c6591496d02b102118798b4fbd36066589fe50982004f5ce900cb4a0f36"},"source":{"id":"2605.12859","kind":"arxiv","version":1},"verdict":{"id":"4cddb92b-514b-4503-a227-6aa2a79861ff","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:59:15.212882Z","strongest_claim":"there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. m = 3.","one_line_summary":"There are 960 triples of Type-2 isomorphic circulant graphs C_54(R) where each triple is Type-2 isomorphic with m=3.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The enumeration procedure from the prior parts of the series correctly and exhaustively identifies all Type-2 isomorphic triples for order 54 without omissions or duplicates.","pith_extraction_headline":"There are 960 triples of Type-2 isomorphic circulant graphs of order 54, each with respect to m=3."},"references":{"count":300,"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":2025,"title":"A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27","work_id":"42c7711b-bade-47a4-b14f-0e077a709d72","ref_index":2,"cited_arxiv_id":"2508.09384","is_internal_anchor":true},{"doi":"","year":2012,"title":"Vilfred Kamalappan,A study on Type-2 Isomorphic Circulant Graphs and related Abelian Groups, arXiv: 2012.11372v11 [math.CO] (26 Nov","work_id":"8bcf1163-569c-489a-acfd-b8dd2b05b76b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Vilfred Kamalappan,A study on Type-2 Isomorphic Circulant Graphs","work_id":"6630474f-1883-45ef-a104-4c72043b4ff9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Vilfred Kamalappan,A study on Type-2 isomorphic circulant graphs","work_id":"e1738b37-a5e0-46f9-96a8-a629d385ccc8","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":300,"snapshot_sha256":"04d636ab2948747794e78b09aa2ab4d7db33d36fa5e3c06c90365e9e30e895e2","internal_anchors":1},"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":"4cddb92b-514b-4503-a227-6aa2a79861ff"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7puwlJs209SOlIMVn2KlYNsXMnzxnSeFXxr3wHidQJaGhcpFAVD7O9+ByMuOv50NfnWrPyhbF+ICIFpOkpICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:30:26.243400Z"},"content_sha256":"a115d440ec6eea8eaa6e89ad7f91d1f9a9ed311a988d5dc273d585f596406929","schema_version":"1.0","event_id":"sha256:a115d440ec6eea8eaa6e89ad7f91d1f9a9ed311a988d5dc273d585f596406929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4/bundle.json","state_url":"https://pith.science/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4/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-05-27T04:30:26Z","links":{"resolver":"https://pith.science/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4","bundle":"https://pith.science/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4/bundle.json","state":"https://pith.science/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5TWSAVK5HBJW6JJXG4VP2LBF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P5TWSAVK5HBJW6JJXG4VP2LBF4","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":"7778b5160a87457f185353c153b995a30fb50a3d7db76c1a3a6c59ccf46393da","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T01:09:40Z","title_canon_sha256":"ab08a782e03e64e741be3da9f55e1d33e0ea5d1c50ca3d86a182cea08011a438"},"schema_version":"1.0","source":{"id":"2605.12859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12859","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12859v1","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12859","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"P5TWSAVK5HBJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5TWSAVK5HBJW6JJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5TWSAVK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a115d440ec6eea8eaa6e89ad7f91d1f9a9ed311a988d5dc273d585f596406929","target":"graph","created_at":"2026-05-18T03:09:11Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. m = 3."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The enumeration procedure from the prior parts of the series correctly and exhaustively identifies all Type-2 isomorphic triples for order 54 without omissions or duplicates."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"There are 960 triples of Type-2 isomorphic circulant graphs C_54(R) where each triple is Type-2 isomorphic with m=3."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"There are 960 triples of Type-2 isomorphic circulant graphs of order 54, each with respect to m=3."}],"snapshot_sha256":"b8972c6591496d02b102118798b4fbd36066589fe50982004f5ce900cb4a0f36"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This study is the $4^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \\cite{v2-1}-\\cite{v2-10} and is a continuation of Part 3. Here, we study Type-2 isomorphic circulant graphs of order 54 and show that there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. $m$ = 3.","authors_text":"Vilfred Kamalappan","cross_cats":[],"headline":"There are 960 triples of Type-2 isomorphic circulant graphs of order 54, each with respect to m=3.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T01:09:40Z","title":"A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs $C_{54}(R)$"},"references":{"count":300,"internal_anchors":1,"resolved_work":300,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Adam,Research problem 2-10, J. Combinatorial Theory,3(1967), 393","work_id":"7a43d6b0-2dfb-4412-99ad-96186a8a7489","year":1967},{"cited_arxiv_id":"2508.09384","doi":"","is_internal_anchor":true,"ref_index":2,"title":"A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27","work_id":"42c7711b-bade-47a4-b14f-0e077a709d72","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Vilfred Kamalappan,A study on Type-2 Isomorphic Circulant Graphs and related Abelian Groups, arXiv: 2012.11372v11 [math.CO] (26 Nov","work_id":"8bcf1163-569c-489a-acfd-b8dd2b05b76b","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Vilfred Kamalappan,A study on Type-2 Isomorphic Circulant Graphs","work_id":"6630474f-1883-45ef-a104-4c72043b4ff9","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Vilfred Kamalappan,A study on Type-2 isomorphic circulant graphs","work_id":"e1738b37-a5e0-46f9-96a8-a629d385ccc8","year":null}],"snapshot_sha256":"04d636ab2948747794e78b09aa2ab4d7db33d36fa5e3c06c90365e9e30e895e2"},"source":{"id":"2605.12859","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:59:15.212882Z","id":"4cddb92b-514b-4503-a227-6aa2a79861ff","model_set":{"reader":"grok-4.3"},"one_line_summary":"There are 960 triples of Type-2 isomorphic circulant graphs C_54(R) where each triple is Type-2 isomorphic with m=3.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"There are 960 triples of Type-2 isomorphic circulant graphs of order 54, each with respect to m=3.","strongest_claim":"there are 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. m = 3.","weakest_assumption":"The enumeration procedure from the prior parts of the series correctly and exhaustively identifies all Type-2 isomorphic triples for order 54 without omissions or duplicates."}},"verdict_id":"4cddb92b-514b-4503-a227-6aa2a79861ff"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0deba36489e369e823d523ca46ba4b603af658c3268f2c9e93508f73fc6e3abf","target":"record","created_at":"2026-05-18T03:09:11Z","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":"7778b5160a87457f185353c153b995a30fb50a3d7db76c1a3a6c59ccf46393da","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T01:09:40Z","title_canon_sha256":"ab08a782e03e64e741be3da9f55e1d33e0ea5d1c50ca3d86a182cea08011a438"},"schema_version":"1.0","source":{"id":"2605.12859","kind":"arxiv","version":1}},"canonical_sha256":"7f676902aae9c29b7929b9b957e9612f03a4b52cd275bb0f864b0c41b908bac2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f676902aae9c29b7929b9b957e9612f03a4b52cd275bb0f864b0c41b908bac2","first_computed_at":"2026-05-18T03:09:11.683059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:11.683059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MNZqPRH620Eup7OiN/3eAu+dCxNZVDJVauqjnzBjOceljKZYs4YjeuKMZ+O7O/uDcg+OqZbn/RdP32pTIsIVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:11.683700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0deba36489e369e823d523ca46ba4b603af658c3268f2c9e93508f73fc6e3abf","sha256:a115d440ec6eea8eaa6e89ad7f91d1f9a9ed311a988d5dc273d585f596406929"],"state_sha256":"681cff24417bdb2d3fee9583f7aec02e9716f354b6a42371e532300010d20f1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UJVX/UVpGT5dKZkEFInQ1jzL8l4xo7sfpdhx8IhaL/OFdBOWJGRgLeOomrNT0ndVZZz7pv1akLTLraP3pDiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:30:26.247968Z","bundle_sha256":"bf5a1db8cc5735a10ffaf5580e8f6e1d7a53b46c2a68c13a8850b9fa882f931d"}}