{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RSV2ID2O6TICV4GGUDQWLNYGUH","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":"be7e208e39cc4f6750703461047bc9e038def1c14c71c4e70addfa8ff4a85d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-09T10:29:10Z","title_canon_sha256":"5e127705cc66ea2f96e45f4737292a6ac937f1188cc8d56dbf7eb99c55ad5e82"},"schema_version":"1.0","source":{"id":"1405.2199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2199","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2199v1","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2199","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"RSV2ID2O6TIC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RSV2ID2O6TICV4GG","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RSV2ID2O","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:9e99452261fa2dc08055e6546df52ef68e2c3b44c463a533903b896cc22e485b","target":"graph","created_at":"2026-05-18T02:52:13Z","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":"In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two {programme slots} have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A set of programmes that are mutually exclusive in respect of time scheduling is called a session. We assume that a company sets the objective of selecting the popular programmes in $k$ parallel sessions a","authors_text":"Anita Pal, Madhumangal Pal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-09T10:29:10Z","title":"Scheduling algorithm to select $k$ optimal programme slots in television channels: A graph theoretic approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2199","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:99969ca8f0a0ea127eb30de458fbd90deab97bb74c610de26af017b85757233e","target":"record","created_at":"2026-05-18T02:52:13Z","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":"be7e208e39cc4f6750703461047bc9e038def1c14c71c4e70addfa8ff4a85d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-09T10:29:10Z","title_canon_sha256":"5e127705cc66ea2f96e45f4737292a6ac937f1188cc8d56dbf7eb99c55ad5e82"},"schema_version":"1.0","source":{"id":"1405.2199","kind":"arxiv","version":1}},"canonical_sha256":"8caba40f4ef4d02af0c6a0e165b706a1d4d22893cbf0e2ce18e2a55b38617126","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8caba40f4ef4d02af0c6a0e165b706a1d4d22893cbf0e2ce18e2a55b38617126","first_computed_at":"2026-05-18T02:52:13.429219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:13.429219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7N5+npm2IcK3pRSlXLJob8Q3UXUqtIyVJaY5u1QQ8tI+RauH1NB1Xc6/++oazNytHRYpgz0ykLcNjjTF3SlXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:13.429802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99969ca8f0a0ea127eb30de458fbd90deab97bb74c610de26af017b85757233e","sha256:9e99452261fa2dc08055e6546df52ef68e2c3b44c463a533903b896cc22e485b"],"state_sha256":"ce7707bcf9899050cacbc940d50d012a0d5a0da4da05e4d6cf1d9665326bec2d"}