{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VAPQZ4Q7U6ULQTDZH22GOQU53P","short_pith_number":"pith:VAPQZ4Q7","canonical_record":{"source":{"id":"1009.1444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-08T02:44:03Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"47df774075f01ae7f7a978974db471b5eb4b5cefae4b49d69947c23ab281eab1","abstract_canon_sha256":"2bc45180cbdbfbe8f0ba9490090241e82253aa1bee1310eaf1a6cf48f12a31f8"},"schema_version":"1.0"},"canonical_sha256":"a81f0cf21fa7a8b84c793eb467429ddbe1ec0adde41ecc68a48b052d3ca2d5b6","source":{"kind":"arxiv","id":"1009.1444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1444","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1444v2","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1444","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"VAPQZ4Q7U6UL","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VAPQZ4Q7U6ULQTDZ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VAPQZ4Q7","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VAPQZ4Q7U6ULQTDZH22GOQU53P","target":"record","payload":{"canonical_record":{"source":{"id":"1009.1444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-08T02:44:03Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"47df774075f01ae7f7a978974db471b5eb4b5cefae4b49d69947c23ab281eab1","abstract_canon_sha256":"2bc45180cbdbfbe8f0ba9490090241e82253aa1bee1310eaf1a6cf48f12a31f8"},"schema_version":"1.0"},"canonical_sha256":"a81f0cf21fa7a8b84c793eb467429ddbe1ec0adde41ecc68a48b052d3ca2d5b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:38.116279Z","signature_b64":"vlRXBuNid4cImTeWmJlU3b0D6xd7R591F5i/pWV9olZWrQ1sGyZB3iM7YrSkICd5nR1iA0hFHIM+Mv71iVCcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a81f0cf21fa7a8b84c793eb467429ddbe1ec0adde41ecc68a48b052d3ca2d5b6","last_reissued_at":"2026-05-18T04:14:38.115600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:38.115600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.1444","source_version":2,"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-05-18T04:14:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6YaIyq/W1w0lndNeV6oQqylpbOBh1EedQNjncaNwUryIkw95BwDcIJUSuU903D5POS7JfRNn6rwjjqqEP3tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:47:37.118514Z"},"content_sha256":"222be13fccafa51db5333a2179febddc481c61963a79683200b6f9f331aa0497","schema_version":"1.0","event_id":"sha256:222be13fccafa51db5333a2179febddc481c61963a79683200b6f9f331aa0497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VAPQZ4Q7U6ULQTDZH22GOQU53P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal designs for rational function regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"D\\'avid Papp","submitted_at":"2010-09-08T02:44:03Z","abstract_excerpt":"We consider optimal non-sequential designs for a large class of (linear and nonlinear) regression models involving polynomials and rational functions with heteroscedastic noise also given by a polynomial or rational weight function. The proposed method treats D-, E-, A-, and $\\Phi_p$-optimal designs in a unified manner, and generates a polynomial whose zeros are the support points of the optimal approximate design, generalizing a number of previously known results of the same flavor. The method is based on a mathematical optimization model that can incorporate various criteria of optimality an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1444","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":""},"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-05-18T04:14:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfK0oIQPVjcP9GRJia6j51VeTPjSG/b8hDxSYgro2jylJNaqN5tazVsyx1Hiobm4iGYmJv1c0YYE9p+s2aN9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:47:37.119174Z"},"content_sha256":"58a4f1f620947572554aaf580003b4f74f74a5f007c6d48bf5712cddb95f6665","schema_version":"1.0","event_id":"sha256:58a4f1f620947572554aaf580003b4f74f74a5f007c6d48bf5712cddb95f6665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P/bundle.json","state_url":"https://pith.science/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P/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-05-28T23:47:37Z","links":{"resolver":"https://pith.science/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P","bundle":"https://pith.science/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P/bundle.json","state":"https://pith.science/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAPQZ4Q7U6ULQTDZH22GOQU53P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VAPQZ4Q7U6ULQTDZH22GOQU53P","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":"2bc45180cbdbfbe8f0ba9490090241e82253aa1bee1310eaf1a6cf48f12a31f8","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-08T02:44:03Z","title_canon_sha256":"47df774075f01ae7f7a978974db471b5eb4b5cefae4b49d69947c23ab281eab1"},"schema_version":"1.0","source":{"id":"1009.1444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1444","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1444v2","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1444","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"VAPQZ4Q7U6UL","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VAPQZ4Q7U6ULQTDZ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VAPQZ4Q7","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:58a4f1f620947572554aaf580003b4f74f74a5f007c6d48bf5712cddb95f6665","target":"graph","created_at":"2026-05-18T04:14:38Z","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"},"paper":{"abstract_excerpt":"We consider optimal non-sequential designs for a large class of (linear and nonlinear) regression models involving polynomials and rational functions with heteroscedastic noise also given by a polynomial or rational weight function. The proposed method treats D-, E-, A-, and $\\Phi_p$-optimal designs in a unified manner, and generates a polynomial whose zeros are the support points of the optimal approximate design, generalizing a number of previously known results of the same flavor. The method is based on a mathematical optimization model that can incorporate various criteria of optimality an","authors_text":"D\\'avid Papp","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-08T02:44:03Z","title":"Optimal designs for rational function regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1444","kind":"arxiv","version":2},"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:222be13fccafa51db5333a2179febddc481c61963a79683200b6f9f331aa0497","target":"record","created_at":"2026-05-18T04:14:38Z","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":"2bc45180cbdbfbe8f0ba9490090241e82253aa1bee1310eaf1a6cf48f12a31f8","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-09-08T02:44:03Z","title_canon_sha256":"47df774075f01ae7f7a978974db471b5eb4b5cefae4b49d69947c23ab281eab1"},"schema_version":"1.0","source":{"id":"1009.1444","kind":"arxiv","version":2}},"canonical_sha256":"a81f0cf21fa7a8b84c793eb467429ddbe1ec0adde41ecc68a48b052d3ca2d5b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a81f0cf21fa7a8b84c793eb467429ddbe1ec0adde41ecc68a48b052d3ca2d5b6","first_computed_at":"2026-05-18T04:14:38.115600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:38.115600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vlRXBuNid4cImTeWmJlU3b0D6xd7R591F5i/pWV9olZWrQ1sGyZB3iM7YrSkICd5nR1iA0hFHIM+Mv71iVCcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:38.116279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222be13fccafa51db5333a2179febddc481c61963a79683200b6f9f331aa0497","sha256:58a4f1f620947572554aaf580003b4f74f74a5f007c6d48bf5712cddb95f6665"],"state_sha256":"1c23224de09102d16774b52bef68e19a44b69bd5021e2451c54945129eb18bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDG97+YiDJTpeZg3YWj8/fkc1Rc2uUdZCGOsWoBqU4yV5YaNkD0OuWtn3Zk7PY4Da7RoZ5kHB2nBjhR588FiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:47:37.123265Z","bundle_sha256":"9acabf75d4ab1d4f391d68a02699ae3bddff84949241f36be06b0b23ff9cc230"}}