{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XYFIPHCSOYGJNLG2B3BD4TVKEB","short_pith_number":"pith:XYFIPHCS","canonical_record":{"source":{"id":"1707.03098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T01:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"d1f3128ec730adf99c2320e6a8e148837da78ecd52581d4846e85dac4e6b7821","abstract_canon_sha256":"b9231e383f3d6296a6ef8d125715ebbdf423e4df4d7294d1737533735c169063"},"schema_version":"1.0"},"canonical_sha256":"be0a879c52760c96acda0ec23e4eaa2063fe49b89864882cb6f4f6b636826c47","source":{"kind":"arxiv","id":"1707.03098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03098","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03098v1","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03098","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"XYFIPHCSOYGJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XYFIPHCSOYGJNLG2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XYFIPHCS","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XYFIPHCSOYGJNLG2B3BD4TVKEB","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T01:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"d1f3128ec730adf99c2320e6a8e148837da78ecd52581d4846e85dac4e6b7821","abstract_canon_sha256":"b9231e383f3d6296a6ef8d125715ebbdf423e4df4d7294d1737533735c169063"},"schema_version":"1.0"},"canonical_sha256":"be0a879c52760c96acda0ec23e4eaa2063fe49b89864882cb6f4f6b636826c47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:34.314379Z","signature_b64":"WyTbEqzOwd2wTuZXVJ2yVHah7SzMVoI0otDGMluDVvLetgX4o1mTOt4JqnX/suHNWsOgLiX5FnQYnr++OTknAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be0a879c52760c96acda0ec23e4eaa2063fe49b89864882cb6f4f6b636826c47","last_reissued_at":"2026-05-18T00:40:34.313613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:34.313613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03098","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:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhpnPGQfd7wp3kAkGgQjXdN2rogYaEZRDkkVqUwqlLuYB+Sv2AhpERqFhYJS7hlKUxsgteSDbvV/9ngNJ1HrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:32:03.054611Z"},"content_sha256":"e0f84af19087cea91a9e4777ea60b7d1a4ee84495c68c4c23d3390670537a724","schema_version":"1.0","event_id":"sha256:e0f84af19087cea91a9e4777ea60b7d1a4ee84495c68c4c23d3390670537a724"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XYFIPHCSOYGJNLG2B3BD4TVKEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Bayesian Network Based Solution Scheme for the Constrained Stochastic On-line Equi-Partitioning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ole-Christoffer Granmo, Sondre Glimsdal","submitted_at":"2017-07-11T01:48:47Z","abstract_excerpt":"A number of intriguing decision scenarios revolve around partitioning a collection of objects to optimize some application specific objective function. This problem is generally referred to as the Object Partitioning Problem (OPP) and is known to be NP-hard. We here consider a particularly challenging version of OPP, namely, the Stochastic On-line Equi-Partitioning Problem (SO-EPP). In SO-EPP, the target partitioning is unknown and has to be inferred purely from observing an on-line sequence of object pairs. The paired objects belong to the same partition with probability $p$ and to different "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03098","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:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsjQaoPRKEMEvjG6gpNv/zMSSJ+U14LBo0J/B4pUrGINzZjzOO0hbr9xU10TCWf4D2Uxlx+0+DXOkgPF/bBmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:32:03.054983Z"},"content_sha256":"91e4858eccb971289f28a9fc830bdbb1b7e5bc6e6b50f6f3a42a35da53add49a","schema_version":"1.0","event_id":"sha256:91e4858eccb971289f28a9fc830bdbb1b7e5bc6e6b50f6f3a42a35da53add49a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB/bundle.json","state_url":"https://pith.science/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB/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-30T07:32:03Z","links":{"resolver":"https://pith.science/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB","bundle":"https://pith.science/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB/bundle.json","state":"https://pith.science/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYFIPHCSOYGJNLG2B3BD4TVKEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XYFIPHCSOYGJNLG2B3BD4TVKEB","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":"b9231e383f3d6296a6ef8d125715ebbdf423e4df4d7294d1737533735c169063","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T01:48:47Z","title_canon_sha256":"d1f3128ec730adf99c2320e6a8e148837da78ecd52581d4846e85dac4e6b7821"},"schema_version":"1.0","source":{"id":"1707.03098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03098","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03098v1","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03098","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"XYFIPHCSOYGJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XYFIPHCSOYGJNLG2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XYFIPHCS","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:91e4858eccb971289f28a9fc830bdbb1b7e5bc6e6b50f6f3a42a35da53add49a","target":"graph","created_at":"2026-05-18T00:40:34Z","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":"A number of intriguing decision scenarios revolve around partitioning a collection of objects to optimize some application specific objective function. This problem is generally referred to as the Object Partitioning Problem (OPP) and is known to be NP-hard. We here consider a particularly challenging version of OPP, namely, the Stochastic On-line Equi-Partitioning Problem (SO-EPP). In SO-EPP, the target partitioning is unknown and has to be inferred purely from observing an on-line sequence of object pairs. The paired objects belong to the same partition with probability $p$ and to different ","authors_text":"Ole-Christoffer Granmo, Sondre Glimsdal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T01:48:47Z","title":"An Optimal Bayesian Network Based Solution Scheme for the Constrained Stochastic On-line Equi-Partitioning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03098","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:e0f84af19087cea91a9e4777ea60b7d1a4ee84495c68c4c23d3390670537a724","target":"record","created_at":"2026-05-18T00:40:34Z","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":"b9231e383f3d6296a6ef8d125715ebbdf423e4df4d7294d1737533735c169063","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T01:48:47Z","title_canon_sha256":"d1f3128ec730adf99c2320e6a8e148837da78ecd52581d4846e85dac4e6b7821"},"schema_version":"1.0","source":{"id":"1707.03098","kind":"arxiv","version":1}},"canonical_sha256":"be0a879c52760c96acda0ec23e4eaa2063fe49b89864882cb6f4f6b636826c47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be0a879c52760c96acda0ec23e4eaa2063fe49b89864882cb6f4f6b636826c47","first_computed_at":"2026-05-18T00:40:34.313613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:34.313613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WyTbEqzOwd2wTuZXVJ2yVHah7SzMVoI0otDGMluDVvLetgX4o1mTOt4JqnX/suHNWsOgLiX5FnQYnr++OTknAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:34.314379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0f84af19087cea91a9e4777ea60b7d1a4ee84495c68c4c23d3390670537a724","sha256:91e4858eccb971289f28a9fc830bdbb1b7e5bc6e6b50f6f3a42a35da53add49a"],"state_sha256":"dbe9ebc256d6aa6d358ec6e20fae626032b8ecab2a74e174bf837afb874f4366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gCbl3eMNtGK0fkNwiaBgNzazT7Tks5Weee9ry+ESJgudbHA1JcpgaRmH9RShdD1Niwg05/Qe+Kj232483+JDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:32:03.057783Z","bundle_sha256":"15d81d2349118d08a565433e2948d9bcebea7b00a230f971b7ab1e0ab274e18c"}}