{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZRDVJFRYWNPD3QY7E5WYRP3YDZ","short_pith_number":"pith:ZRDVJFRY","canonical_record":{"source":{"id":"2005.01292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2020-05-04T06:59:11Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d698862375670370e0785727ffe12fa3da9d5ef56cb84c25baa852a0a79fd98f","abstract_canon_sha256":"5936c0b12e1059fc70cfebb62df21212f617bdff80cbedace1098d5b4ec670b1"},"schema_version":"1.0"},"canonical_sha256":"cc47549638b35e3dc31f276d88bf781e78a012f7c960dd7667a6adc684fe1c2d","source":{"kind":"arxiv","id":"2005.01292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01292","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01292v2","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01292","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZRDVJFRYWNPD","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZRDVJFRYWNPD3QY7","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZRDVJFRY","created_at":"2026-07-05T01:44:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZRDVJFRYWNPD3QY7E5WYRP3YDZ","target":"record","payload":{"canonical_record":{"source":{"id":"2005.01292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2020-05-04T06:59:11Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d698862375670370e0785727ffe12fa3da9d5ef56cb84c25baa852a0a79fd98f","abstract_canon_sha256":"5936c0b12e1059fc70cfebb62df21212f617bdff80cbedace1098d5b4ec670b1"},"schema_version":"1.0"},"canonical_sha256":"cc47549638b35e3dc31f276d88bf781e78a012f7c960dd7667a6adc684fe1c2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:11.720088Z","signature_b64":"oSY0ILo0IdkcJhRyXh0YbPq9jpVbPfnZ9b5yQhCk8xQ1MJpty2OYl6fMrrr5BmsPXycjNPEW/vF+iHvtPywxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc47549638b35e3dc31f276d88bf781e78a012f7c960dd7667a6adc684fe1c2d","last_reissued_at":"2026-07-05T01:44:11.719552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:11.719552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.01292","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-07-05T01:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgV8MZ1D0+a4YDjw6xVMCTJ7sfIJQ/OiviaU9N55P8vsz4r4VDUWxruiewwh2+oGc4gY0RklXxIOaecfbp39CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:32:41.875393Z"},"content_sha256":"93083b687a0409a27cb47ab6b570523e019bfce0fa6edeae3f68f4057eee1887","schema_version":"1.0","event_id":"sha256:93083b687a0409a27cb47ab6b570523e019bfce0fa6edeae3f68f4057eee1887"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZRDVJFRYWNPD3QY7E5WYRP3YDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Foraging-based Optimization of Menu Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.HC","authors_text":"Andreas Karrenbauer, Antti Oulasvirta, Evgeny Ivanko, Morteza Shiripour, Niraj Ramesh Dayama","submitted_at":"2020-05-04T06:59:11Z","abstract_excerpt":"Computational design of menu systems has been solved in limited cases such as the linear menu (list) as an assignment task, where commands are assigned to menu positions while optimizing for for users selection performance and distance of associated items. We show that this approach falls short with larger, hierarchically organized menu systems, where one must also take into account how users navigate hierarchical structures. This paper presents a novel integer programming formulation that models hierarchical menus as a combination of the exact set covering problem and the assignment problem. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01292","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.01292/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-05T01:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iudAIfAXDx6f+8SrB00lmkBGogP4N84NbWYTSHQFBvK/lrUm2kXJV8Nm54eYuYNU/PdbRZH205/+lhba0IRFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:32:41.876838Z"},"content_sha256":"f7fb86f715de84e788fb30526dedecb2a550b0b55072fe4902c5090896015ac7","schema_version":"1.0","event_id":"sha256:f7fb86f715de84e788fb30526dedecb2a550b0b55072fe4902c5090896015ac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ/bundle.json","state_url":"https://pith.science/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ/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-06T06:32:41Z","links":{"resolver":"https://pith.science/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ","bundle":"https://pith.science/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ/bundle.json","state":"https://pith.science/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRDVJFRYWNPD3QY7E5WYRP3YDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZRDVJFRYWNPD3QY7E5WYRP3YDZ","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":"5936c0b12e1059fc70cfebb62df21212f617bdff80cbedace1098d5b4ec670b1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2020-05-04T06:59:11Z","title_canon_sha256":"d698862375670370e0785727ffe12fa3da9d5ef56cb84c25baa852a0a79fd98f"},"schema_version":"1.0","source":{"id":"2005.01292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01292","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01292v2","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01292","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZRDVJFRYWNPD","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZRDVJFRYWNPD3QY7","created_at":"2026-07-05T01:44:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZRDVJFRY","created_at":"2026-07-05T01:44:11Z"}],"graph_snapshots":[{"event_id":"sha256:f7fb86f715de84e788fb30526dedecb2a550b0b55072fe4902c5090896015ac7","target":"graph","created_at":"2026-07-05T01:44:11Z","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/2005.01292/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computational design of menu systems has been solved in limited cases such as the linear menu (list) as an assignment task, where commands are assigned to menu positions while optimizing for for users selection performance and distance of associated items. We show that this approach falls short with larger, hierarchically organized menu systems, where one must also take into account how users navigate hierarchical structures. This paper presents a novel integer programming formulation that models hierarchical menus as a combination of the exact set covering problem and the assignment problem. ","authors_text":"Andreas Karrenbauer, Antti Oulasvirta, Evgeny Ivanko, Morteza Shiripour, Niraj Ramesh Dayama","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2020-05-04T06:59:11Z","title":"Foraging-based Optimization of Menu Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01292","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:93083b687a0409a27cb47ab6b570523e019bfce0fa6edeae3f68f4057eee1887","target":"record","created_at":"2026-07-05T01:44:11Z","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":"5936c0b12e1059fc70cfebb62df21212f617bdff80cbedace1098d5b4ec670b1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2020-05-04T06:59:11Z","title_canon_sha256":"d698862375670370e0785727ffe12fa3da9d5ef56cb84c25baa852a0a79fd98f"},"schema_version":"1.0","source":{"id":"2005.01292","kind":"arxiv","version":2}},"canonical_sha256":"cc47549638b35e3dc31f276d88bf781e78a012f7c960dd7667a6adc684fe1c2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc47549638b35e3dc31f276d88bf781e78a012f7c960dd7667a6adc684fe1c2d","first_computed_at":"2026-07-05T01:44:11.719552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:44:11.719552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oSY0ILo0IdkcJhRyXh0YbPq9jpVbPfnZ9b5yQhCk8xQ1MJpty2OYl6fMrrr5BmsPXycjNPEW/vF+iHvtPywxBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:44:11.720088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.01292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93083b687a0409a27cb47ab6b570523e019bfce0fa6edeae3f68f4057eee1887","sha256:f7fb86f715de84e788fb30526dedecb2a550b0b55072fe4902c5090896015ac7"],"state_sha256":"0976085cfbbaa56cf167cd28cb0f5bcfa21166e1bf112a1f98da366bca0dc576"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ptz8ou5BihGXmMZLHTEcGumN0rTCfmn+lAgJH3evhCfHOKP5GCImqpkigCa3vdphXRQN/ckqi25IrYscjpamAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:32:41.883376Z","bundle_sha256":"b0aa761eba0b48f985bf8d77d4c76a38498b36f61b26e73696c25262c4c5ebf7"}}