{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OJZMF2RHTX7RRVHSAHCTQDUBQW","short_pith_number":"pith:OJZMF2RH","schema_version":"1.0","canonical_sha256":"7272c2ea279dff18d4f201c5380e8185ade9110c5bdc97729fc9d9f5a9734bbd","source":{"kind":"arxiv","id":"1511.04520","version":2},"attestation_state":"computed","paper":{"title":"On Transiso Graphs of Groups of order less than 32","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Brajesh Kumar Sharma, Laxmi Kant Mishra","submitted_at":"2015-11-14T06:40:12Z","abstract_excerpt":"Transiso graph $\\Gamma_d(G)$ is defined in for a finite group $G$ and a divisor $d$ of $|G|$. In the present paper, we have determined some finite groups $G$ for which the graphs $\\Gamma_d(G)$ are complete for each divisor $d$ of $|G|$. We have also discussed the completeness of transiso graphs for the groups of order less than $32$."},"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":"1511.04520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-14T06:40:12Z","cross_cats_sorted":[],"title_canon_sha256":"ca5b9a7a2c2d5011199785b88c57b9ae8a74e14d9d99a5786ad665c22b4163a0","abstract_canon_sha256":"446889326d944966ae1dd04001a1e06a19b254d937234fbbcc753d37ea12352b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:52.963726Z","signature_b64":"Fw5HfnxR+7at0Bm7yKM3Ay2Lp5tnBQAeqV35T34yRgSs27ndZAk7vAxbQczRVFVbpBpgrZ4lRe15K1PA+7PIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7272c2ea279dff18d4f201c5380e8185ade9110c5bdc97729fc9d9f5a9734bbd","last_reissued_at":"2026-05-18T00:54:52.963311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:52.963311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Transiso Graphs of Groups of order less than 32","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Brajesh Kumar Sharma, Laxmi Kant Mishra","submitted_at":"2015-11-14T06:40:12Z","abstract_excerpt":"Transiso graph $\\Gamma_d(G)$ is defined in for a finite group $G$ and a divisor $d$ of $|G|$. In the present paper, we have determined some finite groups $G$ for which the graphs $\\Gamma_d(G)$ are complete for each divisor $d$ of $|G|$. We have also discussed the completeness of transiso graphs for the groups of order less than $32$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04520","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1511.04520","created_at":"2026-05-18T00:54:52.963375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04520v2","created_at":"2026-05-18T00:54:52.963375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04520","created_at":"2026-05-18T00:54:52.963375+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJZMF2RHTX7R","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJZMF2RHTX7RRVHS","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJZMF2RH","created_at":"2026-05-18T12:29:34.919912+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/OJZMF2RHTX7RRVHSAHCTQDUBQW","json":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW.json","graph_json":"https://pith.science/api/pith-number/OJZMF2RHTX7RRVHSAHCTQDUBQW/graph.json","events_json":"https://pith.science/api/pith-number/OJZMF2RHTX7RRVHSAHCTQDUBQW/events.json","paper":"https://pith.science/paper/OJZMF2RH"},"agent_actions":{"view_html":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW","download_json":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW.json","view_paper":"https://pith.science/paper/OJZMF2RH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04520&json=true","fetch_graph":"https://pith.science/api/pith-number/OJZMF2RHTX7RRVHSAHCTQDUBQW/graph.json","fetch_events":"https://pith.science/api/pith-number/OJZMF2RHTX7RRVHSAHCTQDUBQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW/action/storage_attestation","attest_author":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW/action/author_attestation","sign_citation":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW/action/citation_signature","submit_replication":"https://pith.science/pith/OJZMF2RHTX7RRVHSAHCTQDUBQW/action/replication_record"}},"created_at":"2026-05-18T00:54:52.963375+00:00","updated_at":"2026-05-18T00:54:52.963375+00:00"}