{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3QH2EXD4FGI5SJKCCWFAND44MT","short_pith_number":"pith:3QH2EXD4","schema_version":"1.0","canonical_sha256":"dc0fa25c7c2991d92542158a068f9c64cad49d870c9f6d17110082412c2d7f3f","source":{"kind":"arxiv","id":"1907.09805","version":1},"attestation_state":"computed","paper":{"title":"High degree quadrature rules with pseudorandom rational nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"M\\'ario M. Gra\\c{c}a","submitted_at":"2019-07-23T10:31:33Z","abstract_excerpt":"After introducing the definitions of positive, negative and companion rules, from a given pair of companion rules we construct a new rule with higher degree of precision The scheme is generalized giving rise to a transformation which we call the mean rule. We show that the mean rule is the best approximation, in the sense of least-squares, obtained from a linear combination of two rules of the same degree of precision. Finally, we show that a rule of degree 2k+1 can be constructed as linear combination of k+1 rules of degree one and rational pseudorandom nodes. Several worked examples are pres"},"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":"1907.09805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-23T10:31:33Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e4c965c01c6d1c79a194309e93218c4b24d3e6b9272d9d9f999e2fa3bf7e9656","abstract_canon_sha256":"301e9e1b02d248af8264f253c0234283ee981dace6110b03b3dfa9656a0f48fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:50.000834Z","signature_b64":"3XPDSwRn6YAOFN4m3KZYjCgQjsgm9TEsF2Sv2v2yE3y6pMkUgeP5kCwcjV+T3FZ3mMceDVKkBo8w97QITjdsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc0fa25c7c2991d92542158a068f9c64cad49d870c9f6d17110082412c2d7f3f","last_reissued_at":"2026-05-17T23:39:50.000129Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:50.000129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High degree quadrature rules with pseudorandom rational nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"M\\'ario M. Gra\\c{c}a","submitted_at":"2019-07-23T10:31:33Z","abstract_excerpt":"After introducing the definitions of positive, negative and companion rules, from a given pair of companion rules we construct a new rule with higher degree of precision The scheme is generalized giving rise to a transformation which we call the mean rule. We show that the mean rule is the best approximation, in the sense of least-squares, obtained from a linear combination of two rules of the same degree of precision. Finally, we show that a rule of degree 2k+1 can be constructed as linear combination of k+1 rules of degree one and rational pseudorandom nodes. Several worked examples are pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09805","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":"1907.09805","created_at":"2026-05-17T23:39:50.000223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09805v1","created_at":"2026-05-17T23:39:50.000223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09805","created_at":"2026-05-17T23:39:50.000223+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QH2EXD4FGI5","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QH2EXD4FGI5SJKC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QH2EXD4","created_at":"2026-05-18T12:33:07.085635+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/3QH2EXD4FGI5SJKCCWFAND44MT","json":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT.json","graph_json":"https://pith.science/api/pith-number/3QH2EXD4FGI5SJKCCWFAND44MT/graph.json","events_json":"https://pith.science/api/pith-number/3QH2EXD4FGI5SJKCCWFAND44MT/events.json","paper":"https://pith.science/paper/3QH2EXD4"},"agent_actions":{"view_html":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT","download_json":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT.json","view_paper":"https://pith.science/paper/3QH2EXD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09805&json=true","fetch_graph":"https://pith.science/api/pith-number/3QH2EXD4FGI5SJKCCWFAND44MT/graph.json","fetch_events":"https://pith.science/api/pith-number/3QH2EXD4FGI5SJKCCWFAND44MT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT/action/storage_attestation","attest_author":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT/action/author_attestation","sign_citation":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT/action/citation_signature","submit_replication":"https://pith.science/pith/3QH2EXD4FGI5SJKCCWFAND44MT/action/replication_record"}},"created_at":"2026-05-17T23:39:50.000223+00:00","updated_at":"2026-05-17T23:39:50.000223+00:00"}