{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R7LUEPJ7D2LUN3K6B2ILJNGGLO","short_pith_number":"pith:R7LUEPJ7","schema_version":"1.0","canonical_sha256":"8fd7423d3f1e9746ed5e0e90b4b4c65b97c50c79cd4ab78863c864edef94f04b","source":{"kind":"arxiv","id":"1802.07646","version":2},"attestation_state":"computed","paper":{"title":"Minimal cut-sets in the power graphs of certain finite non-cyclic groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Sriparna Chattopadhyay","submitted_at":"2018-02-21T16:20:24Z","abstract_excerpt":"The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the power graph of a (finite) non-cyclic (nilpotent) group which are associated with its maximal cyclic subgroups. Let $G$ be a finite non-cyclic nilpotent group whose order is divisible by at least two distinct primes. If $G$ has a Sylow subgroup which is neither cyclic nor a generalized quaternion $2$-group and all other Sylow subgroups of $G$ are cyclic, the"},"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":"1802.07646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-21T16:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"9dccde2815f7c95b9be459bf4c823f0d238f8c3feba6807ff86a5de7a376e8d4","abstract_canon_sha256":"eb74b0a742e8c7bd0732c35623c4a5fc6c7dfafa7a37681903de3343f0a2151b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:38.768791Z","signature_b64":"Eo1S9KJReNSyk/ACJmgiohPG3Vm0LzGrt0jkrjDKAj4kap0GfSXrXVFGNOzkis4BrMRHRTbIb2krXPL2kAArCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd7423d3f1e9746ed5e0e90b4b4c65b97c50c79cd4ab78863c864edef94f04b","last_reissued_at":"2026-05-17T23:50:38.768243Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:38.768243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal cut-sets in the power graphs of certain finite non-cyclic groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Sriparna Chattopadhyay","submitted_at":"2018-02-21T16:20:24Z","abstract_excerpt":"The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the power graph of a (finite) non-cyclic (nilpotent) group which are associated with its maximal cyclic subgroups. Let $G$ be a finite non-cyclic nilpotent group whose order is divisible by at least two distinct primes. If $G$ has a Sylow subgroup which is neither cyclic nor a generalized quaternion $2$-group and all other Sylow subgroups of $G$ are cyclic, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07646","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":"1802.07646","created_at":"2026-05-17T23:50:38.768329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07646v2","created_at":"2026-05-17T23:50:38.768329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07646","created_at":"2026-05-17T23:50:38.768329+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7LUEPJ7D2LU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7LUEPJ7D2LUN3K6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7LUEPJ7","created_at":"2026-05-18T12:32:50.500415+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/R7LUEPJ7D2LUN3K6B2ILJNGGLO","json":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO.json","graph_json":"https://pith.science/api/pith-number/R7LUEPJ7D2LUN3K6B2ILJNGGLO/graph.json","events_json":"https://pith.science/api/pith-number/R7LUEPJ7D2LUN3K6B2ILJNGGLO/events.json","paper":"https://pith.science/paper/R7LUEPJ7"},"agent_actions":{"view_html":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO","download_json":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO.json","view_paper":"https://pith.science/paper/R7LUEPJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07646&json=true","fetch_graph":"https://pith.science/api/pith-number/R7LUEPJ7D2LUN3K6B2ILJNGGLO/graph.json","fetch_events":"https://pith.science/api/pith-number/R7LUEPJ7D2LUN3K6B2ILJNGGLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO/action/storage_attestation","attest_author":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO/action/author_attestation","sign_citation":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO/action/citation_signature","submit_replication":"https://pith.science/pith/R7LUEPJ7D2LUN3K6B2ILJNGGLO/action/replication_record"}},"created_at":"2026-05-17T23:50:38.768329+00:00","updated_at":"2026-05-17T23:50:38.768329+00:00"}