{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CUGPUG5QFRXCUFBOZH24OMIWCA","short_pith_number":"pith:CUGPUG5Q","canonical_record":{"source":{"id":"1810.12464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-30T00:24:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c1e0fd3e87a5c6b1474d5f05188c6fe4d122d397e3b56dcdbe793c3f74b9acea","abstract_canon_sha256":"75bd25582951a1bbb83da60e258d3b6810769c2267443ffce3fe107f9c8982f8"},"schema_version":"1.0"},"canonical_sha256":"150cfa1bb02c6e2a142ec9f5c73116101fe0e999c2b380e53bfa05d5c2e58551","source":{"kind":"arxiv","id":"1810.12464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12464","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12464v1","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12464","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"CUGPUG5QFRXC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CUGPUG5QFRXCUFBO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CUGPUG5Q","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CUGPUG5QFRXCUFBOZH24OMIWCA","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-30T00:24:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c1e0fd3e87a5c6b1474d5f05188c6fe4d122d397e3b56dcdbe793c3f74b9acea","abstract_canon_sha256":"75bd25582951a1bbb83da60e258d3b6810769c2267443ffce3fe107f9c8982f8"},"schema_version":"1.0"},"canonical_sha256":"150cfa1bb02c6e2a142ec9f5c73116101fe0e999c2b380e53bfa05d5c2e58551","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:02.626478Z","signature_b64":"h8sF9y8MkXi4L7QQKR9yQLFZZ75ysU9bv7mgr+XUtzGR27Ijlw0mA0g/o1chN2QBvp8rNFPBtiNQbrsMheV7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"150cfa1bb02c6e2a142ec9f5c73116101fe0e999c2b380e53bfa05d5c2e58551","last_reissued_at":"2026-05-18T00:02:02.625908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:02.625908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12464","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-05-18T00:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoWkYhHPEF3jIZ8I7G9gZ7gfFT4hkCCLYieVzPTXRlDGZJyEWN79IrF8Z0KyI8toVJSxDqHiGit+TF2d3EBdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:57:49.190413Z"},"content_sha256":"1d39832c0c8eb8c84c0c8c3086b5c22118037c64671eb148988a64dcc90c0d5c","schema_version":"1.0","event_id":"sha256:1d39832c0c8eb8c84c0c8c3086b5c22118037c64671eb148988a64dcc90c0d5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CUGPUG5QFRXCUFBOZH24OMIWCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiable Greedy Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdel-rahman Mohamed, Abhinav Sethy, Amanjit Kainth, Rasool Fakoor, Ruhi Sarikaya, Siamak Shakeri, Thomas Powers","submitted_at":"2018-10-30T00:24:22Z","abstract_excerpt":"Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization. In this paper, we propose a subset selection algorithm that is trainable with gradient-based methods yet achieves near-optimal performance via submodular optimization. We focus on the task of identifying a relevant set of sentences for claim verification in the context of the FEVER task. Conventional methods for this task look at sentences on their individual merit and thus do not optimize the informativeness of sentences as a set. We show that our proposed method which builds on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12464","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":""},"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-18T00:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGnlzm34SUXrQg/eUJzWivWRfhRmP2LdhbXOGzSfk3Yv3gECOADEwTwlTldxvpdMts1J9o+s2SPmhVCOKlbhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:57:49.191061Z"},"content_sha256":"a8a97c63ec3831c470faf826b613703e875b666d07fa0f4159d65b2df79ffdc5","schema_version":"1.0","event_id":"sha256:a8a97c63ec3831c470faf826b613703e875b666d07fa0f4159d65b2df79ffdc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUGPUG5QFRXCUFBOZH24OMIWCA/bundle.json","state_url":"https://pith.science/pith/CUGPUG5QFRXCUFBOZH24OMIWCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUGPUG5QFRXCUFBOZH24OMIWCA/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-29T16:57:49Z","links":{"resolver":"https://pith.science/pith/CUGPUG5QFRXCUFBOZH24OMIWCA","bundle":"https://pith.science/pith/CUGPUG5QFRXCUFBOZH24OMIWCA/bundle.json","state":"https://pith.science/pith/CUGPUG5QFRXCUFBOZH24OMIWCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUGPUG5QFRXCUFBOZH24OMIWCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CUGPUG5QFRXCUFBOZH24OMIWCA","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":"75bd25582951a1bbb83da60e258d3b6810769c2267443ffce3fe107f9c8982f8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-30T00:24:22Z","title_canon_sha256":"c1e0fd3e87a5c6b1474d5f05188c6fe4d122d397e3b56dcdbe793c3f74b9acea"},"schema_version":"1.0","source":{"id":"1810.12464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12464","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12464v1","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12464","created_at":"2026-05-18T00:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"CUGPUG5QFRXC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CUGPUG5QFRXCUFBO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CUGPUG5Q","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:a8a97c63ec3831c470faf826b613703e875b666d07fa0f4159d65b2df79ffdc5","target":"graph","created_at":"2026-05-18T00:02:02Z","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":"Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization. In this paper, we propose a subset selection algorithm that is trainable with gradient-based methods yet achieves near-optimal performance via submodular optimization. We focus on the task of identifying a relevant set of sentences for claim verification in the context of the FEVER task. Conventional methods for this task look at sentences on their individual merit and thus do not optimize the informativeness of sentences as a set. We show that our proposed method which builds on","authors_text":"Abdel-rahman Mohamed, Abhinav Sethy, Amanjit Kainth, Rasool Fakoor, Ruhi Sarikaya, Siamak Shakeri, Thomas Powers","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-30T00:24:22Z","title":"Differentiable Greedy Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12464","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:1d39832c0c8eb8c84c0c8c3086b5c22118037c64671eb148988a64dcc90c0d5c","target":"record","created_at":"2026-05-18T00:02:02Z","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":"75bd25582951a1bbb83da60e258d3b6810769c2267443ffce3fe107f9c8982f8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-30T00:24:22Z","title_canon_sha256":"c1e0fd3e87a5c6b1474d5f05188c6fe4d122d397e3b56dcdbe793c3f74b9acea"},"schema_version":"1.0","source":{"id":"1810.12464","kind":"arxiv","version":1}},"canonical_sha256":"150cfa1bb02c6e2a142ec9f5c73116101fe0e999c2b380e53bfa05d5c2e58551","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"150cfa1bb02c6e2a142ec9f5c73116101fe0e999c2b380e53bfa05d5c2e58551","first_computed_at":"2026-05-18T00:02:02.625908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:02.625908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h8sF9y8MkXi4L7QQKR9yQLFZZ75ysU9bv7mgr+XUtzGR27Ijlw0mA0g/o1chN2QBvp8rNFPBtiNQbrsMheV7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:02.626478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d39832c0c8eb8c84c0c8c3086b5c22118037c64671eb148988a64dcc90c0d5c","sha256:a8a97c63ec3831c470faf826b613703e875b666d07fa0f4159d65b2df79ffdc5"],"state_sha256":"6b1b0c3397d321b72a256c13dd23f12d688600b4c28a30a9d5dc22fedfb7c1b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R34Bsh7gNGEW5sig9VBSP0TK3YBbP2vwaedYQFelOmYBDnvkvAmmZXg4XVS5t9VHLyVZybdBr5ujVp6xjghSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:57:49.194537Z","bundle_sha256":"910996f9df98d8968898b22bd0a68cf02ff1f5c38cce7059ea2ba4d25a68645f"}}