{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4VJ227SONN6KYQFP5LUN6C4PWY","short_pith_number":"pith:4VJ227SO","canonical_record":{"source":{"id":"1610.04785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-15T20:56:20Z","cross_cats_sorted":[],"title_canon_sha256":"c66a419a08f35b2a614612e661ea90142312797a8178540852f4ae7e5f413278","abstract_canon_sha256":"04a50a2e6079fcd9d02f26120ebf8c26461f5d576b60e3a2fa3497203c858a55"},"schema_version":"1.0"},"canonical_sha256":"e553ad7e4e6b7cac40afeae8df0b8fb61547f47e0547890f8b8d51e7a6ed23bd","source":{"kind":"arxiv","id":"1610.04785","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04785","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04785v1","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04785","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"4VJ227SONN6K","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4VJ227SONN6KYQFP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4VJ227SO","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4VJ227SONN6KYQFP5LUN6C4PWY","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-15T20:56:20Z","cross_cats_sorted":[],"title_canon_sha256":"c66a419a08f35b2a614612e661ea90142312797a8178540852f4ae7e5f413278","abstract_canon_sha256":"04a50a2e6079fcd9d02f26120ebf8c26461f5d576b60e3a2fa3497203c858a55"},"schema_version":"1.0"},"canonical_sha256":"e553ad7e4e6b7cac40afeae8df0b8fb61547f47e0547890f8b8d51e7a6ed23bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:07.074773Z","signature_b64":"qjEH5gEgZJT9t8xFd0eyZtlF4vc15lJlSmSrHjNVD1ifMQcu8vv1dLSL9waYCD06cz2McI9+3AAeoMg1dXixCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e553ad7e4e6b7cac40afeae8df0b8fb61547f47e0547890f8b8d51e7a6ed23bd","last_reissued_at":"2026-05-18T01:02:07.074177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:07.074177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04785","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-18T01:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLNRLJjyjK0bKoeX3Sn7l/X/qy1j98q34wSv1NVBXyUVzIuHFlhi07pDpr0aFC1eDCugvtEyrxLUSyhhNSnDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:38.494422Z"},"content_sha256":"fad7f5c0a6ed36637befd00b68da430eeb04e8159ba0e94c6566f97dbfa7cb4c","schema_version":"1.0","event_id":"sha256:fad7f5c0a6ed36637befd00b68da430eeb04e8159ba0e94c6566f97dbfa7cb4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4VJ227SONN6KYQFP5LUN6C4PWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Approximation Bounds for the Seminar Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amotz Bar-Noy, George Rabanca","submitted_at":"2016-10-15T20:56:20Z","abstract_excerpt":"The seminar assignment problem is a variant of the generalized assignment problem in which items have unit size and the amount of space allowed in each bin is restricted to an arbitrary set of values. The problem has been shown to be NP-complete and to not admit a PTAS. However, the only constant factor approximation algorithm known to date is randomized and it is not guaranteed to always produce a feasible solution.\n  In this paper we show that a natural greedy algorithm outputs a solution with value within a factor of $(1 - e^{-1})$ of the optimal, and that unless $NP\\subseteq DTIME(n^{\\log\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04785","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-18T01:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjkz9q1iUqjB35wzO7aFolivVLaOW5N2nn+6nB0Y3N4+XP4aPJW/DrxSS5ghXIBWbRK+47k0IqIj/OehhEOHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:38.494755Z"},"content_sha256":"12be1f0babeeac4cdaff82536f3b61325a2bffce386e7f76bc6becd4221596ac","schema_version":"1.0","event_id":"sha256:12be1f0babeeac4cdaff82536f3b61325a2bffce386e7f76bc6becd4221596ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VJ227SONN6KYQFP5LUN6C4PWY/bundle.json","state_url":"https://pith.science/pith/4VJ227SONN6KYQFP5LUN6C4PWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VJ227SONN6KYQFP5LUN6C4PWY/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-28T11:09:38Z","links":{"resolver":"https://pith.science/pith/4VJ227SONN6KYQFP5LUN6C4PWY","bundle":"https://pith.science/pith/4VJ227SONN6KYQFP5LUN6C4PWY/bundle.json","state":"https://pith.science/pith/4VJ227SONN6KYQFP5LUN6C4PWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VJ227SONN6KYQFP5LUN6C4PWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4VJ227SONN6KYQFP5LUN6C4PWY","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":"04a50a2e6079fcd9d02f26120ebf8c26461f5d576b60e3a2fa3497203c858a55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-15T20:56:20Z","title_canon_sha256":"c66a419a08f35b2a614612e661ea90142312797a8178540852f4ae7e5f413278"},"schema_version":"1.0","source":{"id":"1610.04785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04785","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04785v1","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04785","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"4VJ227SONN6K","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4VJ227SONN6KYQFP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4VJ227SO","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:12be1f0babeeac4cdaff82536f3b61325a2bffce386e7f76bc6becd4221596ac","target":"graph","created_at":"2026-05-18T01:02:07Z","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":"The seminar assignment problem is a variant of the generalized assignment problem in which items have unit size and the amount of space allowed in each bin is restricted to an arbitrary set of values. The problem has been shown to be NP-complete and to not admit a PTAS. However, the only constant factor approximation algorithm known to date is randomized and it is not guaranteed to always produce a feasible solution.\n  In this paper we show that a natural greedy algorithm outputs a solution with value within a factor of $(1 - e^{-1})$ of the optimal, and that unless $NP\\subseteq DTIME(n^{\\log\\","authors_text":"Amotz Bar-Noy, George Rabanca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-15T20:56:20Z","title":"Tight Approximation Bounds for the Seminar Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04785","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:fad7f5c0a6ed36637befd00b68da430eeb04e8159ba0e94c6566f97dbfa7cb4c","target":"record","created_at":"2026-05-18T01:02:07Z","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":"04a50a2e6079fcd9d02f26120ebf8c26461f5d576b60e3a2fa3497203c858a55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-15T20:56:20Z","title_canon_sha256":"c66a419a08f35b2a614612e661ea90142312797a8178540852f4ae7e5f413278"},"schema_version":"1.0","source":{"id":"1610.04785","kind":"arxiv","version":1}},"canonical_sha256":"e553ad7e4e6b7cac40afeae8df0b8fb61547f47e0547890f8b8d51e7a6ed23bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e553ad7e4e6b7cac40afeae8df0b8fb61547f47e0547890f8b8d51e7a6ed23bd","first_computed_at":"2026-05-18T01:02:07.074177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:07.074177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qjEH5gEgZJT9t8xFd0eyZtlF4vc15lJlSmSrHjNVD1ifMQcu8vv1dLSL9waYCD06cz2McI9+3AAeoMg1dXixCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:07.074773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad7f5c0a6ed36637befd00b68da430eeb04e8159ba0e94c6566f97dbfa7cb4c","sha256:12be1f0babeeac4cdaff82536f3b61325a2bffce386e7f76bc6becd4221596ac"],"state_sha256":"689b18c2128194a5bb46505640cbb9661581aea40d1ab6f30d18957886c445a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNiGWdmNx1ysl34twSzZkI+Gzm2nGCz5Gywqjr0c++xCSm4O6yoDwZWSkgKrRoNhFRlxfwKPRxbWLRM/0y9yAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:09:38.496738Z","bundle_sha256":"464cff415b6157640fdc7a758a884f620eb844e8a651b5ffdc7189bb4ae7437b"}}