{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5VG65G3FOUYHNZDGAI34CVSAIS","short_pith_number":"pith:5VG65G3F","canonical_record":{"source":{"id":"1912.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-12T02:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"8eec0801eae69055f78ba3af7881791fed1ac7ede5ac10804ca2dbaef4935bde","abstract_canon_sha256":"b23745f3c30bfb197cafc4e50c60a8efbbaa0cf6f512aab85e6679f100b22c46"},"schema_version":"1.0"},"canonical_sha256":"ed4dee9b65753076e4660237c1564044a5f14e5c4a98a54f8ab4b8dcef7f6a49","source":{"kind":"arxiv","id":"1912.05729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.05729","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1912.05729v1","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.05729","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"5VG65G3FOUYH","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"pith_short_16","alias_value":"5VG65G3FOUYHNZDG","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"pith_short_8","alias_value":"5VG65G3F","created_at":"2026-07-05T00:25:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5VG65G3FOUYHNZDGAI34CVSAIS","target":"record","payload":{"canonical_record":{"source":{"id":"1912.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-12T02:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"8eec0801eae69055f78ba3af7881791fed1ac7ede5ac10804ca2dbaef4935bde","abstract_canon_sha256":"b23745f3c30bfb197cafc4e50c60a8efbbaa0cf6f512aab85e6679f100b22c46"},"schema_version":"1.0"},"canonical_sha256":"ed4dee9b65753076e4660237c1564044a5f14e5c4a98a54f8ab4b8dcef7f6a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:42.211044Z","signature_b64":"Bm8AaZIZBpbpVn6137rDGshwM23nkdPOVhnDartSuZOW33k60+qKlcyahGWUpuTs2riJ5lIsEcP2mvwH9abvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed4dee9b65753076e4660237c1564044a5f14e5c4a98a54f8ab4b8dcef7f6a49","last_reissued_at":"2026-07-05T00:25:42.210518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:42.210518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.05729","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-05T00:25:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QPjXnhsoRUVh9MH/KPrnTiPm2z9Cay9kzxRS+L0KdSRtHLQzU924fkGq9ZcEu9VRzIr8ymeQO5NWLhMS3M65DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T14:37:39.522365Z"},"content_sha256":"926828e8adebac43c6d4722b7b0079426de118d95803d2c1099059a63194a79d","schema_version":"1.0","event_id":"sha256:926828e8adebac43c6d4722b7b0079426de118d95803d2c1099059a63194a79d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5VG65G3FOUYHNZDGAI34CVSAIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Activity Forecasting for Generating Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bisser Raytchev, Daisuke Ogawa, Kazufumi Kaneda, Ken Yoda, Toru Tamaki, Tsubasa Hirakawa","submitted_at":"2019-12-12T02:05:24Z","abstract_excerpt":"An efficient inverse reinforcement learning for generating trajectories is proposed based of 2D and 3D activity forecasting. We modify reward function with $L_p$ norm and propose convolution into value iteration steps, which is called convolutional value iteration. Experimental results with seabird trajectories (43 for training and 10 for test), our method is best in terms of MHD error and performs fastest. Generated trajectories for interpolating missing parts of trajectories look much similar to real seabird trajectories than those by the previous works."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.05729","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/1912.05729/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-05T00:25:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NL6JWTEucbmhXeo8qurneIA+cXz0nDxYilzhIiYHU9f6I46Prw0J+0P+GPrO+nMtPLq8XzQzeRimelH7N/ClBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T14:37:39.522740Z"},"content_sha256":"ea6b55f8535c8ebf7fde51984cbb95f144ab964373003bc519747f5d674e9131","schema_version":"1.0","event_id":"sha256:ea6b55f8535c8ebf7fde51984cbb95f144ab964373003bc519747f5d674e9131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VG65G3FOUYHNZDGAI34CVSAIS/bundle.json","state_url":"https://pith.science/pith/5VG65G3FOUYHNZDGAI34CVSAIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VG65G3FOUYHNZDGAI34CVSAIS/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-07-11T14:37:39Z","links":{"resolver":"https://pith.science/pith/5VG65G3FOUYHNZDGAI34CVSAIS","bundle":"https://pith.science/pith/5VG65G3FOUYHNZDGAI34CVSAIS/bundle.json","state":"https://pith.science/pith/5VG65G3FOUYHNZDGAI34CVSAIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VG65G3FOUYHNZDGAI34CVSAIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5VG65G3FOUYHNZDGAI34CVSAIS","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":"b23745f3c30bfb197cafc4e50c60a8efbbaa0cf6f512aab85e6679f100b22c46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-12T02:05:24Z","title_canon_sha256":"8eec0801eae69055f78ba3af7881791fed1ac7ede5ac10804ca2dbaef4935bde"},"schema_version":"1.0","source":{"id":"1912.05729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.05729","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1912.05729v1","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.05729","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"5VG65G3FOUYH","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"pith_short_16","alias_value":"5VG65G3FOUYHNZDG","created_at":"2026-07-05T00:25:42Z"},{"alias_kind":"pith_short_8","alias_value":"5VG65G3F","created_at":"2026-07-05T00:25:42Z"}],"graph_snapshots":[{"event_id":"sha256:ea6b55f8535c8ebf7fde51984cbb95f144ab964373003bc519747f5d674e9131","target":"graph","created_at":"2026-07-05T00:25:42Z","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/1912.05729/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An efficient inverse reinforcement learning for generating trajectories is proposed based of 2D and 3D activity forecasting. We modify reward function with $L_p$ norm and propose convolution into value iteration steps, which is called convolutional value iteration. Experimental results with seabird trajectories (43 for training and 10 for test), our method is best in terms of MHD error and performs fastest. Generated trajectories for interpolating missing parts of trajectories look much similar to real seabird trajectories than those by the previous works.","authors_text":"Bisser Raytchev, Daisuke Ogawa, Kazufumi Kaneda, Ken Yoda, Toru Tamaki, Tsubasa Hirakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-12T02:05:24Z","title":"Improved Activity Forecasting for Generating Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.05729","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:926828e8adebac43c6d4722b7b0079426de118d95803d2c1099059a63194a79d","target":"record","created_at":"2026-07-05T00:25:42Z","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":"b23745f3c30bfb197cafc4e50c60a8efbbaa0cf6f512aab85e6679f100b22c46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-12T02:05:24Z","title_canon_sha256":"8eec0801eae69055f78ba3af7881791fed1ac7ede5ac10804ca2dbaef4935bde"},"schema_version":"1.0","source":{"id":"1912.05729","kind":"arxiv","version":1}},"canonical_sha256":"ed4dee9b65753076e4660237c1564044a5f14e5c4a98a54f8ab4b8dcef7f6a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed4dee9b65753076e4660237c1564044a5f14e5c4a98a54f8ab4b8dcef7f6a49","first_computed_at":"2026-07-05T00:25:42.210518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:25:42.210518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bm8AaZIZBpbpVn6137rDGshwM23nkdPOVhnDartSuZOW33k60+qKlcyahGWUpuTs2riJ5lIsEcP2mvwH9abvAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:25:42.211044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.05729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:926828e8adebac43c6d4722b7b0079426de118d95803d2c1099059a63194a79d","sha256:ea6b55f8535c8ebf7fde51984cbb95f144ab964373003bc519747f5d674e9131"],"state_sha256":"c22b1a893a9916d819d3caaec80c07041945ed5aa47ece0da263cbaf21f60ed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CByG5vm2Qg3J7dCN0d4bB33Dl/B6dUetvcUTvtJwBsaTG+T9oQPs7oOVI6IpvUBs4WnVPxRv/w3pTjir/Nw8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T14:37:39.524898Z","bundle_sha256":"1a268deee43ad8448d9f86afa002c2786ffc1f7fb589d2fcc32b53a7a0492917"}}