{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C2FFMUKBQ7LGKSQILBXRTP6ZDN","short_pith_number":"pith:C2FFMUKB","canonical_record":{"source":{"id":"1810.02766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-05T15:54:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f06604fefe2300c88398f6bf78acce65d45e5c046a70e3fa4758d0d928cf9371","abstract_canon_sha256":"753e223b941d49fed575fb0d1d7fa07903b5d14114014cb32cf2a8b07f0fa160"},"schema_version":"1.0"},"canonical_sha256":"168a56514187d6654a08586f19bfd91b529c1389a865309f0e2e367fa63ffacf","source":{"kind":"arxiv","id":"1810.02766","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02766","created_at":"2026-05-18T00:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02766v2","created_at":"2026-05-18T00:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02766","created_at":"2026-05-18T00:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"C2FFMUKBQ7LG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C2FFMUKBQ7LGKSQI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C2FFMUKB","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C2FFMUKBQ7LGKSQILBXRTP6ZDN","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-05T15:54:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f06604fefe2300c88398f6bf78acce65d45e5c046a70e3fa4758d0d928cf9371","abstract_canon_sha256":"753e223b941d49fed575fb0d1d7fa07903b5d14114014cb32cf2a8b07f0fa160"},"schema_version":"1.0"},"canonical_sha256":"168a56514187d6654a08586f19bfd91b529c1389a865309f0e2e367fa63ffacf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:23.996267Z","signature_b64":"zS2xR7x5yPw4Tbxl9jT8iq3W7kshqnQLJKzfzKXRz09Q3JYdD+mwMc8OqkocLV6pI9qVjsDOP/stPR7n/W2LCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168a56514187d6654a08586f19bfd91b529c1389a865309f0e2e367fa63ffacf","last_reissued_at":"2026-05-18T00:03:23.995596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:23.995596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02766","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:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q92Y5EjvqtN762u2MPNekl00qkM7J0Q0ZzL0V516usRToHudnAS/hcscOSfhpqVzBalI2LF1zs9jfA9QfqlWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:44:21.381868Z"},"content_sha256":"6247707580bf6d5e64e4e8ad5f38de635ea0d19fe89901136aca557015750ea6","schema_version":"1.0","event_id":"sha256:6247707580bf6d5e64e4e8ad5f38de635ea0d19fe89901136aca557015750ea6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C2FFMUKBQ7LGKSQILBXRTP6ZDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Recurrent Filtering for Fully Convolutional DenseNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"J\\\"org Wagner, Michael Herman, Sven Behnke, Volker Fischer","submitted_at":"2018-10-05T15:54:46Z","abstract_excerpt":"Generating a robust representation of the environment is a crucial ability of learning agents. Deep learning based methods have greatly improved perception systems but still fail in challenging situations. These failures are often not solvable on the basis of a single image. In this work, we present a parameter-efficient temporal filtering concept which extends an existing single-frame segmentation model to work with multiple frames. The resulting recurrent architecture temporally filters representations on all abstraction levels in a hierarchical manner, while decoupling temporal dependencies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02766","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:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6iycuJK0QejXVnB24kQcGcHWFOhszzrjQGtbH/7FD3Zpakv1ez7MgwIt05csXze9xZ/LxYv2Uhyizl25FKyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:44:21.382232Z"},"content_sha256":"8faf354ca38c6094694a55c0c90db5e7890cf42b5ffa903cc8b5818b0c6b0a89","schema_version":"1.0","event_id":"sha256:8faf354ca38c6094694a55c0c90db5e7890cf42b5ffa903cc8b5818b0c6b0a89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN/bundle.json","state_url":"https://pith.science/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN/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-06-28T13:44:21Z","links":{"resolver":"https://pith.science/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN","bundle":"https://pith.science/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN/bundle.json","state":"https://pith.science/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2FFMUKBQ7LGKSQILBXRTP6ZDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C2FFMUKBQ7LGKSQILBXRTP6ZDN","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":"753e223b941d49fed575fb0d1d7fa07903b5d14114014cb32cf2a8b07f0fa160","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-05T15:54:46Z","title_canon_sha256":"f06604fefe2300c88398f6bf78acce65d45e5c046a70e3fa4758d0d928cf9371"},"schema_version":"1.0","source":{"id":"1810.02766","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02766","created_at":"2026-05-18T00:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02766v2","created_at":"2026-05-18T00:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02766","created_at":"2026-05-18T00:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"C2FFMUKBQ7LG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C2FFMUKBQ7LGKSQI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C2FFMUKB","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:8faf354ca38c6094694a55c0c90db5e7890cf42b5ffa903cc8b5818b0c6b0a89","target":"graph","created_at":"2026-05-18T00:03:23Z","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":"Generating a robust representation of the environment is a crucial ability of learning agents. Deep learning based methods have greatly improved perception systems but still fail in challenging situations. These failures are often not solvable on the basis of a single image. In this work, we present a parameter-efficient temporal filtering concept which extends an existing single-frame segmentation model to work with multiple frames. The resulting recurrent architecture temporally filters representations on all abstraction levels in a hierarchical manner, while decoupling temporal dependencies","authors_text":"J\\\"org Wagner, Michael Herman, Sven Behnke, Volker Fischer","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-05T15:54:46Z","title":"Hierarchical Recurrent Filtering for Fully Convolutional DenseNets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02766","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:6247707580bf6d5e64e4e8ad5f38de635ea0d19fe89901136aca557015750ea6","target":"record","created_at":"2026-05-18T00:03:23Z","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":"753e223b941d49fed575fb0d1d7fa07903b5d14114014cb32cf2a8b07f0fa160","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-05T15:54:46Z","title_canon_sha256":"f06604fefe2300c88398f6bf78acce65d45e5c046a70e3fa4758d0d928cf9371"},"schema_version":"1.0","source":{"id":"1810.02766","kind":"arxiv","version":2}},"canonical_sha256":"168a56514187d6654a08586f19bfd91b529c1389a865309f0e2e367fa63ffacf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"168a56514187d6654a08586f19bfd91b529c1389a865309f0e2e367fa63ffacf","first_computed_at":"2026-05-18T00:03:23.995596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:23.995596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zS2xR7x5yPw4Tbxl9jT8iq3W7kshqnQLJKzfzKXRz09Q3JYdD+mwMc8OqkocLV6pI9qVjsDOP/stPR7n/W2LCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:23.996267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02766","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6247707580bf6d5e64e4e8ad5f38de635ea0d19fe89901136aca557015750ea6","sha256:8faf354ca38c6094694a55c0c90db5e7890cf42b5ffa903cc8b5818b0c6b0a89"],"state_sha256":"97114b9fc11c834531bd391f598ae9260871cc08b4582c24381d4150d7c4ccef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zG2CtWWpmgZ9ZNeBUUaF0P9WSEl8HBpgUOs4CExptfvTLxC+thWhZQCIjiTX7/I4s2lx9905OPiOgLRPB/k/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:44:21.384118Z","bundle_sha256":"023a197282eb2c571940a77ded2f5749e19d401a5afbd8d4c4cef9a1f961a9c4"}}