{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TQ6KS2P34MBLJYIZTKBIYP3C2R","short_pith_number":"pith:TQ6KS2P3","canonical_record":{"source":{"id":"1810.01072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-02T05:18:44Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"fc678a83ccacfceaf6369fe6a07eeafb63ed1f5fff2d22324a592b3935a5aa83","abstract_canon_sha256":"bc2f0c3d575feb80d927f3096a1a7a2f1d1fada7b4b436ae4f0c4f7a417fdf74"},"schema_version":"1.0"},"canonical_sha256":"9c3ca969fbe302b4e1199a828c3f62d47590f733f9626d95afc6510408d942b0","source":{"kind":"arxiv","id":"1810.01072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01072","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01072v3","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01072","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"TQ6KS2P34MBL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TQ6KS2P34MBLJYIZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TQ6KS2P3","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TQ6KS2P34MBLJYIZTKBIYP3C2R","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-02T05:18:44Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"fc678a83ccacfceaf6369fe6a07eeafb63ed1f5fff2d22324a592b3935a5aa83","abstract_canon_sha256":"bc2f0c3d575feb80d927f3096a1a7a2f1d1fada7b4b436ae4f0c4f7a417fdf74"},"schema_version":"1.0"},"canonical_sha256":"9c3ca969fbe302b4e1199a828c3f62d47590f733f9626d95afc6510408d942b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.254981Z","signature_b64":"Rb3haiKj8C9N05yswhO70U4ba/ui4pkM4kHeIFYzRx2+GIPzljaf7N0Vz8nLOf0HNezo83vm+FED/xHY0cRrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c3ca969fbe302b4e1199a828c3f62d47590f733f9626d95afc6510408d942b0","last_reissued_at":"2026-05-17T23:49:22.254543Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.254543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01072","source_version":3,"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-17T23:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhehgXukWbSAELjhqMre5SNmZ7magR4wucBvn0VRU2P7hDePP9PGbDflYLYgwa8DhFlONNkN+9hrqtBdjj47BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:21:26.654559Z"},"content_sha256":"441545f3a2137bd492a394b45957ca95cfa8723f858cad977f48e9c5a9128e02","schema_version":"1.0","event_id":"sha256:441545f3a2137bd492a394b45957ca95cfa8723f858cad977f48e9c5a9128e02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TQ6KS2P34MBLJYIZTKBIYP3C2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A flexible sequential Monte Carlo algorithm for parametric constrained regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Berwin A. Turlach, Kenyon Ng, Kevin Murray","submitted_at":"2018-10-02T05:18:44Z","abstract_excerpt":"An algorithm is proposed that enables the imposition of shape constraints on regression curves, without requiring the constraints to be written as closed-form expressions, nor assuming the functional form of the loss function. This algorithm is based on Sequential Monte Carlo-Simulated Annealing and only relies on an indicator function that assesses whether or not the constraints are fulfilled, thus allowing the enforcement of various complex constraints by specifying an appropriate indicator function without altering other parts of the algorithm. The algorithm is illustrated by fitting ration"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01072","kind":"arxiv","version":3},"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-17T23:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URwTmaMtCwWQcNEKse4KrVUmi2662cwBzktwQaT0xcilA7MK2ScQk/PfKK+0w4T6iqgZkKnjyiqA+VsJp7VXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:21:26.655203Z"},"content_sha256":"6e3b992e2efa3807c8d56d43c59274619dd21edc8674df9a2982aab96b0dea96","schema_version":"1.0","event_id":"sha256:6e3b992e2efa3807c8d56d43c59274619dd21edc8674df9a2982aab96b0dea96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R/bundle.json","state_url":"https://pith.science/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R/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-30T14:21:26Z","links":{"resolver":"https://pith.science/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R","bundle":"https://pith.science/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R/bundle.json","state":"https://pith.science/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQ6KS2P34MBLJYIZTKBIYP3C2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TQ6KS2P34MBLJYIZTKBIYP3C2R","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":"bc2f0c3d575feb80d927f3096a1a7a2f1d1fada7b4b436ae4f0c4f7a417fdf74","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-02T05:18:44Z","title_canon_sha256":"fc678a83ccacfceaf6369fe6a07eeafb63ed1f5fff2d22324a592b3935a5aa83"},"schema_version":"1.0","source":{"id":"1810.01072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01072","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01072v3","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01072","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"TQ6KS2P34MBL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TQ6KS2P34MBLJYIZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TQ6KS2P3","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:6e3b992e2efa3807c8d56d43c59274619dd21edc8674df9a2982aab96b0dea96","target":"graph","created_at":"2026-05-17T23:49:22Z","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":"An algorithm is proposed that enables the imposition of shape constraints on regression curves, without requiring the constraints to be written as closed-form expressions, nor assuming the functional form of the loss function. This algorithm is based on Sequential Monte Carlo-Simulated Annealing and only relies on an indicator function that assesses whether or not the constraints are fulfilled, thus allowing the enforcement of various complex constraints by specifying an appropriate indicator function without altering other parts of the algorithm. The algorithm is illustrated by fitting ration","authors_text":"Berwin A. Turlach, Kenyon Ng, Kevin Murray","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-02T05:18:44Z","title":"A flexible sequential Monte Carlo algorithm for parametric constrained regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01072","kind":"arxiv","version":3},"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:441545f3a2137bd492a394b45957ca95cfa8723f858cad977f48e9c5a9128e02","target":"record","created_at":"2026-05-17T23:49:22Z","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":"bc2f0c3d575feb80d927f3096a1a7a2f1d1fada7b4b436ae4f0c4f7a417fdf74","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-02T05:18:44Z","title_canon_sha256":"fc678a83ccacfceaf6369fe6a07eeafb63ed1f5fff2d22324a592b3935a5aa83"},"schema_version":"1.0","source":{"id":"1810.01072","kind":"arxiv","version":3}},"canonical_sha256":"9c3ca969fbe302b4e1199a828c3f62d47590f733f9626d95afc6510408d942b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c3ca969fbe302b4e1199a828c3f62d47590f733f9626d95afc6510408d942b0","first_computed_at":"2026-05-17T23:49:22.254543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:22.254543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rb3haiKj8C9N05yswhO70U4ba/ui4pkM4kHeIFYzRx2+GIPzljaf7N0Vz8nLOf0HNezo83vm+FED/xHY0cRrAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:22.254981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:441545f3a2137bd492a394b45957ca95cfa8723f858cad977f48e9c5a9128e02","sha256:6e3b992e2efa3807c8d56d43c59274619dd21edc8674df9a2982aab96b0dea96"],"state_sha256":"a08dac3e4c727e4cce7e0d56d362f35429044e0d25956602f94089ab438cd869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbaDZ1IrCbcqFRR04w2XbhaA/ZzHZqmk19IKUuxF+OeVt4vafLFoQUdCn+7G7IfYnQcCPU+ncLk4sIWuGB2FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:21:26.658744Z","bundle_sha256":"da4a2987f70a3e574ceb10a0b49674c78d9f836fb678507ad05eac90b62ae5fd"}}