{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NQFET3YIXC5QNBBWOOFT5RN4CE","short_pith_number":"pith:NQFET3YI","canonical_record":{"source":{"id":"2606.28405","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-24T13:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"ce9b0e9a15671ed49b6eab753e6408cdf1627563cc0cf6aaa22463a054748645","abstract_canon_sha256":"8477c475c0c46c9cdd5a79c7b5c4ac7754872170be0f54024e7e2655721213e3"},"schema_version":"1.0"},"canonical_sha256":"6c0a49ef08b8bb068436738b3ec5bc112ae85042a46938833947437c3e0fb11b","source":{"kind":"arxiv","id":"2606.28405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28405","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28405v1","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28405","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"pith_short_12","alias_value":"NQFET3YIXC5Q","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"pith_short_16","alias_value":"NQFET3YIXC5QNBBW","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"pith_short_8","alias_value":"NQFET3YI","created_at":"2026-06-30T00:15:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NQFET3YIXC5QNBBWOOFT5RN4CE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.28405","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-24T13:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"ce9b0e9a15671ed49b6eab753e6408cdf1627563cc0cf6aaa22463a054748645","abstract_canon_sha256":"8477c475c0c46c9cdd5a79c7b5c4ac7754872170be0f54024e7e2655721213e3"},"schema_version":"1.0"},"canonical_sha256":"6c0a49ef08b8bb068436738b3ec5bc112ae85042a46938833947437c3e0fb11b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:13.212875Z","signature_b64":"o0OiFv57kRf+50N1Nf2cBtn2KzXs4OM3XdkwJCtaNCIzrUw4XDw+B/GP1phZPwYSfPi9ZugO2AICv12LEIqMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c0a49ef08b8bb068436738b3ec5bc112ae85042a46938833947437c3e0fb11b","last_reissued_at":"2026-06-30T00:15:13.212433Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:13.212433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.28405","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-06-30T00:15:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKPWCTZ1uSL5Hov977upsLEZsYyXjwzGQcwfFc4q0T4F5YHLcE/1rcBYnGIKhbpa5EDjktE3TOcznxLXKSeUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:45:01.090233Z"},"content_sha256":"4a0297e38774da49628ec0b0e2d2f306ad96f2494f6aa09350a7dde19f2dbda7","schema_version":"1.0","event_id":"sha256:4a0297e38774da49628ec0b0e2d2f306ad96f2494f6aa09350a7dde19f2dbda7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NQFET3YIXC5QNBBWOOFT5RN4CE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Layer Interaction Using Key-Correlated Layer Attention","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"ChuanBo Xie, Jianlong Xiong, Le Yu, Quansong He, Tao He","submitted_at":"2026-06-24T13:54:52Z","abstract_excerpt":"Recent advances in network architecture design have introduced layer attention to enhance inter-layer interactions. In such frameworks, each layer queries all preceding layers to establish cross-layer connections. However, layer attention results in quadratic computational complexity with respect to network depth. To mitigate this issue, prior works have proposed Recurrent Layer Attention (RLA) and linear attention mechanisms, which suffer from static information updates and limited long-range cross-layer dependency modeling. To overcome these limitations, we propose Key-Correlated Layer Atten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28405","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/2606.28405/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-06-30T00:15:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YztpQMbxzS1rFGrt6CvEMzpKaGOwpFifF1QndFxlI/3QgGL7P7Ev82egQUoZfzYWofo2OHgOrdjKB8y5tOGfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:45:01.090623Z"},"content_sha256":"2f4755e31d08aba854f1469869c8f25a3e473a2002e697ffd06812d9b579e929","schema_version":"1.0","event_id":"sha256:2f4755e31d08aba854f1469869c8f25a3e473a2002e697ffd06812d9b579e929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQFET3YIXC5QNBBWOOFT5RN4CE/bundle.json","state_url":"https://pith.science/pith/NQFET3YIXC5QNBBWOOFT5RN4CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQFET3YIXC5QNBBWOOFT5RN4CE/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-02T09:45:01Z","links":{"resolver":"https://pith.science/pith/NQFET3YIXC5QNBBWOOFT5RN4CE","bundle":"https://pith.science/pith/NQFET3YIXC5QNBBWOOFT5RN4CE/bundle.json","state":"https://pith.science/pith/NQFET3YIXC5QNBBWOOFT5RN4CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQFET3YIXC5QNBBWOOFT5RN4CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NQFET3YIXC5QNBBWOOFT5RN4CE","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":"8477c475c0c46c9cdd5a79c7b5c4ac7754872170be0f54024e7e2655721213e3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-24T13:54:52Z","title_canon_sha256":"ce9b0e9a15671ed49b6eab753e6408cdf1627563cc0cf6aaa22463a054748645"},"schema_version":"1.0","source":{"id":"2606.28405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28405","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28405v1","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28405","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"pith_short_12","alias_value":"NQFET3YIXC5Q","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"pith_short_16","alias_value":"NQFET3YIXC5QNBBW","created_at":"2026-06-30T00:15:13Z"},{"alias_kind":"pith_short_8","alias_value":"NQFET3YI","created_at":"2026-06-30T00:15:13Z"}],"graph_snapshots":[{"event_id":"sha256:2f4755e31d08aba854f1469869c8f25a3e473a2002e697ffd06812d9b579e929","target":"graph","created_at":"2026-06-30T00:15:13Z","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/2606.28405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent advances in network architecture design have introduced layer attention to enhance inter-layer interactions. In such frameworks, each layer queries all preceding layers to establish cross-layer connections. However, layer attention results in quadratic computational complexity with respect to network depth. To mitigate this issue, prior works have proposed Recurrent Layer Attention (RLA) and linear attention mechanisms, which suffer from static information updates and limited long-range cross-layer dependency modeling. To overcome these limitations, we propose Key-Correlated Layer Atten","authors_text":"ChuanBo Xie, Jianlong Xiong, Le Yu, Quansong He, Tao He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-24T13:54:52Z","title":"Enhancing Layer Interaction Using Key-Correlated Layer Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28405","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:4a0297e38774da49628ec0b0e2d2f306ad96f2494f6aa09350a7dde19f2dbda7","target":"record","created_at":"2026-06-30T00:15:13Z","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":"8477c475c0c46c9cdd5a79c7b5c4ac7754872170be0f54024e7e2655721213e3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-06-24T13:54:52Z","title_canon_sha256":"ce9b0e9a15671ed49b6eab753e6408cdf1627563cc0cf6aaa22463a054748645"},"schema_version":"1.0","source":{"id":"2606.28405","kind":"arxiv","version":1}},"canonical_sha256":"6c0a49ef08b8bb068436738b3ec5bc112ae85042a46938833947437c3e0fb11b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c0a49ef08b8bb068436738b3ec5bc112ae85042a46938833947437c3e0fb11b","first_computed_at":"2026-06-30T00:15:13.212433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T00:15:13.212433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o0OiFv57kRf+50N1Nf2cBtn2KzXs4OM3XdkwJCtaNCIzrUw4XDw+B/GP1phZPwYSfPi9ZugO2AICv12LEIqMBA==","signature_status":"signed_v1","signed_at":"2026-06-30T00:15:13.212875Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a0297e38774da49628ec0b0e2d2f306ad96f2494f6aa09350a7dde19f2dbda7","sha256:2f4755e31d08aba854f1469869c8f25a3e473a2002e697ffd06812d9b579e929"],"state_sha256":"dba170e2a0e4e8abad4dbb3182bba0b6ebfb6d0d4d97dcb31457f368d68fd0ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TfvNeMDawIMSsylT0djSC9sr1yU0IBBkjdvAtBk4NZy4O+d4PNyKbaUtkOEAGCz6yzoXsF+E7m+eMXLGajLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:45:01.092648Z","bundle_sha256":"dadae07fe671914db873a9e54a59ce00b581241993373697f92c321ee10eb0c2"}}