{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CIVC4MKBKMXHDTP3AUAOWEYNKV","short_pith_number":"pith:CIVC4MKB","schema_version":"1.0","canonical_sha256":"122a2e3141532e71cdfb0500eb130d5562828cc52a55d86e0164b97e85a40b8b","source":{"kind":"arxiv","id":"2603.27609","version":2},"attestation_state":"computed","paper":{"title":"Monodromy groups of polynomials of composition length 2","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.NT","authors_text":"Angelot Behajaina, Danny Neftin, Joachim K\\\"onig","submitted_at":"2026-03-29T10:09:50Z","abstract_excerpt":"We study the monodromy groups of compositions of two indecomposable polynomials. In particular, we show that such monodromy groups either fulfill a certain ``largeness\" property, or belong to an explicit list of exceptions. Such largeness results are crucial for dealing with compositions of more than two polynomials, and consequently are expected to have a wide range of applications to problems concerning the arithmetic of polynomials and arithmetic dynamics. In particular, our main result is a key ingredient in the solution of a long-standing open problem due to Davenport, Lewis and Schinzel,"},"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":"2603.27609","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-03-29T10:09:50Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"66b8601ad900a559ae98f1ceef424ce12895d426fb2e2b94cc6d58cd1c9f5836","abstract_canon_sha256":"6bca189dec34e52be6df53ecc5d631c18bd086af8263bcfcb5b9e90a385b979b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:29:01.021030Z","signature_b64":"72d0Y1v6KCILZvji9inEN4hUuQi8QWXnubBYOK+kU3U44W5uHe1YMg5qE/WWM+WPpaFHQ3dAwbasSR04GdaJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122a2e3141532e71cdfb0500eb130d5562828cc52a55d86e0164b97e85a40b8b","last_reissued_at":"2026-08-03T01:29:01.018937Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:29:01.018937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monodromy groups of polynomials of composition length 2","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.NT","authors_text":"Angelot Behajaina, Danny Neftin, Joachim K\\\"onig","submitted_at":"2026-03-29T10:09:50Z","abstract_excerpt":"We study the monodromy groups of compositions of two indecomposable polynomials. In particular, we show that such monodromy groups either fulfill a certain ``largeness\" property, or belong to an explicit list of exceptions. Such largeness results are crucial for dealing with compositions of more than two polynomials, and consequently are expected to have a wide range of applications to problems concerning the arithmetic of polynomials and arithmetic dynamics. In particular, our main result is a key ingredient in the solution of a long-standing open problem due to Davenport, Lewis and Schinzel,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.27609","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.27609/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2603.27609","created_at":"2026-08-03T01:29:01.020031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.27609v2","created_at":"2026-08-03T01:29:01.020031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.27609","created_at":"2026-08-03T01:29:01.020031+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIVC4MKBKMXH","created_at":"2026-08-03T01:29:01.020031+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIVC4MKBKMXHDTP3","created_at":"2026-08-03T01:29:01.020031+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIVC4MKB","created_at":"2026-08-03T01:29:01.020031+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/CIVC4MKBKMXHDTP3AUAOWEYNKV","json":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV.json","graph_json":"https://pith.science/api/pith-number/CIVC4MKBKMXHDTP3AUAOWEYNKV/graph.json","events_json":"https://pith.science/api/pith-number/CIVC4MKBKMXHDTP3AUAOWEYNKV/events.json","paper":"https://pith.science/paper/CIVC4MKB"},"agent_actions":{"view_html":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV","download_json":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV.json","view_paper":"https://pith.science/paper/CIVC4MKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.27609&json=true","fetch_graph":"https://pith.science/api/pith-number/CIVC4MKBKMXHDTP3AUAOWEYNKV/graph.json","fetch_events":"https://pith.science/api/pith-number/CIVC4MKBKMXHDTP3AUAOWEYNKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV/action/storage_attestation","attest_author":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV/action/author_attestation","sign_citation":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV/action/citation_signature","submit_replication":"https://pith.science/pith/CIVC4MKBKMXHDTP3AUAOWEYNKV/action/replication_record"}},"created_at":"2026-08-03T01:29:01.020031+00:00","updated_at":"2026-08-03T01:29:01.020031+00:00"}