{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6M3XI6D7SPT3HU3RD7HVRDDWYT","short_pith_number":"pith:6M3XI6D7","canonical_record":{"source":{"id":"2601.21929","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T16:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"78dd33a28004107dd7c42ab3b1c93fa37ede3da53d4fce531824ed5f4229e028","abstract_canon_sha256":"5cb14c34bedd3281c425eef76371d291959ef5adbcdf692d26ccdeb62c3286a9"},"schema_version":"1.0"},"canonical_sha256":"f33774787f93e7b3d3711fcf588c76c4ef8fb134b6edf26ac60b5a799067cf5f","source":{"kind":"arxiv","id":"2601.21929","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.21929","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.21929v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21929","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"6M3XI6D7SPT3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6M3XI6D7SPT3HU3R","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6M3XI6D7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6M3XI6D7SPT3HU3RD7HVRDDWYT","target":"record","payload":{"canonical_record":{"source":{"id":"2601.21929","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T16:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"78dd33a28004107dd7c42ab3b1c93fa37ede3da53d4fce531824ed5f4229e028","abstract_canon_sha256":"5cb14c34bedd3281c425eef76371d291959ef5adbcdf692d26ccdeb62c3286a9"},"schema_version":"1.0"},"canonical_sha256":"f33774787f93e7b3d3711fcf588c76c4ef8fb134b6edf26ac60b5a799067cf5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.522220Z","signature_b64":"tgDNMPjb95alk9oC31P1AFb40pkq+e6Xt/Lup7rwv49T/mTuxtw1i+LUUxsJspp/lbNFYw30IoPfjMx2LDkjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f33774787f93e7b3d3711fcf588c76c4ef8fb134b6edf26ac60b5a799067cf5f","last_reissued_at":"2026-05-17T23:39:16.521480Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.521480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.21929","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-17T23:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNJRbwp2ovE5V7iL4v4ieI9C00JeU5y/AzI/Kki0ZQnkzn7nv9toGRKUCHb482vKAG3YQaE0wuOALiRDSlTNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:31:09.741982Z"},"content_sha256":"95a0dfcf5db00b1356cde8713edc03be20674d12d1cbb7282128858ce06b15ac","schema_version":"1.0","event_id":"sha256:95a0dfcf5db00b1356cde8713edc03be20674d12d1cbb7282128858ce06b15ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6M3XI6D7SPT3HU3RD7HVRDDWYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LoRIF: Low-Rank Influence Functions for Scalable Training Data Attribution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"LoRIF stores low-rank factors of projected gradients and approximates the Hessian inverse in a reduced subspace to scale influence functions for training data attribution.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hieu Le, Jingyi Xu, Mathieu Salzmann, Shuangqi Li","submitted_at":"2026-01-29T16:18:34Z","abstract_excerpt":"Training data attribution (TDA) identifies which training examples most influenced a model's prediction. Influence function methods are a theoretically grounded family of TDA methods and exploit gradients. To overcome the scalability challenge arising from gradient computation, the most popular strategy is random projection (e.g., TRAK, LoGRA). However, this still faces two bottlenecks when scaling to large training sets and high-quality attribution: \\emph{(i)} storing and loading projected per-example gradients for all $N$ training examples, where query latency is dominated by I/O; and \\emph{"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On models from 0.1B to 70B parameters trained on datasets with millions of examples, LoRIF achieves up to 20× storage reduction and query-time speedup compared to LoGRA, while matching or exceeding its attribution quality.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the low-rank structure present in projected gradients is preserved well enough after rank-c truncation and r-dimensional Hessian approximation that attribution scores remain faithful to the full influence function for the target models and datasets.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LoRIF reduces storage and query latency for gradient-based training data attribution from O(D) to O(c sqrt(D)) per sample and Hessian memory from O(D^2) to O(Dr) while preserving attribution quality on models up to 70B parameters.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LoRIF stores low-rank factors of projected gradients and approximates the Hessian inverse in a reduced subspace to scale influence functions for training data attribution.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fd6ff97ddf42a09b03d986a5f09084042b56d1babfc5e36556311e5da5e271a0"},"source":{"id":"2601.21929","kind":"arxiv","version":2},"verdict":{"id":"6f0b4003-2581-4866-8cb3-4cb5810942d0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T10:06:41.215540Z","strongest_claim":"On models from 0.1B to 70B parameters trained on datasets with millions of examples, LoRIF achieves up to 20× storage reduction and query-time speedup compared to LoGRA, while matching or exceeding its attribution quality.","one_line_summary":"LoRIF reduces storage and query latency for gradient-based training data attribution from O(D) to O(c sqrt(D)) per sample and Hessian memory from O(D^2) to O(Dr) while preserving attribution quality on models up to 70B parameters.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the low-rank structure present in projected gradients is preserved well enough after rank-c truncation and r-dimensional Hessian approximation that attribution scores remain faithful to the full influence function for the target models and datasets.","pith_extraction_headline":"LoRIF stores low-rank factors of projected gradients and approximates the Hessian inverse in a reduced subspace to scale influence functions for training data attribution."},"references":{"count":18,"sample":[{"doi":"","year":2024,"title":"Sample subsets:Generate M random subsets {S m}M m=1 of the training data, each containing a fraction α of the full dataset. 2.Compute outputs:For each queryx query and subsetS m: •Actual output:Retrai","work_id":"70e40402-bb50-449b-ba26-ba611d35d487","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"For LoRIF, this includes solving the rank-c factorization via power iteration","work_id":"39e7542c-f4d2-426a-8061-e5644fe0438b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Stage 2: Inverse Hessian approximation.For LoGRA, form and store (G⊤G+λI) −1 per layer. For LoRIF, perform randomized SVD to obtainV r andΣ r, then store them. Tables 5, 6, and 7 report preprocessing ","work_id":"d230f110-fda1-45ea-9d99-67c14f01449f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"A is sitting opposite to D","work_id":"53340404-76c1-4b2e-aff3-3d40b6206ca1","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"B is sitting opposite to F","work_id":"993b0824-3f75-4292-bac6-c5652ab84189","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":18,"snapshot_sha256":"f49952fdacce0c9e2d99501ed2d127420b0945c9a313dbf759b343cc7a380289","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"0fea47bbab7039640c0f79a88f80f5bc87604438f503645c037f43ccea40b8a0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"6f0b4003-2581-4866-8cb3-4cb5810942d0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfF3IIkhbphREKXuGVg22i77QH6NfCcjhxU8IdYXtYgwiKbD56SnLV0EiovBdjuiKClP2ejd9uT86E9FtGPzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:31:09.743137Z"},"content_sha256":"21bede48a4a80cf0a9217e1e19e0f33bef0098c2fac85e79e87adbab8862e679","schema_version":"1.0","event_id":"sha256:21bede48a4a80cf0a9217e1e19e0f33bef0098c2fac85e79e87adbab8862e679"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT/bundle.json","state_url":"https://pith.science/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT/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-31T17:31:09Z","links":{"resolver":"https://pith.science/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT","bundle":"https://pith.science/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT/bundle.json","state":"https://pith.science/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6M3XI6D7SPT3HU3RD7HVRDDWYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6M3XI6D7SPT3HU3RD7HVRDDWYT","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":"5cb14c34bedd3281c425eef76371d291959ef5adbcdf692d26ccdeb62c3286a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T16:18:34Z","title_canon_sha256":"78dd33a28004107dd7c42ab3b1c93fa37ede3da53d4fce531824ed5f4229e028"},"schema_version":"1.0","source":{"id":"2601.21929","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.21929","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.21929v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21929","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"6M3XI6D7SPT3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6M3XI6D7SPT3HU3R","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6M3XI6D7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:21bede48a4a80cf0a9217e1e19e0f33bef0098c2fac85e79e87adbab8862e679","target":"graph","created_at":"2026-05-17T23:39:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"On models from 0.1B to 70B parameters trained on datasets with millions of examples, LoRIF achieves up to 20× storage reduction and query-time speedup compared to LoGRA, while matching or exceeding its attribution quality."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the low-rank structure present in projected gradients is preserved well enough after rank-c truncation and r-dimensional Hessian approximation that attribution scores remain faithful to the full influence function for the target models and datasets."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LoRIF reduces storage and query latency for gradient-based training data attribution from O(D) to O(c sqrt(D)) per sample and Hessian memory from O(D^2) to O(Dr) while preserving attribution quality on models up to 70B parameters."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LoRIF stores low-rank factors of projected gradients and approximates the Hessian inverse in a reduced subspace to scale influence functions for training data attribution."}],"snapshot_sha256":"fd6ff97ddf42a09b03d986a5f09084042b56d1babfc5e36556311e5da5e271a0"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"0fea47bbab7039640c0f79a88f80f5bc87604438f503645c037f43ccea40b8a0"},"paper":{"abstract_excerpt":"Training data attribution (TDA) identifies which training examples most influenced a model's prediction. Influence function methods are a theoretically grounded family of TDA methods and exploit gradients. To overcome the scalability challenge arising from gradient computation, the most popular strategy is random projection (e.g., TRAK, LoGRA). However, this still faces two bottlenecks when scaling to large training sets and high-quality attribution: \\emph{(i)} storing and loading projected per-example gradients for all $N$ training examples, where query latency is dominated by I/O; and \\emph{","authors_text":"Hieu Le, Jingyi Xu, Mathieu Salzmann, Shuangqi Li","cross_cats":[],"headline":"LoRIF stores low-rank factors of projected gradients and approximates the Hessian inverse in a reduced subspace to scale influence functions for training data attribution.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T16:18:34Z","title":"LoRIF: Low-Rank Influence Functions for Scalable Training Data Attribution"},"references":{"count":18,"internal_anchors":0,"resolved_work":18,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Sample subsets:Generate M random subsets {S m}M m=1 of the training data, each containing a fraction α of the full dataset. 2.Compute outputs:For each queryx query and subsetS m: •Actual output:Retrai","work_id":"70e40402-bb50-449b-ba26-ba611d35d487","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"For LoRIF, this includes solving the rank-c factorization via power iteration","work_id":"39e7542c-f4d2-426a-8061-e5644fe0438b","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Stage 2: Inverse Hessian approximation.For LoGRA, form and store (G⊤G+λI) −1 per layer. For LoRIF, perform randomized SVD to obtainV r andΣ r, then store them. Tables 5, 6, and 7 report preprocessing ","work_id":"d230f110-fda1-45ea-9d99-67c14f01449f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A is sitting opposite to D","work_id":"53340404-76c1-4b2e-aff3-3d40b6206ca1","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"B is sitting opposite to F","work_id":"993b0824-3f75-4292-bac6-c5652ab84189","year":null}],"snapshot_sha256":"f49952fdacce0c9e2d99501ed2d127420b0945c9a313dbf759b343cc7a380289"},"source":{"id":"2601.21929","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T10:06:41.215540Z","id":"6f0b4003-2581-4866-8cb3-4cb5810942d0","model_set":{"reader":"grok-4.3"},"one_line_summary":"LoRIF reduces storage and query latency for gradient-based training data attribution from O(D) to O(c sqrt(D)) per sample and Hessian memory from O(D^2) to O(Dr) while preserving attribution quality on models up to 70B parameters.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LoRIF stores low-rank factors of projected gradients and approximates the Hessian inverse in a reduced subspace to scale influence functions for training data attribution.","strongest_claim":"On models from 0.1B to 70B parameters trained on datasets with millions of examples, LoRIF achieves up to 20× storage reduction and query-time speedup compared to LoGRA, while matching or exceeding its attribution quality.","weakest_assumption":"That the low-rank structure present in projected gradients is preserved well enough after rank-c truncation and r-dimensional Hessian approximation that attribution scores remain faithful to the full influence function for the target models and datasets."}},"verdict_id":"6f0b4003-2581-4866-8cb3-4cb5810942d0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95a0dfcf5db00b1356cde8713edc03be20674d12d1cbb7282128858ce06b15ac","target":"record","created_at":"2026-05-17T23:39:16Z","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":"5cb14c34bedd3281c425eef76371d291959ef5adbcdf692d26ccdeb62c3286a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T16:18:34Z","title_canon_sha256":"78dd33a28004107dd7c42ab3b1c93fa37ede3da53d4fce531824ed5f4229e028"},"schema_version":"1.0","source":{"id":"2601.21929","kind":"arxiv","version":2}},"canonical_sha256":"f33774787f93e7b3d3711fcf588c76c4ef8fb134b6edf26ac60b5a799067cf5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f33774787f93e7b3d3711fcf588c76c4ef8fb134b6edf26ac60b5a799067cf5f","first_computed_at":"2026-05-17T23:39:16.521480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.521480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgDNMPjb95alk9oC31P1AFb40pkq+e6Xt/Lup7rwv49T/mTuxtw1i+LUUxsJspp/lbNFYw30IoPfjMx2LDkjDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.522220Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.21929","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a0dfcf5db00b1356cde8713edc03be20674d12d1cbb7282128858ce06b15ac","sha256:21bede48a4a80cf0a9217e1e19e0f33bef0098c2fac85e79e87adbab8862e679"],"state_sha256":"6dd704e9586f7d8978420681150825a94bae4d1e36794ce485efbec7ed8d0140"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdG3x+PLyjH61wTGwfVgA6Kn0bvk1+PAT+Zvj+jNFcWOFYMtXi6y0iFjU8NVFNhZt80vX1t+T6dMcYVGLDBRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:31:09.748174Z","bundle_sha256":"3dd69c4f6a3ee6b52f76025c7cee7fb7539a2ac37a722624b15c1d3284fd3a67"}}