{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6UWQPIYOHECRRQDWEFMBZM4MJV","short_pith_number":"pith:6UWQPIYO","canonical_record":{"source":{"id":"1809.02835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-08T17:04:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ad74895f13e20b1db51c6dc8af14d164758ef4aa9fabc6478bd3c12946952653","abstract_canon_sha256":"e8ff83be47745a50004b4017c47551e4cd044e5d141b173c6b801cf9fa61dd6c"},"schema_version":"1.0"},"canonical_sha256":"f52d07a30e390518c07621581cb38c4d747305dc26c4b63ffe9307907352cb75","source":{"kind":"arxiv","id":"1809.02835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02835","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02835v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02835","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"6UWQPIYOHECR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6UWQPIYOHECRRQDW","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6UWQPIYO","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6UWQPIYOHECRRQDWEFMBZM4MJV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-08T17:04:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ad74895f13e20b1db51c6dc8af14d164758ef4aa9fabc6478bd3c12946952653","abstract_canon_sha256":"e8ff83be47745a50004b4017c47551e4cd044e5d141b173c6b801cf9fa61dd6c"},"schema_version":"1.0"},"canonical_sha256":"f52d07a30e390518c07621581cb38c4d747305dc26c4b63ffe9307907352cb75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.822707Z","signature_b64":"ILNn5GtknyNKzLYuzn1CIRalZ2/xerUs634G1iYRx6MHZ88Lp8vkYLIsWdxITw52PTze1gZY0LY7QG/Awu6WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f52d07a30e390518c07621581cb38c4d747305dc26c4b63ffe9307907352cb75","last_reissued_at":"2026-05-18T00:06:10.822095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.822095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02835","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:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1R62XJLiA3i5AgSVRFBYf5zYd4IOf+ZxxQ2akL7ys2TH9Xtq8oM2vohz0tMkkHYuK+2kMoFAlHTZJb8FX44Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:41:49.668277Z"},"content_sha256":"7ffb80acf0ab40b8b068964221ccb433cccaa64fdef020ecfd2d8d27ed80993d","schema_version":"1.0","event_id":"sha256:7ffb80acf0ab40b8b068964221ccb433cccaa64fdef020ecfd2d8d27ed80993d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6UWQPIYOHECRRQDWEFMBZM4MJV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multitasking Capacity: Hardness Results and Improved Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alexander Yu, Daniel Reichman, Igor Shinkar, Jonathan D. Cohen, Noga Alon, Pasin Manurangsi, Tal Wagner, Thomas L. Griffiths","submitted_at":"2018-09-08T17:04:36Z","abstract_excerpt":"We consider the problem of determining the maximal $\\alpha \\in (0,1]$ such that every matching $M$ of size $k$ (or at most $k$) in a bipartite graph $G$ contains an induced matching of size at least $\\alpha |M|$. This measure was recently introduced in Alon et al. (NIPS 2018) and is motivated by connectionist models of cognition as well as modeling interference in wireless and communication networks.\n  We prove various hardness results for computing $\\alpha$ either exactly or approximately. En route to our results, we also consider the maximum connected matching problem: determining the larges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02835","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:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkIvR9jcJk9A55ufTffNR5aoNJm4wemfG9bv+Ukjo4/gFBEpnHLu55uhNW0q1ZosWS4Kjrg1NpaPI7Auwm1YDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:41:49.668659Z"},"content_sha256":"84b8afcdd12d089776c96f3bef1bdbbdfd21f2a9e2d017b36334b3be3ec7fafa","schema_version":"1.0","event_id":"sha256:84b8afcdd12d089776c96f3bef1bdbbdfd21f2a9e2d017b36334b3be3ec7fafa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UWQPIYOHECRRQDWEFMBZM4MJV/bundle.json","state_url":"https://pith.science/pith/6UWQPIYOHECRRQDWEFMBZM4MJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UWQPIYOHECRRQDWEFMBZM4MJV/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-30T15:41:49Z","links":{"resolver":"https://pith.science/pith/6UWQPIYOHECRRQDWEFMBZM4MJV","bundle":"https://pith.science/pith/6UWQPIYOHECRRQDWEFMBZM4MJV/bundle.json","state":"https://pith.science/pith/6UWQPIYOHECRRQDWEFMBZM4MJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UWQPIYOHECRRQDWEFMBZM4MJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6UWQPIYOHECRRQDWEFMBZM4MJV","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":"e8ff83be47745a50004b4017c47551e4cd044e5d141b173c6b801cf9fa61dd6c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-08T17:04:36Z","title_canon_sha256":"ad74895f13e20b1db51c6dc8af14d164758ef4aa9fabc6478bd3c12946952653"},"schema_version":"1.0","source":{"id":"1809.02835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02835","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02835v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02835","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"6UWQPIYOHECR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6UWQPIYOHECRRQDW","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6UWQPIYO","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:84b8afcdd12d089776c96f3bef1bdbbdfd21f2a9e2d017b36334b3be3ec7fafa","target":"graph","created_at":"2026-05-18T00:06:10Z","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 consider the problem of determining the maximal $\\alpha \\in (0,1]$ such that every matching $M$ of size $k$ (or at most $k$) in a bipartite graph $G$ contains an induced matching of size at least $\\alpha |M|$. This measure was recently introduced in Alon et al. (NIPS 2018) and is motivated by connectionist models of cognition as well as modeling interference in wireless and communication networks.\n  We prove various hardness results for computing $\\alpha$ either exactly or approximately. En route to our results, we also consider the maximum connected matching problem: determining the larges","authors_text":"Alexander Yu, Daniel Reichman, Igor Shinkar, Jonathan D. Cohen, Noga Alon, Pasin Manurangsi, Tal Wagner, Thomas L. Griffiths","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-08T17:04:36Z","title":"Multitasking Capacity: Hardness Results and Improved Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02835","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:7ffb80acf0ab40b8b068964221ccb433cccaa64fdef020ecfd2d8d27ed80993d","target":"record","created_at":"2026-05-18T00:06:10Z","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":"e8ff83be47745a50004b4017c47551e4cd044e5d141b173c6b801cf9fa61dd6c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-08T17:04:36Z","title_canon_sha256":"ad74895f13e20b1db51c6dc8af14d164758ef4aa9fabc6478bd3c12946952653"},"schema_version":"1.0","source":{"id":"1809.02835","kind":"arxiv","version":1}},"canonical_sha256":"f52d07a30e390518c07621581cb38c4d747305dc26c4b63ffe9307907352cb75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f52d07a30e390518c07621581cb38c4d747305dc26c4b63ffe9307907352cb75","first_computed_at":"2026-05-18T00:06:10.822095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:10.822095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ILNn5GtknyNKzLYuzn1CIRalZ2/xerUs634G1iYRx6MHZ88Lp8vkYLIsWdxITw52PTze1gZY0LY7QG/Awu6WBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:10.822707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ffb80acf0ab40b8b068964221ccb433cccaa64fdef020ecfd2d8d27ed80993d","sha256:84b8afcdd12d089776c96f3bef1bdbbdfd21f2a9e2d017b36334b3be3ec7fafa"],"state_sha256":"83595cc7eaa83dda60b92e46fbb532c5368f06737f623dc844fef24d9f5803f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgVlu4NpEtDrm1/PDp57ca8ai3pPhzU6ZB2uzJx/X2AuDnc1XobSLPj9raSNj2jzJ8CxFgiPp4M4BUmdDucZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:41:49.670950Z","bundle_sha256":"3a9e2b273ef29e80b7431d2da0bb812d7c0c5fee6e4ab79f33e83db6695af9ba"}}