{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V52YU7JHREYI5LNCIAATQ5TLGO","short_pith_number":"pith:V52YU7JH","canonical_record":{"source":{"id":"1907.07897","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T06:47:48Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"f2e94b3340b2012cad84aef420ad740defddda4ac2653829fbfb19bfcda7733b","abstract_canon_sha256":"f20f243473fa55ab8c9f46cc692307b7d99de80117bf65fdd5c6d7919007058e"},"schema_version":"1.0"},"canonical_sha256":"af758a7d2789308eada2400138766b33ba8f9cba060d71d7b6de2cf86bb4395b","source":{"kind":"arxiv","id":"1907.07897","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07897","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07897v3","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07897","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"V52YU7JHREYI","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"pith_short_16","alias_value":"V52YU7JHREYI5LNC","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"pith_short_8","alias_value":"V52YU7JH","created_at":"2026-07-05T00:15:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V52YU7JHREYI5LNCIAATQ5TLGO","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07897","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T06:47:48Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"f2e94b3340b2012cad84aef420ad740defddda4ac2653829fbfb19bfcda7733b","abstract_canon_sha256":"f20f243473fa55ab8c9f46cc692307b7d99de80117bf65fdd5c6d7919007058e"},"schema_version":"1.0"},"canonical_sha256":"af758a7d2789308eada2400138766b33ba8f9cba060d71d7b6de2cf86bb4395b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:07.469894Z","signature_b64":"QvzXoIFaSGHCjcJEgE/47KoNxty+lrWLCsYPlXEq/3aJmt5jlMUdRlxtiyxZ7foVp10+lH0sfLGs5gNlZzwJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af758a7d2789308eada2400138766b33ba8f9cba060d71d7b6de2cf86bb4395b","last_reissued_at":"2026-07-05T00:15:07.469358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:07.469358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07897","source_version":3,"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-05T00:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sy4NkQVzweLwhaxBwsUN1Bd8E6ryFAlhV9RJ+tit9YYoVimqDA+q8k2sp6GTLm6PyRi65YreUE33gquz09+UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:15:55.056887Z"},"content_sha256":"9fb9724b4174defb2c402702a5b8bebdb89a8d3ed3dd876414b33c509f762b3e","schema_version":"1.0","event_id":"sha256:9fb9724b4174defb2c402702a5b8bebdb89a8d3ed3dd876414b33c509f762b3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V52YU7JHREYI5LNCIAATQ5TLGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Shuffle-Exchange Networks -- Sequence Processing in O(n log n) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Agris \\v{S}ostaks, Em\\=ils Ozoli\\c{n}\\v{s}, K\\=arlis Freivalds","submitted_at":"2019-07-18T06:47:48Z","abstract_excerpt":"A key requirement in sequence to sequence processing is the modeling of long range dependencies. To this end, a vast majority of the state-of-the-art models use attention mechanism which is of O($n^2$) complexity that leads to slow execution for long sequences. We introduce a new Shuffle-Exchange neural network model for sequence to sequence tasks which have O(log n) depth and O(n log n) total complexity. We show that this model is powerful enough to infer efficient algorithms for common algorithmic benchmarks including sorting, addition and multiplication. We evaluate our architecture on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07897","kind":"arxiv","version":3},"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/1907.07897/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-05T00:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBETdAspHgb60B6ozThtmldWiOHBWFLBqF2PilQteF0GQ1s4G9sY9EE5VOQzAPiJ5+vm+5lMEzBIlj1eW6TDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:15:55.057415Z"},"content_sha256":"e553fc9a5a2589320efd12e49b0c485440ea41351878755aafc6ec802ebb465c","schema_version":"1.0","event_id":"sha256:e553fc9a5a2589320efd12e49b0c485440ea41351878755aafc6ec802ebb465c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V52YU7JHREYI5LNCIAATQ5TLGO/bundle.json","state_url":"https://pith.science/pith/V52YU7JHREYI5LNCIAATQ5TLGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V52YU7JHREYI5LNCIAATQ5TLGO/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-09T12:15:55Z","links":{"resolver":"https://pith.science/pith/V52YU7JHREYI5LNCIAATQ5TLGO","bundle":"https://pith.science/pith/V52YU7JHREYI5LNCIAATQ5TLGO/bundle.json","state":"https://pith.science/pith/V52YU7JHREYI5LNCIAATQ5TLGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V52YU7JHREYI5LNCIAATQ5TLGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V52YU7JHREYI5LNCIAATQ5TLGO","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":"f20f243473fa55ab8c9f46cc692307b7d99de80117bf65fdd5c6d7919007058e","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T06:47:48Z","title_canon_sha256":"f2e94b3340b2012cad84aef420ad740defddda4ac2653829fbfb19bfcda7733b"},"schema_version":"1.0","source":{"id":"1907.07897","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07897","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07897v3","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07897","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"V52YU7JHREYI","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"pith_short_16","alias_value":"V52YU7JHREYI5LNC","created_at":"2026-07-05T00:15:07Z"},{"alias_kind":"pith_short_8","alias_value":"V52YU7JH","created_at":"2026-07-05T00:15:07Z"}],"graph_snapshots":[{"event_id":"sha256:e553fc9a5a2589320efd12e49b0c485440ea41351878755aafc6ec802ebb465c","target":"graph","created_at":"2026-07-05T00:15:07Z","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/1907.07897/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A key requirement in sequence to sequence processing is the modeling of long range dependencies. To this end, a vast majority of the state-of-the-art models use attention mechanism which is of O($n^2$) complexity that leads to slow execution for long sequences. We introduce a new Shuffle-Exchange neural network model for sequence to sequence tasks which have O(log n) depth and O(n log n) total complexity. We show that this model is powerful enough to infer efficient algorithms for common algorithmic benchmarks including sorting, addition and multiplication. We evaluate our architecture on the ","authors_text":"Agris \\v{S}ostaks, Em\\=ils Ozoli\\c{n}\\v{s}, K\\=arlis Freivalds","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T06:47:48Z","title":"Neural Shuffle-Exchange Networks -- Sequence Processing in O(n log n) Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07897","kind":"arxiv","version":3},"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:9fb9724b4174defb2c402702a5b8bebdb89a8d3ed3dd876414b33c509f762b3e","target":"record","created_at":"2026-07-05T00:15:07Z","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":"f20f243473fa55ab8c9f46cc692307b7d99de80117bf65fdd5c6d7919007058e","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T06:47:48Z","title_canon_sha256":"f2e94b3340b2012cad84aef420ad740defddda4ac2653829fbfb19bfcda7733b"},"schema_version":"1.0","source":{"id":"1907.07897","kind":"arxiv","version":3}},"canonical_sha256":"af758a7d2789308eada2400138766b33ba8f9cba060d71d7b6de2cf86bb4395b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af758a7d2789308eada2400138766b33ba8f9cba060d71d7b6de2cf86bb4395b","first_computed_at":"2026-07-05T00:15:07.469358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:15:07.469358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QvzXoIFaSGHCjcJEgE/47KoNxty+lrWLCsYPlXEq/3aJmt5jlMUdRlxtiyxZ7foVp10+lH0sfLGs5gNlZzwJAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:15:07.469894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07897","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fb9724b4174defb2c402702a5b8bebdb89a8d3ed3dd876414b33c509f762b3e","sha256:e553fc9a5a2589320efd12e49b0c485440ea41351878755aafc6ec802ebb465c"],"state_sha256":"e6c23f74c54fa8f82536462637c64f14aca19dde809952296bc2062e98c4d8a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3MZ/PGs/Ne2RbTTlc+D2PpE8KVfKqpabRCrz/AbnDxEKIvgeaMCKP7RvjT6v6ucb//fplgrmJ4Cl7lPk/tNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:15:55.062860Z","bundle_sha256":"99c6450a1d052e6331ec67e2931079044177949567fcb58ab66f4a79b93b50ae"}}