{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N7YNXM5RJZ2SCM7ZQTDDEXTJUN","short_pith_number":"pith:N7YNXM5R","schema_version":"1.0","canonical_sha256":"6ff0dbb3b14e752133f984c6325e69a362b06a7c638cc363a4c71cb983089ee2","source":{"kind":"arxiv","id":"2508.05284","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SC","math.IT"],"primary_cat":"cs.IT","authors_text":"Eleonora Guerrini, Matteo Abbondati, Romain Lebreton","submitted_at":"2025-08-07T11:28:44Z","abstract_excerpt":"In this paper, we extend the work of Abbondati et al. (2024) on decoding simultaneous rational function codes by addressing two important scenarios: multiplicities and poles (zeros of denominators). First, we generalize previous results to rational codes with multiplicities by considering evaluations with multi-precision. Then, using the hybrid model from Guerrini et al. (2023), we extend our approach to vectors of rational functions that may present poles. Our contributions include: a rigorous analysis of the decoding algorithm's failure probability that generalizes and improves several previ"},"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":"2508.05284","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-08-07T11:28:44Z","cross_cats_sorted":["cs.SC","math.IT"],"title_canon_sha256":"214953fc3594e2c1da9c27ce29635d8e6fae2e98eacafb91a2ea0e05610723bf","abstract_canon_sha256":"3ce8ee26d00ae650929132788fa57c4d0243be0e9f33806ed49a2fa74c057c6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:10.169448Z","signature_b64":"f0NWNswQb/VqZPD2oab2m0EVW+Ni3cKC1vGlR0xV7tIEEP2wtbjz/sK0ldsxG1EeIwxQlnBKh/f4XgFsYLmkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ff0dbb3b14e752133f984c6325e69a362b06a7c638cc363a4c71cb983089ee2","last_reissued_at":"2026-07-05T11:50:10.169021Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:10.169021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SC","math.IT"],"primary_cat":"cs.IT","authors_text":"Eleonora Guerrini, Matteo Abbondati, Romain Lebreton","submitted_at":"2025-08-07T11:28:44Z","abstract_excerpt":"In this paper, we extend the work of Abbondati et al. (2024) on decoding simultaneous rational function codes by addressing two important scenarios: multiplicities and poles (zeros of denominators). First, we generalize previous results to rational codes with multiplicities by considering evaluations with multi-precision. Then, using the hybrid model from Guerrini et al. (2023), we extend our approach to vectors of rational functions that may present poles. Our contributions include: a rigorous analysis of the decoding algorithm's failure probability that generalizes and improves several previ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05284","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.05284/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":"2508.05284","created_at":"2026-07-05T11:50:10.169076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05284v1","created_at":"2026-07-05T11:50:10.169076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05284","created_at":"2026-07-05T11:50:10.169076+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7YNXM5RJZ2S","created_at":"2026-07-05T11:50:10.169076+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7YNXM5RJZ2SCM7Z","created_at":"2026-07-05T11:50:10.169076+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7YNXM5R","created_at":"2026-07-05T11:50:10.169076+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/N7YNXM5RJZ2SCM7ZQTDDEXTJUN","json":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN.json","graph_json":"https://pith.science/api/pith-number/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/graph.json","events_json":"https://pith.science/api/pith-number/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/events.json","paper":"https://pith.science/paper/N7YNXM5R"},"agent_actions":{"view_html":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN","download_json":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN.json","view_paper":"https://pith.science/paper/N7YNXM5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05284&json=true","fetch_graph":"https://pith.science/api/pith-number/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/graph.json","fetch_events":"https://pith.science/api/pith-number/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/action/storage_attestation","attest_author":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/action/author_attestation","sign_citation":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/action/citation_signature","submit_replication":"https://pith.science/pith/N7YNXM5RJZ2SCM7ZQTDDEXTJUN/action/replication_record"}},"created_at":"2026-07-05T11:50:10.169076+00:00","updated_at":"2026-07-05T11:50:10.169076+00:00"}