{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TZRKGJO23GHMGYUA4SJQCHHIXR","short_pith_number":"pith:TZRKGJO2","canonical_record":{"source":{"id":"2201.12854","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-30T16:02:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a7613b55564bed7065663b04de6d399cebac2c15b775dcc54a57c85408711a62","abstract_canon_sha256":"f40b07f0b37d3dc275a918e540fac66c9cc50c2f6d9983dd0685a4823a467cd4"},"schema_version":"1.0"},"canonical_sha256":"9e62a325dad98ec36280e493011ce8bc462163bdfefa411cae805431a88af5b0","source":{"kind":"arxiv","id":"2201.12854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12854","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12854v1","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12854","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"TZRKGJO23GHM","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"TZRKGJO23GHMGYUA","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"TZRKGJO2","created_at":"2026-07-05T03:52:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TZRKGJO23GHMGYUA4SJQCHHIXR","target":"record","payload":{"canonical_record":{"source":{"id":"2201.12854","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-30T16:02:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a7613b55564bed7065663b04de6d399cebac2c15b775dcc54a57c85408711a62","abstract_canon_sha256":"f40b07f0b37d3dc275a918e540fac66c9cc50c2f6d9983dd0685a4823a467cd4"},"schema_version":"1.0"},"canonical_sha256":"9e62a325dad98ec36280e493011ce8bc462163bdfefa411cae805431a88af5b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:40.470599Z","signature_b64":"20M7a3Qq8jke4UX9SWw80hkL0SMkjV9C+yDI1ssVLbfH4rI4GB6FdKNA+lmpL7S02KWZ8PMw+qiR26e37EKtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e62a325dad98ec36280e493011ce8bc462163bdfefa411cae805431a88af5b0","last_reissued_at":"2026-07-05T03:52:40.470097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:40.470097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.12854","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-05T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajM+pG4wI9nFBOoV3UoxnCLJf7dyxhDAGxWS+3GRpuaCDja85oNnWY9KnWGO2BmXEtuQCNjZccwzmsE4E1CxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:28:58.067029Z"},"content_sha256":"ab204056c14800fe9f317b995cb3baf4ab5f8e3c16b411d6e76c7b54522ba4f4","schema_version":"1.0","event_id":"sha256:ab204056c14800fe9f317b995cb3baf4ab5f8e3c16b411d6e76c7b54522ba4f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TZRKGJO23GHMGYUA4SJQCHHIXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Monte-Carlo Approximation of the Attention Mechanism","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hyunjun Kim, JeongGil Ko","submitted_at":"2022-01-30T16:02:35Z","abstract_excerpt":"We introduce Monte-Carlo Attention (MCA), a randomized approximation method for reducing the computational cost of self-attention mechanisms in Transformer architectures. MCA exploits the fact that the importance of each token in an input sequence varies with respect to their attention scores; thus, some degree of error can be tolerable when encoding tokens with low attention. Using approximate matrix multiplication, MCA applies different error bounds to encode input tokens such that those with low attention scores are computed with relaxed precision, whereas errors of salient elements are min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12854","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/2201.12854/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-05T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHhI5D3ta3TQ14SbcXl/Yh9pKsLKRmPbdinTwW4PdlL0xdIVnI++ETqiXyMYY9J67QjGXSUMqWYeoI/Jma/SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:28:58.067526Z"},"content_sha256":"41f32a775faf00d7b959cf2dc5735a1ab622ab0a4bbf64e64b6c6df02fd63588","schema_version":"1.0","event_id":"sha256:41f32a775faf00d7b959cf2dc5735a1ab622ab0a4bbf64e64b6c6df02fd63588"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZRKGJO23GHMGYUA4SJQCHHIXR/bundle.json","state_url":"https://pith.science/pith/TZRKGJO23GHMGYUA4SJQCHHIXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZRKGJO23GHMGYUA4SJQCHHIXR/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-08-21T05:28:58Z","links":{"resolver":"https://pith.science/pith/TZRKGJO23GHMGYUA4SJQCHHIXR","bundle":"https://pith.science/pith/TZRKGJO23GHMGYUA4SJQCHHIXR/bundle.json","state":"https://pith.science/pith/TZRKGJO23GHMGYUA4SJQCHHIXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZRKGJO23GHMGYUA4SJQCHHIXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TZRKGJO23GHMGYUA4SJQCHHIXR","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":"f40b07f0b37d3dc275a918e540fac66c9cc50c2f6d9983dd0685a4823a467cd4","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-30T16:02:35Z","title_canon_sha256":"a7613b55564bed7065663b04de6d399cebac2c15b775dcc54a57c85408711a62"},"schema_version":"1.0","source":{"id":"2201.12854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12854","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12854v1","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12854","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"TZRKGJO23GHM","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"TZRKGJO23GHMGYUA","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"TZRKGJO2","created_at":"2026-07-05T03:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:41f32a775faf00d7b959cf2dc5735a1ab622ab0a4bbf64e64b6c6df02fd63588","target":"graph","created_at":"2026-07-05T03:52:40Z","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/2201.12854/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce Monte-Carlo Attention (MCA), a randomized approximation method for reducing the computational cost of self-attention mechanisms in Transformer architectures. MCA exploits the fact that the importance of each token in an input sequence varies with respect to their attention scores; thus, some degree of error can be tolerable when encoding tokens with low attention. Using approximate matrix multiplication, MCA applies different error bounds to encode input tokens such that those with low attention scores are computed with relaxed precision, whereas errors of salient elements are min","authors_text":"Hyunjun Kim, JeongGil Ko","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-30T16:02:35Z","title":"Fast Monte-Carlo Approximation of the Attention Mechanism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12854","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:ab204056c14800fe9f317b995cb3baf4ab5f8e3c16b411d6e76c7b54522ba4f4","target":"record","created_at":"2026-07-05T03:52:40Z","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":"f40b07f0b37d3dc275a918e540fac66c9cc50c2f6d9983dd0685a4823a467cd4","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-30T16:02:35Z","title_canon_sha256":"a7613b55564bed7065663b04de6d399cebac2c15b775dcc54a57c85408711a62"},"schema_version":"1.0","source":{"id":"2201.12854","kind":"arxiv","version":1}},"canonical_sha256":"9e62a325dad98ec36280e493011ce8bc462163bdfefa411cae805431a88af5b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e62a325dad98ec36280e493011ce8bc462163bdfefa411cae805431a88af5b0","first_computed_at":"2026-07-05T03:52:40.470097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:40.470097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"20M7a3Qq8jke4UX9SWw80hkL0SMkjV9C+yDI1ssVLbfH4rI4GB6FdKNA+lmpL7S02KWZ8PMw+qiR26e37EKtCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:40.470599Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab204056c14800fe9f317b995cb3baf4ab5f8e3c16b411d6e76c7b54522ba4f4","sha256:41f32a775faf00d7b959cf2dc5735a1ab622ab0a4bbf64e64b6c6df02fd63588"],"state_sha256":"b71f2cbe5b0a6ed013d44fe0a1b8229bae33eefd4ba87820d52827f068752a9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfR2q06AOX+aW5O1fJ+A6a3GqoVwFsl7Vf/tDFaeSxtbCL2LcJAhi3mKpBh66x0dgoKA0DNhaGAOqrB+E/WeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T05:28:58.072033Z","bundle_sha256":"d1eada9e629826c89b00e680bdc6c2f005f7475db9105aef93bf7509ac445f25"}}