{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NXIDVJCMNODKOWJRXQSCKJAVGF","short_pith_number":"pith:NXIDVJCM","schema_version":"1.0","canonical_sha256":"6dd03aa44c6b86a75931bc24252415317242922548cb46fa9a0218628f45357c","source":{"kind":"arxiv","id":"2605.14610","version":1},"attestation_state":"computed","paper":{"title":"Parametrically Adaptive Transition Polynomial: a Signed-Parity Continuous-alpha Extension of Kunchenko Stochastic Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Serhii Zabolotnii","submitted_at":"2026-05-14T09:26:53Z","abstract_excerpt":"Kunchenko's method of polynomial maximization provides a semiparametric apparatus for parameter estimation under non-Gaussian errors, but its classical power basis relies on finite higher-order integer moments. This paper introduces the Parametrically Adaptive Transition Polynomial (PATP), a signed-parity fractional-power family controlled by a continuous parameter alpha in [0,1]. The quadratic exponent map p_i(alpha) connects the fractal regime p_i(0)=1/i, the degenerate linear point p_i(1/2)=1, and the signed-parity integer-power regime p_i(1)=i. For the degree-S=2 case we derive a closed-fo"},"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":"2605.14610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T09:26:53Z","cross_cats_sorted":["eess.SP","math.ST","stat.TH"],"title_canon_sha256":"69d07f5d2b4c3de60c3ec309727ac9c11ff1231b6fd6abd9be708850c531172d","abstract_canon_sha256":"3ff775885a80c186e3a0347c2508aac6d1ab882874663fea4b75e4ff168ec48e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:04.168692Z","signature_b64":"6aNIqrIcQCiNVfA8QhgAfHOccE8pg48pSc0BsTZEwtILVcOAkKEnJ29ke1t0c1f99jj1JCThBmOcS1tarlynDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd03aa44c6b86a75931bc24252415317242922548cb46fa9a0218628f45357c","last_reissued_at":"2026-05-17T23:39:04.168073Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:04.168073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametrically Adaptive Transition Polynomial: a Signed-Parity Continuous-alpha Extension of Kunchenko Stochastic Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Serhii Zabolotnii","submitted_at":"2026-05-14T09:26:53Z","abstract_excerpt":"Kunchenko's method of polynomial maximization provides a semiparametric apparatus for parameter estimation under non-Gaussian errors, but its classical power basis relies on finite higher-order integer moments. This paper introduces the Parametrically Adaptive Transition Polynomial (PATP), a signed-parity fractional-power family controlled by a continuous parameter alpha in [0,1]. The quadratic exponent map p_i(alpha) connects the fractal regime p_i(0)=1/i, the degenerate linear point p_i(1/2)=1, and the signed-parity integer-power regime p_i(1)=i. For the degree-S=2 case we derive a closed-fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14610","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":"2605.14610","created_at":"2026-05-17T23:39:04.168192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14610v1","created_at":"2026-05-17T23:39:04.168192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14610","created_at":"2026-05-17T23:39:04.168192+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXIDVJCMNODK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXIDVJCMNODKOWJR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXIDVJCM","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16846","citing_title":"Polynomial Maximization Method with Fractional Polynomial Basis: A Frequentist Bridge to Bayesian Fractional Polynomials","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF","json":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF.json","graph_json":"https://pith.science/api/pith-number/NXIDVJCMNODKOWJRXQSCKJAVGF/graph.json","events_json":"https://pith.science/api/pith-number/NXIDVJCMNODKOWJRXQSCKJAVGF/events.json","paper":"https://pith.science/paper/NXIDVJCM"},"agent_actions":{"view_html":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF","download_json":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF.json","view_paper":"https://pith.science/paper/NXIDVJCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14610&json=true","fetch_graph":"https://pith.science/api/pith-number/NXIDVJCMNODKOWJRXQSCKJAVGF/graph.json","fetch_events":"https://pith.science/api/pith-number/NXIDVJCMNODKOWJRXQSCKJAVGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF/action/storage_attestation","attest_author":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF/action/author_attestation","sign_citation":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF/action/citation_signature","submit_replication":"https://pith.science/pith/NXIDVJCMNODKOWJRXQSCKJAVGF/action/replication_record"}},"created_at":"2026-05-17T23:39:04.168192+00:00","updated_at":"2026-05-17T23:39:04.168192+00:00"}