{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:64Y5UB7CSUQ46WRMKOYUGBZRKP","short_pith_number":"pith:64Y5UB7C","canonical_record":{"source":{"id":"1807.03423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-07-09T23:42:22Z","cross_cats_sorted":[],"title_canon_sha256":"5c81b99b373bce2a90684da3cbb92e143845f2e3b82730c5107334c2a4be1c73","abstract_canon_sha256":"7068fa979b7f12fe387a7c151027dac46fd65f39d464908f86e1e4c95d526efd"},"schema_version":"1.0"},"canonical_sha256":"f731da07e29521cf5a2c53b143073153df7dc6ec951c5aa747fd78a2c7209dbf","source":{"kind":"arxiv","id":"1807.03423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03423","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03423v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03423","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"64Y5UB7CSUQ4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"64Y5UB7CSUQ46WRM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"64Y5UB7C","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:64Y5UB7CSUQ46WRMKOYUGBZRKP","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-07-09T23:42:22Z","cross_cats_sorted":[],"title_canon_sha256":"5c81b99b373bce2a90684da3cbb92e143845f2e3b82730c5107334c2a4be1c73","abstract_canon_sha256":"7068fa979b7f12fe387a7c151027dac46fd65f39d464908f86e1e4c95d526efd"},"schema_version":"1.0"},"canonical_sha256":"f731da07e29521cf5a2c53b143073153df7dc6ec951c5aa747fd78a2c7209dbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:10.479264Z","signature_b64":"RGm3acEWi8H4akV/UsDhgXck3r1Ld00B0kWZDcZ89prU5i2NVdiQ+ozGU8feTv+hZ/6ZGWEzB8D79/v9z9xlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f731da07e29521cf5a2c53b143073153df7dc6ec951c5aa747fd78a2c7209dbf","last_reissued_at":"2026-05-18T00:11:10.478511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:10.478511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03423","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIglNtTPm/7uuAR5m6cCNp6KeRcxNFn1BbFpVqfciLHr7MxQRkpAljYLP8eDIEKq6yFRo1FQoGLpwM1CBnzLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:05:52.983099Z"},"content_sha256":"65727ffd5a254f6e1182212c62ec744db85b7eaf0b517d1fa159f49449b41614","schema_version":"1.0","event_id":"sha256:65727ffd5a254f6e1182212c62ec744db85b7eaf0b517d1fa159f49449b41614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:64Y5UB7CSUQ46WRMKOYUGBZRKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal subgroup growth of some metabelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrew James Kelley","submitted_at":"2018-07-09T23:42:22Z","abstract_excerpt":"Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\\limsup \\frac{\\log m_n(G)}{\\log n}$, the degree of polynomial growth of $m_n(G)$). A condition is given for when this upper bound is attained.\n  For $G = \\mathbb{Z}^k \\rtimes \\mathbb{Z}$, where $A \\in GL(k,\\mathbb{Z})$, it is shown that $m_n(G)$ grows like a polynomial of degree equal to the number of blocks in the rational canonical form of $A$. The leading term of this polynomial is the number of distinc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03423","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qEloZKT0ULgquYv8V1ULmN9uIyDMhmm8zbfgs3wBYsOztA0c4EqffEe5ey6wbdTZJlgHrMN/tMbS9k54p8UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:05:52.983461Z"},"content_sha256":"aa93291bac6406ddfe0643126c98a8ef9623e07ded13e982fe4e8d9a71f1e0be","schema_version":"1.0","event_id":"sha256:aa93291bac6406ddfe0643126c98a8ef9623e07ded13e982fe4e8d9a71f1e0be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP/bundle.json","state_url":"https://pith.science/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP/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-06-10T19:05:52Z","links":{"resolver":"https://pith.science/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP","bundle":"https://pith.science/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP/bundle.json","state":"https://pith.science/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64Y5UB7CSUQ46WRMKOYUGBZRKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:64Y5UB7CSUQ46WRMKOYUGBZRKP","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":"7068fa979b7f12fe387a7c151027dac46fd65f39d464908f86e1e4c95d526efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-07-09T23:42:22Z","title_canon_sha256":"5c81b99b373bce2a90684da3cbb92e143845f2e3b82730c5107334c2a4be1c73"},"schema_version":"1.0","source":{"id":"1807.03423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03423","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03423v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03423","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"64Y5UB7CSUQ4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"64Y5UB7CSUQ46WRM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"64Y5UB7C","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:aa93291bac6406ddfe0643126c98a8ef9623e07ded13e982fe4e8d9a71f1e0be","target":"graph","created_at":"2026-05-18T00:11:10Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\\limsup \\frac{\\log m_n(G)}{\\log n}$, the degree of polynomial growth of $m_n(G)$). A condition is given for when this upper bound is attained.\n  For $G = \\mathbb{Z}^k \\rtimes \\mathbb{Z}$, where $A \\in GL(k,\\mathbb{Z})$, it is shown that $m_n(G)$ grows like a polynomial of degree equal to the number of blocks in the rational canonical form of $A$. The leading term of this polynomial is the number of distinc","authors_text":"Andrew James Kelley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-07-09T23:42:22Z","title":"Maximal subgroup growth of some metabelian groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03423","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:65727ffd5a254f6e1182212c62ec744db85b7eaf0b517d1fa159f49449b41614","target":"record","created_at":"2026-05-18T00:11:10Z","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":"7068fa979b7f12fe387a7c151027dac46fd65f39d464908f86e1e4c95d526efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-07-09T23:42:22Z","title_canon_sha256":"5c81b99b373bce2a90684da3cbb92e143845f2e3b82730c5107334c2a4be1c73"},"schema_version":"1.0","source":{"id":"1807.03423","kind":"arxiv","version":1}},"canonical_sha256":"f731da07e29521cf5a2c53b143073153df7dc6ec951c5aa747fd78a2c7209dbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f731da07e29521cf5a2c53b143073153df7dc6ec951c5aa747fd78a2c7209dbf","first_computed_at":"2026-05-18T00:11:10.478511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:10.478511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGm3acEWi8H4akV/UsDhgXck3r1Ld00B0kWZDcZ89prU5i2NVdiQ+ozGU8feTv+hZ/6ZGWEzB8D79/v9z9xlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:10.479264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65727ffd5a254f6e1182212c62ec744db85b7eaf0b517d1fa159f49449b41614","sha256:aa93291bac6406ddfe0643126c98a8ef9623e07ded13e982fe4e8d9a71f1e0be"],"state_sha256":"44ae0a81c8f83ee2251d60b7e1b370eea553558f7589cd17b50466d7ea57f04d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByW09oF0CiNuPyrKlw4IwqoNl5/GkKLz0+UHBllmdWJZFI2o/dqF/rMMl3NVKXoj4brFJJnDt3ngaZPlAQEGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:05:52.985389Z","bundle_sha256":"7cba4111dbf8ccba9551d920083d87dc606b821c6ee5b2b54fe85041ca3cf991"}}