{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:76NGBGKDGXWPPQZ66QVCEPFEAI","short_pith_number":"pith:76NGBGKD","canonical_record":{"source":{"id":"1711.05246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T18:43:22Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"4cedaa8af07e9c8c1f3cf7f8fb64ac7f95378192539ccb8572f72d58da4bc644","abstract_canon_sha256":"5b91876beac11534d454fdf994ba185ecf3e8f5ec43a6fc24d783a4bdbb4392a"},"schema_version":"1.0"},"canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","source":{"kind":"arxiv","id":"1711.05246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05246","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05246v2","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05246","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"76NGBGKDGXWP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"76NGBGKDGXWPPQZ6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"76NGBGKD","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:76NGBGKDGXWPPQZ66QVCEPFEAI","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T18:43:22Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"4cedaa8af07e9c8c1f3cf7f8fb64ac7f95378192539ccb8572f72d58da4bc644","abstract_canon_sha256":"5b91876beac11534d454fdf994ba185ecf3e8f5ec43a6fc24d783a4bdbb4392a"},"schema_version":"1.0"},"canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.392273Z","signature_b64":"1PUpWbjuf9zKWDqn8GEbQsZa06b/vFwz34F0RcoV8Hjz4kT7RtcHcovaxnxYflx7k3CnXKWZy51BLbfPpfPCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","last_reissued_at":"2026-05-18T00:02:18.391634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.391634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05246","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-18T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WDcKFp/OliQTFhiprXrIJunhqAkdmsxbz2PkBAD38jYlzQJ+gJPC4N4ZGIMs7LvmgIv91OjG2fxUyCqe8syAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:17:35.292719Z"},"content_sha256":"d96ee9c4d3c8cc616d50f2ee0c1821b11c056033920df224eeeeaa109f5b6eeb","schema_version":"1.0","event_id":"sha256:d96ee9c4d3c8cc616d50f2ee0c1821b11c056033920df224eeeeaa109f5b6eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:76NGBGKDGXWPPQZ66QVCEPFEAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loss Functions for Multiset Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Jialin Mao, Kyunghyun Cho, Sean Welleck, Yu Gai, Zheng Zhang, Zixin Yao","submitted_at":"2017-11-14T18:43:22Z","abstract_excerpt":"We study the problem of multiset prediction. The goal of multiset prediction is to train a predictor that maps an input to a multiset consisting of multiple items. Unlike existing problems in supervised learning, such as classification, ranking and sequence generation, there is no known order among items in a target multiset, and each item in the multiset may appear more than once, making this problem extremely challenging. In this paper, we propose a novel multiset loss function by viewing this problem from the perspective of sequential decision making. The proposed multiset loss function is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05246","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-18T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUXsiqeOpOZ37I+SdIk51ai5F5lHGxLJoh57bQhliDvT3gpTZXjqCaGcXIINcRZ7SqlQqi3uhugcZkAGNxNZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:17:35.293104Z"},"content_sha256":"5d29cc6d06d9f8d812c89cf7e86be63e8d62d489788658fcb58fa2ca223f1cd8","schema_version":"1.0","event_id":"sha256:5d29cc6d06d9f8d812c89cf7e86be63e8d62d489788658fcb58fa2ca223f1cd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/bundle.json","state_url":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/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-31T03:17:35Z","links":{"resolver":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI","bundle":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/bundle.json","state":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:76NGBGKDGXWPPQZ66QVCEPFEAI","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":"5b91876beac11534d454fdf994ba185ecf3e8f5ec43a6fc24d783a4bdbb4392a","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T18:43:22Z","title_canon_sha256":"4cedaa8af07e9c8c1f3cf7f8fb64ac7f95378192539ccb8572f72d58da4bc644"},"schema_version":"1.0","source":{"id":"1711.05246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05246","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05246v2","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05246","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"76NGBGKDGXWP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"76NGBGKDGXWPPQZ6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"76NGBGKD","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:5d29cc6d06d9f8d812c89cf7e86be63e8d62d489788658fcb58fa2ca223f1cd8","target":"graph","created_at":"2026-05-18T00:02:18Z","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":"We study the problem of multiset prediction. The goal of multiset prediction is to train a predictor that maps an input to a multiset consisting of multiple items. Unlike existing problems in supervised learning, such as classification, ranking and sequence generation, there is no known order among items in a target multiset, and each item in the multiset may appear more than once, making this problem extremely challenging. In this paper, we propose a novel multiset loss function by viewing this problem from the perspective of sequential decision making. The proposed multiset loss function is ","authors_text":"Jialin Mao, Kyunghyun Cho, Sean Welleck, Yu Gai, Zheng Zhang, Zixin Yao","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T18:43:22Z","title":"Loss Functions for Multiset Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05246","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:d96ee9c4d3c8cc616d50f2ee0c1821b11c056033920df224eeeeaa109f5b6eeb","target":"record","created_at":"2026-05-18T00:02:18Z","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":"5b91876beac11534d454fdf994ba185ecf3e8f5ec43a6fc24d783a4bdbb4392a","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T18:43:22Z","title_canon_sha256":"4cedaa8af07e9c8c1f3cf7f8fb64ac7f95378192539ccb8572f72d58da4bc644"},"schema_version":"1.0","source":{"id":"1711.05246","kind":"arxiv","version":2}},"canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","first_computed_at":"2026-05-18T00:02:18.391634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:18.391634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1PUpWbjuf9zKWDqn8GEbQsZa06b/vFwz34F0RcoV8Hjz4kT7RtcHcovaxnxYflx7k3CnXKWZy51BLbfPpfPCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:18.392273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d96ee9c4d3c8cc616d50f2ee0c1821b11c056033920df224eeeeaa109f5b6eeb","sha256:5d29cc6d06d9f8d812c89cf7e86be63e8d62d489788658fcb58fa2ca223f1cd8"],"state_sha256":"6873e58c0d2c6065472ef9793e2bd4d334789ecedadaa34eda78d46144a32680"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2uiLGfA6ZdD5i1oLM/eKRtdKNjjEESRIsplBWOfg2LzAmO+GB5VSfpaFfpjS3bGRigrmtzQLrx5is23tuRyAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:17:35.295908Z","bundle_sha256":"c0e48e5750a1754e53b3b44bc2f0d820a589f0ca903108c3ad9580e25c1d9880"}}