{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ODFCNKMVZJIH3TWZOCCZSGHD67","short_pith_number":"pith:ODFCNKMV","canonical_record":{"source":{"id":"1903.08850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-21T07:05:44Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"2c4655398d0be6e8c5f3bea30340839ef2412cd1c034f9fa834362b92bd8533e","abstract_canon_sha256":"61d6a5c1494928d1d65973037824c30e0be097e8201290c4c79eb6f1f1d65e24"},"schema_version":"1.0"},"canonical_sha256":"70ca26a995ca507dced970859918e3f7ca18ee9d49d5c08c79e91e9987d0d42f","source":{"kind":"arxiv","id":"1903.08850","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08850","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08850v2","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08850","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"ODFCNKMVZJIH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ODFCNKMVZJIH3TWZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ODFCNKMV","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ODFCNKMVZJIH3TWZOCCZSGHD67","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-21T07:05:44Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"2c4655398d0be6e8c5f3bea30340839ef2412cd1c034f9fa834362b92bd8533e","abstract_canon_sha256":"61d6a5c1494928d1d65973037824c30e0be097e8201290c4c79eb6f1f1d65e24"},"schema_version":"1.0"},"canonical_sha256":"70ca26a995ca507dced970859918e3f7ca18ee9d49d5c08c79e91e9987d0d42f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.655478Z","signature_b64":"wNS8LM0VX7MaCAwZydKS93WE5aqkrSmPnyDjz14a6zoG4iN/HpaBmMULhmdc2s8h80kRLXU9rsbXjMSxCCR1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70ca26a995ca507dced970859918e3f7ca18ee9d49d5c08c79e91e9987d0d42f","last_reissued_at":"2026-05-17T23:47:35.655004Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.655004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08850","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:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPQnRHsMyKjj8iGf4W0UPyIa2WHexGEMshTIXshcNRmB3aXWp95QlMrP4D0f1d73NKvIK/UxFl2KxuEvW2XTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:47:53.676127Z"},"content_sha256":"3fbf3334f7384eef65a6df4ef785bd693ddbcbce2f565172ab81f811b38fec1c","schema_version":"1.0","event_id":"sha256:3fbf3334f7384eef65a6df4ef785bd693ddbcbce2f565172ab81f811b38fec1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ODFCNKMVZJIH3TWZOCCZSGHD67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Aaron Zweig, Aditya Grover, Eric Wang, Stefano Ermon","submitted_at":"2019-03-21T07:05:44Z","abstract_excerpt":"Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose NeuralSort, a general-purpose continuous relaxation of the output of the sorting operator from permutation matrices to the set of unimodal row-stochastic matrices, where every row sums to one and has a distinct arg max. This relaxation permits straight-through optimization of any computational graph involve a sorting operation. Further, we use this relaxatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08850","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-17T23:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9P5ZztR4xTaMyuPs7OP2vD/92Z9JKZodnobiO+tTYCVOlbqAR/UcgL8I4PVoQGahCTqD+34MIKi0obkx7lnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:47:53.676846Z"},"content_sha256":"0e7b7d5e0dda6c778f86c6be82046fa193cc1b3fe81939977d2af1d490bf3c49","schema_version":"1.0","event_id":"sha256:0e7b7d5e0dda6c778f86c6be82046fa193cc1b3fe81939977d2af1d490bf3c49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODFCNKMVZJIH3TWZOCCZSGHD67/bundle.json","state_url":"https://pith.science/pith/ODFCNKMVZJIH3TWZOCCZSGHD67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODFCNKMVZJIH3TWZOCCZSGHD67/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-01T00:47:53Z","links":{"resolver":"https://pith.science/pith/ODFCNKMVZJIH3TWZOCCZSGHD67","bundle":"https://pith.science/pith/ODFCNKMVZJIH3TWZOCCZSGHD67/bundle.json","state":"https://pith.science/pith/ODFCNKMVZJIH3TWZOCCZSGHD67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODFCNKMVZJIH3TWZOCCZSGHD67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ODFCNKMVZJIH3TWZOCCZSGHD67","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":"61d6a5c1494928d1d65973037824c30e0be097e8201290c4c79eb6f1f1d65e24","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-21T07:05:44Z","title_canon_sha256":"2c4655398d0be6e8c5f3bea30340839ef2412cd1c034f9fa834362b92bd8533e"},"schema_version":"1.0","source":{"id":"1903.08850","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08850","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08850v2","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08850","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"ODFCNKMVZJIH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ODFCNKMVZJIH3TWZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ODFCNKMV","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:0e7b7d5e0dda6c778f86c6be82046fa193cc1b3fe81939977d2af1d490bf3c49","target":"graph","created_at":"2026-05-17T23:47:35Z","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":"Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose NeuralSort, a general-purpose continuous relaxation of the output of the sorting operator from permutation matrices to the set of unimodal row-stochastic matrices, where every row sums to one and has a distinct arg max. This relaxation permits straight-through optimization of any computational graph involve a sorting operation. Further, we use this relaxatio","authors_text":"Aaron Zweig, Aditya Grover, Eric Wang, Stefano Ermon","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-21T07:05:44Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08850","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:3fbf3334f7384eef65a6df4ef785bd693ddbcbce2f565172ab81f811b38fec1c","target":"record","created_at":"2026-05-17T23:47:35Z","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":"61d6a5c1494928d1d65973037824c30e0be097e8201290c4c79eb6f1f1d65e24","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-21T07:05:44Z","title_canon_sha256":"2c4655398d0be6e8c5f3bea30340839ef2412cd1c034f9fa834362b92bd8533e"},"schema_version":"1.0","source":{"id":"1903.08850","kind":"arxiv","version":2}},"canonical_sha256":"70ca26a995ca507dced970859918e3f7ca18ee9d49d5c08c79e91e9987d0d42f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70ca26a995ca507dced970859918e3f7ca18ee9d49d5c08c79e91e9987d0d42f","first_computed_at":"2026-05-17T23:47:35.655004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:35.655004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wNS8LM0VX7MaCAwZydKS93WE5aqkrSmPnyDjz14a6zoG4iN/HpaBmMULhmdc2s8h80kRLXU9rsbXjMSxCCR1Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:35.655478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08850","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fbf3334f7384eef65a6df4ef785bd693ddbcbce2f565172ab81f811b38fec1c","sha256:0e7b7d5e0dda6c778f86c6be82046fa193cc1b3fe81939977d2af1d490bf3c49"],"state_sha256":"f4a6fd84d1428dab031ead90bb3d8cf352138f0126a7b175540719cc08e042ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fejc+e6UHiChThKIfgyDOzZMcW2wgombu3VQb4jcKAH1lVO6BBCiE+QD0XKWIjT60qBXCpKJ8Qs+lgm/4mdwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:47:53.681079Z","bundle_sha256":"d8dcfc1f5dc6af7d925d8905a11dd660202f81c5651caae8f3124e6ff3b4f83d"}}