{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ETCT2Z4TK3AKSPJML5NVBI2R6M","short_pith_number":"pith:ETCT2Z4T","canonical_record":{"source":{"id":"2211.00348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T09:37:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d20bfa00e96b7fbd19768d6c1a0ce319200045ee207d2bf9ab2a4ad4b8c60607","abstract_canon_sha256":"a581afd1e6f7a877503734c68bfeb978626e9098c42cfb2460c45857a93d2406"},"schema_version":"1.0"},"canonical_sha256":"24c53d679356c0a93d2c5f5b50a351f320c9afd48f1f0dcd77c0e49de76600b1","source":{"kind":"arxiv","id":"2211.00348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.00348","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"arxiv_version","alias_value":"2211.00348v1","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00348","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"pith_short_12","alias_value":"ETCT2Z4TK3AK","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"pith_short_16","alias_value":"ETCT2Z4TK3AKSPJM","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"pith_short_8","alias_value":"ETCT2Z4T","created_at":"2026-07-05T09:17:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ETCT2Z4TK3AKSPJML5NVBI2R6M","target":"record","payload":{"canonical_record":{"source":{"id":"2211.00348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T09:37:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d20bfa00e96b7fbd19768d6c1a0ce319200045ee207d2bf9ab2a4ad4b8c60607","abstract_canon_sha256":"a581afd1e6f7a877503734c68bfeb978626e9098c42cfb2460c45857a93d2406"},"schema_version":"1.0"},"canonical_sha256":"24c53d679356c0a93d2c5f5b50a351f320c9afd48f1f0dcd77c0e49de76600b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:09.721436Z","signature_b64":"fsHIVd9RpnM4CJoNuiULTwp8HxAG1Zs7PCUomw4GIJqj3AHJu4MfDr9EFgWLaJJpVsNEx14OE7+OVW9PkKukCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c53d679356c0a93d2c5f5b50a351f320c9afd48f1f0dcd77c0e49de76600b1","last_reissued_at":"2026-07-05T09:17:09.720923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:09.720923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.00348","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-05T09:17:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzH+335FyoJFx+N7PvW95k/G9y/zVIzQAlVVhIA3ZpfH0lVmi3Gg/HsSYNezpNl+7JYloJbE3e6bUBQq7O6lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T04:57:58.400343Z"},"content_sha256":"8529b278bfbb69f4d2033ddfe16b95350f0ec7d60a2848ac4e312acab2cee856","schema_version":"1.0","event_id":"sha256:8529b278bfbb69f4d2033ddfe16b95350f0ec7d60a2848ac4e312acab2cee856"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ETCT2Z4TK3AKSPJML5NVBI2R6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Informed Priors for Knowledge Integration in Trajectory Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christian Schlauch, Christian Wirth, Nadja Klein","submitted_at":"2022-11-01T09:37:14Z","abstract_excerpt":"Informed machine learning methods allow the integration of prior knowledge into learning systems. This can increase accuracy and robustness or reduce data needs. However, existing methods often assume hard constraining knowledge, that does not require to trade-off prior knowledge with observations, but can be used to directly reduce the problem space. Other approaches use specific, architectural changes as representation of prior knowledge, limiting applicability. We propose an informed machine learning method, based on continual learning. This allows the integration of arbitrary, prior knowle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00348","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/2211.00348/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-05T09:17:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1y8n+vBuzBz8Oi31ke9eb/biMuwnBEpOZeQ0kHbhButtpYviGZcgbCeaAi5gHXQWXSWoF0BRSuax0BfAuDEHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T04:57:58.400846Z"},"content_sha256":"7e8b41d080782dc9d1b1784cc9920f80fb5cb78cb301c3ae55545dd1e1c05e59","schema_version":"1.0","event_id":"sha256:7e8b41d080782dc9d1b1784cc9920f80fb5cb78cb301c3ae55545dd1e1c05e59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M/bundle.json","state_url":"https://pith.science/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M/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-01T04:57:58Z","links":{"resolver":"https://pith.science/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M","bundle":"https://pith.science/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M/bundle.json","state":"https://pith.science/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETCT2Z4TK3AKSPJML5NVBI2R6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ETCT2Z4TK3AKSPJML5NVBI2R6M","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":"a581afd1e6f7a877503734c68bfeb978626e9098c42cfb2460c45857a93d2406","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T09:37:14Z","title_canon_sha256":"d20bfa00e96b7fbd19768d6c1a0ce319200045ee207d2bf9ab2a4ad4b8c60607"},"schema_version":"1.0","source":{"id":"2211.00348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.00348","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"arxiv_version","alias_value":"2211.00348v1","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00348","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"pith_short_12","alias_value":"ETCT2Z4TK3AK","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"pith_short_16","alias_value":"ETCT2Z4TK3AKSPJM","created_at":"2026-07-05T09:17:09Z"},{"alias_kind":"pith_short_8","alias_value":"ETCT2Z4T","created_at":"2026-07-05T09:17:09Z"}],"graph_snapshots":[{"event_id":"sha256:7e8b41d080782dc9d1b1784cc9920f80fb5cb78cb301c3ae55545dd1e1c05e59","target":"graph","created_at":"2026-07-05T09:17:09Z","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/2211.00348/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Informed machine learning methods allow the integration of prior knowledge into learning systems. This can increase accuracy and robustness or reduce data needs. However, existing methods often assume hard constraining knowledge, that does not require to trade-off prior knowledge with observations, but can be used to directly reduce the problem space. Other approaches use specific, architectural changes as representation of prior knowledge, limiting applicability. We propose an informed machine learning method, based on continual learning. This allows the integration of arbitrary, prior knowle","authors_text":"Christian Schlauch, Christian Wirth, Nadja Klein","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T09:37:14Z","title":"Informed Priors for Knowledge Integration in Trajectory Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00348","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:8529b278bfbb69f4d2033ddfe16b95350f0ec7d60a2848ac4e312acab2cee856","target":"record","created_at":"2026-07-05T09:17:09Z","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":"a581afd1e6f7a877503734c68bfeb978626e9098c42cfb2460c45857a93d2406","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T09:37:14Z","title_canon_sha256":"d20bfa00e96b7fbd19768d6c1a0ce319200045ee207d2bf9ab2a4ad4b8c60607"},"schema_version":"1.0","source":{"id":"2211.00348","kind":"arxiv","version":1}},"canonical_sha256":"24c53d679356c0a93d2c5f5b50a351f320c9afd48f1f0dcd77c0e49de76600b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24c53d679356c0a93d2c5f5b50a351f320c9afd48f1f0dcd77c0e49de76600b1","first_computed_at":"2026-07-05T09:17:09.720923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:17:09.720923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fsHIVd9RpnM4CJoNuiULTwp8HxAG1Zs7PCUomw4GIJqj3AHJu4MfDr9EFgWLaJJpVsNEx14OE7+OVW9PkKukCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:17:09.721436Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.00348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8529b278bfbb69f4d2033ddfe16b95350f0ec7d60a2848ac4e312acab2cee856","sha256:7e8b41d080782dc9d1b1784cc9920f80fb5cb78cb301c3ae55545dd1e1c05e59"],"state_sha256":"de35d9e6357283edfc1e2779a4f424b15a58acec44fe1d356c650ddccee243fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"duWRa6Aj9TgcbuiyC7v0F/q8jP/000MDaOKGWzfmhgQN78L17+YQHVdMEzdF988o6PW20ryVVX0ifYDNE7QJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T04:57:58.406008Z","bundle_sha256":"bc5325051d10da041437c9a5457701c2b03cd3a340e22dc3cf05b48e60123a73"}}