{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CYKWEEMFK7HAHLLWJRCELFFF7J","short_pith_number":"pith:CYKWEEMF","schema_version":"1.0","canonical_sha256":"161562118557ce03ad764c444594a5fa4491e7594a63d0ed1cdd8c0c54ebf160","source":{"kind":"arxiv","id":"1805.04633","version":1},"attestation_state":"computed","paper":{"title":"An approximation for the number of subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Bruno Cisneros, Carlos Segovia","submitted_at":"2018-05-12T01:32:53Z","abstract_excerpt":"Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic subgroups. Here we explain the formulas used to obtain this invariant and we present values for some families of groups."},"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":"1805.04633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-05-12T01:32:53Z","cross_cats_sorted":[],"title_canon_sha256":"a206913ab9812b64b5c9a0034b86521afef846f5ee818bb0a152ab5d50edd318","abstract_canon_sha256":"d13850577235da2ed01b4c9e5791e4f708bdca84ee75c975bb63c4b8f14b1cc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:06.840642Z","signature_b64":"aA0lzMnxS4D3Ud6a9okOKEaa8T15Yvb8I9cymrz4EnuUvSzkut+c9Pb7KKVkq2EhsWBcSVEbjf1f8BEAYH0nBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161562118557ce03ad764c444594a5fa4491e7594a63d0ed1cdd8c0c54ebf160","last_reissued_at":"2026-05-18T00:16:06.840045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:06.840045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approximation for the number of subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Bruno Cisneros, Carlos Segovia","submitted_at":"2018-05-12T01:32:53Z","abstract_excerpt":"Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic subgroups. Here we explain the formulas used to obtain this invariant and we present values for some families of groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04633","kind":"arxiv","version":1},"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":"1805.04633","created_at":"2026-05-18T00:16:06.840122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04633v1","created_at":"2026-05-18T00:16:06.840122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04633","created_at":"2026-05-18T00:16:06.840122+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYKWEEMFK7HA","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYKWEEMFK7HAHLLW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYKWEEMF","created_at":"2026-05-18T12:32:19.392346+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/CYKWEEMFK7HAHLLWJRCELFFF7J","json":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J.json","graph_json":"https://pith.science/api/pith-number/CYKWEEMFK7HAHLLWJRCELFFF7J/graph.json","events_json":"https://pith.science/api/pith-number/CYKWEEMFK7HAHLLWJRCELFFF7J/events.json","paper":"https://pith.science/paper/CYKWEEMF"},"agent_actions":{"view_html":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J","download_json":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J.json","view_paper":"https://pith.science/paper/CYKWEEMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04633&json=true","fetch_graph":"https://pith.science/api/pith-number/CYKWEEMFK7HAHLLWJRCELFFF7J/graph.json","fetch_events":"https://pith.science/api/pith-number/CYKWEEMFK7HAHLLWJRCELFFF7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J/action/storage_attestation","attest_author":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J/action/author_attestation","sign_citation":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J/action/citation_signature","submit_replication":"https://pith.science/pith/CYKWEEMFK7HAHLLWJRCELFFF7J/action/replication_record"}},"created_at":"2026-05-18T00:16:06.840122+00:00","updated_at":"2026-05-18T00:16:06.840122+00:00"}