{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W6E44GLYUTEQGDSATYDRFLXYTF","short_pith_number":"pith:W6E44GLY","schema_version":"1.0","canonical_sha256":"b789ce1978a4c9030e409e0712aef8995c206e3b603f7953eb59e4f80435dc05","source":{"kind":"arxiv","id":"1611.04280","version":3},"attestation_state":"computed","paper":{"title":"Order divisor graphs of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Abdul Qudair Baig, Muhammad Imran, Shafiq ur Rehman, Zia Ullah Khan","submitted_at":"2016-11-14T08:18:06Z","abstract_excerpt":"The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having different orders are adjacent provided that o(a) divides o(b) or o(b) divides o(a)."},"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":"1611.04280","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T08:18:06Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"7d291073d8e85a71cdc45e0c8199fc21b82b41b209a78a07e3b1adfbcdeefab4","abstract_canon_sha256":"74d12f1b47977c81ed219fad1125069b26af37dee7e230fe6738c111d423cf38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.923622Z","signature_b64":"0Bt4dNdE1vgOGdnaYVnQEcl9t8kXfaaUiFZUMYwLK8PPMHT5ly8K02Z/OtxIJm8KamXjR9IMlXOvOPa7l0irBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b789ce1978a4c9030e409e0712aef8995c206e3b603f7953eb59e4f80435dc05","last_reissued_at":"2026-05-17T23:57:15.923083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.923083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order divisor graphs of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Abdul Qudair Baig, Muhammad Imran, Shafiq ur Rehman, Zia Ullah Khan","submitted_at":"2016-11-14T08:18:06Z","abstract_excerpt":"The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having different orders are adjacent provided that o(a) divides o(b) or o(b) divides o(a)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04280","kind":"arxiv","version":3},"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":"1611.04280","created_at":"2026-05-17T23:57:15.923159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04280v3","created_at":"2026-05-17T23:57:15.923159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04280","created_at":"2026-05-17T23:57:15.923159+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6E44GLYUTEQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6E44GLYUTEQGDSA","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6E44GLY","created_at":"2026-05-18T12:30:48.956258+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/W6E44GLYUTEQGDSATYDRFLXYTF","json":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF.json","graph_json":"https://pith.science/api/pith-number/W6E44GLYUTEQGDSATYDRFLXYTF/graph.json","events_json":"https://pith.science/api/pith-number/W6E44GLYUTEQGDSATYDRFLXYTF/events.json","paper":"https://pith.science/paper/W6E44GLY"},"agent_actions":{"view_html":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF","download_json":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF.json","view_paper":"https://pith.science/paper/W6E44GLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04280&json=true","fetch_graph":"https://pith.science/api/pith-number/W6E44GLYUTEQGDSATYDRFLXYTF/graph.json","fetch_events":"https://pith.science/api/pith-number/W6E44GLYUTEQGDSATYDRFLXYTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF/action/storage_attestation","attest_author":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF/action/author_attestation","sign_citation":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF/action/citation_signature","submit_replication":"https://pith.science/pith/W6E44GLYUTEQGDSATYDRFLXYTF/action/replication_record"}},"created_at":"2026-05-17T23:57:15.923159+00:00","updated_at":"2026-05-17T23:57:15.923159+00:00"}