{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GU4RTILSCLO4J5S5PDSDFQ2KI6","short_pith_number":"pith:GU4RTILS","canonical_record":{"source":{"id":"2508.18199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-25T17:00:56Z","cross_cats_sorted":[],"title_canon_sha256":"9dfb8f889c05945933eeb0786df7236d8b167552fb70154f629aa67f7e22a8ff","abstract_canon_sha256":"36412bd47401e36c9290c84cdc2e4b45bde0fdff986e2032bf5990de45557f69"},"schema_version":"1.0"},"canonical_sha256":"353919a17212ddc4f65d78e432c34a479478f5769c78bcb3bf845e3fafd42178","source":{"kind":"arxiv","id":"2508.18199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.18199","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"2508.18199v1","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18199","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"GU4RTILSCLO4","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"pith_short_16","alias_value":"GU4RTILSCLO4J5S5","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"pith_short_8","alias_value":"GU4RTILS","created_at":"2026-07-05T11:58:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GU4RTILSCLO4J5S5PDSDFQ2KI6","target":"record","payload":{"canonical_record":{"source":{"id":"2508.18199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-25T17:00:56Z","cross_cats_sorted":[],"title_canon_sha256":"9dfb8f889c05945933eeb0786df7236d8b167552fb70154f629aa67f7e22a8ff","abstract_canon_sha256":"36412bd47401e36c9290c84cdc2e4b45bde0fdff986e2032bf5990de45557f69"},"schema_version":"1.0"},"canonical_sha256":"353919a17212ddc4f65d78e432c34a479478f5769c78bcb3bf845e3fafd42178","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:55.334274Z","signature_b64":"V5G6WZcyp0/je0W20ApPEaTWImSbeTw4poAQmMZSLhP2ySG44ufIg3byF9/mjj+WxSR2SPhT4ckVOO/Nb1guBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"353919a17212ddc4f65d78e432c34a479478f5769c78bcb3bf845e3fafd42178","last_reissued_at":"2026-07-05T11:58:55.333776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:55.333776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.18199","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-07-05T11:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLIGFRFagteVWdByQJFT8pQb1UD4EN15rq4Wnq1vWZxHTUdlcV8Or11lY4wTfo7wIEqFJT8xI1WxTvO1fgM0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:48:57.449595Z"},"content_sha256":"7cf6752d09007197711efe37595b3ce4e3f00d85dc5856801cfa0e6d5ecd3425","schema_version":"1.0","event_id":"sha256:7cf6752d09007197711efe37595b3ce4e3f00d85dc5856801cfa0e6d5ecd3425"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GU4RTILSCLO4J5S5PDSDFQ2KI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Polynomial Regression under Anomalous Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Maryam Dehghani, Mohammad Reza Hesamzadeh, Roozbeh Abolpour","submitted_at":"2025-08-25T17:00:56Z","abstract_excerpt":"This paper starts with the general form of the polynomial regression model. We reformulate the Sparse Polynomial Regression Model (SPRM) with anomalous data filtering as Mixed-Integer Linear Program (MILP). This MILP is then converted to a non-convex Quadratically Constrained Quadratic Program (QCQP). Through a proposed mapping, the derived QCQP is reformulated as a Fractional Program (FP). We theoretically show that the reformulated FP has better computational properties than the original QCQP. We then suggest a conic-relaxation-based algorithm to solve the proposed FP. A Two-Step Convex Rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.18199/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"},"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-07-05T11:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQqlbzQRMaIw3mY6YCMci31B/CEv7ryLTahmvN6nxlctN/vmbXANvihOvS7gbUL+D5CVC7iusDS/AWuGv4WoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:48:57.450495Z"},"content_sha256":"3ed1e690e7036678ce6fab22321fdd9982e69fadd4088520018480f9a448da1c","schema_version":"1.0","event_id":"sha256:3ed1e690e7036678ce6fab22321fdd9982e69fadd4088520018480f9a448da1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6/bundle.json","state_url":"https://pith.science/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6/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-08-06T21:48:57Z","links":{"resolver":"https://pith.science/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6","bundle":"https://pith.science/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6/bundle.json","state":"https://pith.science/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GU4RTILSCLO4J5S5PDSDFQ2KI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GU4RTILSCLO4J5S5PDSDFQ2KI6","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":"36412bd47401e36c9290c84cdc2e4b45bde0fdff986e2032bf5990de45557f69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-25T17:00:56Z","title_canon_sha256":"9dfb8f889c05945933eeb0786df7236d8b167552fb70154f629aa67f7e22a8ff"},"schema_version":"1.0","source":{"id":"2508.18199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.18199","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"2508.18199v1","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18199","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"GU4RTILSCLO4","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"pith_short_16","alias_value":"GU4RTILSCLO4J5S5","created_at":"2026-07-05T11:58:55Z"},{"alias_kind":"pith_short_8","alias_value":"GU4RTILS","created_at":"2026-07-05T11:58:55Z"}],"graph_snapshots":[{"event_id":"sha256:3ed1e690e7036678ce6fab22321fdd9982e69fadd4088520018480f9a448da1c","target":"graph","created_at":"2026-07-05T11:58:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.18199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper starts with the general form of the polynomial regression model. We reformulate the Sparse Polynomial Regression Model (SPRM) with anomalous data filtering as Mixed-Integer Linear Program (MILP). This MILP is then converted to a non-convex Quadratically Constrained Quadratic Program (QCQP). Through a proposed mapping, the derived QCQP is reformulated as a Fractional Program (FP). We theoretically show that the reformulated FP has better computational properties than the original QCQP. We then suggest a conic-relaxation-based algorithm to solve the proposed FP. A Two-Step Convex Rela","authors_text":"Maryam Dehghani, Mohammad Reza Hesamzadeh, Roozbeh Abolpour","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-25T17:00:56Z","title":"Sparse Polynomial Regression under Anomalous Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18199","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:7cf6752d09007197711efe37595b3ce4e3f00d85dc5856801cfa0e6d5ecd3425","target":"record","created_at":"2026-07-05T11:58:55Z","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":"36412bd47401e36c9290c84cdc2e4b45bde0fdff986e2032bf5990de45557f69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-25T17:00:56Z","title_canon_sha256":"9dfb8f889c05945933eeb0786df7236d8b167552fb70154f629aa67f7e22a8ff"},"schema_version":"1.0","source":{"id":"2508.18199","kind":"arxiv","version":1}},"canonical_sha256":"353919a17212ddc4f65d78e432c34a479478f5769c78bcb3bf845e3fafd42178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"353919a17212ddc4f65d78e432c34a479478f5769c78bcb3bf845e3fafd42178","first_computed_at":"2026-07-05T11:58:55.333776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:55.333776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5G6WZcyp0/je0W20ApPEaTWImSbeTw4poAQmMZSLhP2ySG44ufIg3byF9/mjj+WxSR2SPhT4ckVOO/Nb1guBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:55.334274Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.18199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf6752d09007197711efe37595b3ce4e3f00d85dc5856801cfa0e6d5ecd3425","sha256:3ed1e690e7036678ce6fab22321fdd9982e69fadd4088520018480f9a448da1c"],"state_sha256":"6f9aed0c8198ea7e44df5b7d469288463c7352d5226211650c008abb4ea778f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIOJ7FYOwCWkqBgQwzkbECg8y+E+s8TLPorDxCPGj9jVj2Mihi86Vw7KN0sdL6p4qZb/u3qSGN2galWooSZ+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:48:57.455805Z","bundle_sha256":"1b363039151fe66558e63c47d1ce634726e21ef6323250b681501594b2f9b610"}}