{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LJ7WRS7GFQU5Y7O3OYH26ZRWE2","short_pith_number":"pith:LJ7WRS7G","canonical_record":{"source":{"id":"1612.00385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T19:11:24Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"8b1d95c79801bc3fa1d0b9f7aa0eeab8a84cdf1f61785a5a8b8dd1995aa8fb86","abstract_canon_sha256":"4a3756b8fff0ccf1f94069fcf791f7f0434d153ab339cc1b6f237128cf016f16"},"schema_version":"1.0"},"canonical_sha256":"5a7f68cbe62c29dc7ddb760faf663626a3783c7e3d2eea9ec7ac531692565611","source":{"kind":"arxiv","id":"1612.00385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00385","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00385v2","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00385","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"LJ7WRS7GFQU5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LJ7WRS7GFQU5Y7O3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LJ7WRS7G","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LJ7WRS7GFQU5Y7O3OYH26ZRWE2","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T19:11:24Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"8b1d95c79801bc3fa1d0b9f7aa0eeab8a84cdf1f61785a5a8b8dd1995aa8fb86","abstract_canon_sha256":"4a3756b8fff0ccf1f94069fcf791f7f0434d153ab339cc1b6f237128cf016f16"},"schema_version":"1.0"},"canonical_sha256":"5a7f68cbe62c29dc7ddb760faf663626a3783c7e3d2eea9ec7ac531692565611","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.758582Z","signature_b64":"STWOqC8wauZxR1afG7LjhIhhQeQ9kmmIIi7pq/ttQB/IolmBtyE+cd4fdzmrdqJIwKFqjBkzPxG3b2cCkN9MCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7f68cbe62c29dc7ddb760faf663626a3783c7e3d2eea9ec7ac531692565611","last_reissued_at":"2026-05-18T00:46:18.758143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.758143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00385","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-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7I2g41FDY0p+/Rlcy8or8blVJWAR9OVRb08dmJov8A8/5TKpwj2mnGcidMHFlr28tXIzdA+87zfkAlxPFtbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:01:02.092469Z"},"content_sha256":"72efb671dfe567c6f625af1f0a72fa92bdb1de06a0f41ac804da11ee442be9cd","schema_version":"1.0","event_id":"sha256:72efb671dfe567c6f625af1f0a72fa92bdb1de06a0f41ac804da11ee442be9cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LJ7WRS7GFQU5Y7O3OYH26ZRWE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Attention-Gated Model for Robust Sequence Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.CV","authors_text":"David M.J. Tax, Louis-Philippe Morency, Tadas Baltru\\v{s}aitis, Wenjie Pei","submitted_at":"2016-12-01T19:11:24Z","abstract_excerpt":"Typical techniques for sequence classification are designed for well-segmented sequences which have been edited to remove noisy or irrelevant parts. Therefore, such methods cannot be easily applied on noisy sequences expected in real-world applications. In this paper, we present the Temporal Attention-Gated Model (TAGM) which integrates ideas from attention models and gated recurrent networks to better deal with noisy or unsegmented sequences. Specifically, we extend the concept of attention model to measure the relevance of each observation (time step) of a sequence. We then use a novel gated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00385","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-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNGmQkDrkoMnBK5GdejRacENe4nauaSJVzgtzjTiB2jJouD6WZFfY+BZcik9DlpaX5krIoGEq8b2H4O26v7QBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:01:02.093104Z"},"content_sha256":"aabc29c073c9cd19a3a702dff9ef5713fa2f6069e96e550024f9691c645c6612","schema_version":"1.0","event_id":"sha256:aabc29c073c9cd19a3a702dff9ef5713fa2f6069e96e550024f9691c645c6612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2/bundle.json","state_url":"https://pith.science/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2/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-31T18:01:02Z","links":{"resolver":"https://pith.science/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2","bundle":"https://pith.science/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2/bundle.json","state":"https://pith.science/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ7WRS7GFQU5Y7O3OYH26ZRWE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LJ7WRS7GFQU5Y7O3OYH26ZRWE2","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":"4a3756b8fff0ccf1f94069fcf791f7f0434d153ab339cc1b6f237128cf016f16","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T19:11:24Z","title_canon_sha256":"8b1d95c79801bc3fa1d0b9f7aa0eeab8a84cdf1f61785a5a8b8dd1995aa8fb86"},"schema_version":"1.0","source":{"id":"1612.00385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00385","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00385v2","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00385","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"LJ7WRS7GFQU5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LJ7WRS7GFQU5Y7O3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LJ7WRS7G","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:aabc29c073c9cd19a3a702dff9ef5713fa2f6069e96e550024f9691c645c6612","target":"graph","created_at":"2026-05-18T00:46:18Z","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":"Typical techniques for sequence classification are designed for well-segmented sequences which have been edited to remove noisy or irrelevant parts. Therefore, such methods cannot be easily applied on noisy sequences expected in real-world applications. In this paper, we present the Temporal Attention-Gated Model (TAGM) which integrates ideas from attention models and gated recurrent networks to better deal with noisy or unsegmented sequences. Specifically, we extend the concept of attention model to measure the relevance of each observation (time step) of a sequence. We then use a novel gated","authors_text":"David M.J. Tax, Louis-Philippe Morency, Tadas Baltru\\v{s}aitis, Wenjie Pei","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T19:11:24Z","title":"Temporal Attention-Gated Model for Robust Sequence Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00385","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:72efb671dfe567c6f625af1f0a72fa92bdb1de06a0f41ac804da11ee442be9cd","target":"record","created_at":"2026-05-18T00:46:18Z","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":"4a3756b8fff0ccf1f94069fcf791f7f0434d153ab339cc1b6f237128cf016f16","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-01T19:11:24Z","title_canon_sha256":"8b1d95c79801bc3fa1d0b9f7aa0eeab8a84cdf1f61785a5a8b8dd1995aa8fb86"},"schema_version":"1.0","source":{"id":"1612.00385","kind":"arxiv","version":2}},"canonical_sha256":"5a7f68cbe62c29dc7ddb760faf663626a3783c7e3d2eea9ec7ac531692565611","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a7f68cbe62c29dc7ddb760faf663626a3783c7e3d2eea9ec7ac531692565611","first_computed_at":"2026-05-18T00:46:18.758143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.758143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"STWOqC8wauZxR1afG7LjhIhhQeQ9kmmIIi7pq/ttQB/IolmBtyE+cd4fdzmrdqJIwKFqjBkzPxG3b2cCkN9MCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.758582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72efb671dfe567c6f625af1f0a72fa92bdb1de06a0f41ac804da11ee442be9cd","sha256:aabc29c073c9cd19a3a702dff9ef5713fa2f6069e96e550024f9691c645c6612"],"state_sha256":"cd6698e1a79446d0796158fc68a66dec98472771570be8e24621dafae8901774"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UgUXW/CcMW7W5AcvDFBCq0RRfGVRZwrBLK0KRd7YtzhQYnaf8X7vDQqIiv20B0Y1Ms+7IxZ/LmCWD90sFURCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:01:02.096749Z","bundle_sha256":"3877e1a3c6b71d9503b8e53fd205a48c36ebe105be467a1e8dcebb23e54784c8"}}