{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PIAIFRKRD55ETVKU7QRE7TMZ3O","short_pith_number":"pith:PIAIFRKR","schema_version":"1.0","canonical_sha256":"7a0082c5511f7a49d554fc224fcd99dba0b45d4a11d66523cf5e6aaa68a740f1","source":{"kind":"arxiv","id":"1008.1633","version":1},"attestation_state":"computed","paper":{"title":"Inducing $\\pi$-partial characters with a given vertex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Mark L. Lewis","submitted_at":"2010-08-10T05:11:10Z","abstract_excerpt":"Let $G$ be a solvable group. Let $p$ be a prime and let $Q$ be a $p$-subgroup of a subgroup $V$. Suppose $\\phi \\in \\ibr G$. If either $|G|$ is odd or $p = 2$, we prove that the number of Brauer characters of $H$ inducing $\\phi$ with vertex $Q$ is at most $|\\norm GQ: \\norm VQ|$."},"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":"1008.1633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-08-10T05:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"bbe88aa02dc2659fffd334e0f877cf022fa06e4828dd76d8d2995d02c23b7936","abstract_canon_sha256":"8ca38b578c96fff8765d8204a7fee0ddde84fd1ba6392564c683c38bc1f9625b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.674425Z","signature_b64":"B4H3qpDgAiOyQWYHD3fI4gcoa1KTydLMNSAlDDqOHQx4Bv9YEASE7EeXjbISfVaTWPuY9vvJ/XHSNw90xT+qCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a0082c5511f7a49d554fc224fcd99dba0b45d4a11d66523cf5e6aaa68a740f1","last_reissued_at":"2026-05-18T04:42:23.673999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.673999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inducing $\\pi$-partial characters with a given vertex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Mark L. Lewis","submitted_at":"2010-08-10T05:11:10Z","abstract_excerpt":"Let $G$ be a solvable group. Let $p$ be a prime and let $Q$ be a $p$-subgroup of a subgroup $V$. Suppose $\\phi \\in \\ibr G$. If either $|G|$ is odd or $p = 2$, we prove that the number of Brauer characters of $H$ inducing $\\phi$ with vertex $Q$ is at most $|\\norm GQ: \\norm VQ|$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1633","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":"1008.1633","created_at":"2026-05-18T04:42:23.674065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1633v1","created_at":"2026-05-18T04:42:23.674065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1633","created_at":"2026-05-18T04:42:23.674065+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIAIFRKRD55E","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIAIFRKRD55ETVKU","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIAIFRKR","created_at":"2026-05-18T12:26:12.377268+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/PIAIFRKRD55ETVKU7QRE7TMZ3O","json":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O.json","graph_json":"https://pith.science/api/pith-number/PIAIFRKRD55ETVKU7QRE7TMZ3O/graph.json","events_json":"https://pith.science/api/pith-number/PIAIFRKRD55ETVKU7QRE7TMZ3O/events.json","paper":"https://pith.science/paper/PIAIFRKR"},"agent_actions":{"view_html":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O","download_json":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O.json","view_paper":"https://pith.science/paper/PIAIFRKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1633&json=true","fetch_graph":"https://pith.science/api/pith-number/PIAIFRKRD55ETVKU7QRE7TMZ3O/graph.json","fetch_events":"https://pith.science/api/pith-number/PIAIFRKRD55ETVKU7QRE7TMZ3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O/action/storage_attestation","attest_author":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O/action/author_attestation","sign_citation":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O/action/citation_signature","submit_replication":"https://pith.science/pith/PIAIFRKRD55ETVKU7QRE7TMZ3O/action/replication_record"}},"created_at":"2026-05-18T04:42:23.674065+00:00","updated_at":"2026-05-18T04:42:23.674065+00:00"}