{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MXPJKXEPX6BFKYR6GLKXS6VMZS","short_pith_number":"pith:MXPJKXEP","schema_version":"1.0","canonical_sha256":"65de955c8fbf8255623e32d5797aaccc87f874389f1d07002abda682ff17f934","source":{"kind":"arxiv","id":"1708.07786","version":1},"attestation_state":"computed","paper":{"title":"Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Alexei Vernitski, Daniel Karapetyan","submitted_at":"2017-08-25T15:46:57Z","abstract_excerpt":"The majority of scheduling metaheuristics use indirect representation of solutions as a way to efficiently explore the search space. Thus, a crucial part of such metaheuristics is a \"schedule generation scheme\" -- procedure translating the indirect solution representation into a schedule. Schedule generation scheme is used every time a new candidate solution needs to be evaluated. Being relatively slow, it eats up most of the running time of the metaheuristic and, thus, its speed plays significant role in performance of the metaheuristic. Despite its importance, little attention has been paid "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T15:46:57Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"68371b58e4b6fb256083ac8970d948bd6d03e8fa5be85821ce3518ce96a427ba","abstract_canon_sha256":"6e517c1ef3b1dc4da43c2e4f1228f3a0233bf3458c684afda1de6d7d580778f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.995803Z","signature_b64":"G70tfK02peQ8eq2h2/t8ItJU51FrIrscu8vvNzZR7YDcAMwCDV5JQmldCcFjQE+BOPU8RklMJWkmb/bcRliUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65de955c8fbf8255623e32d5797aaccc87f874389f1d07002abda682ff17f934","last_reissued_at":"2026-05-18T00:36:41.995206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.995206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Alexei Vernitski, Daniel Karapetyan","submitted_at":"2017-08-25T15:46:57Z","abstract_excerpt":"The majority of scheduling metaheuristics use indirect representation of solutions as a way to efficiently explore the search space. Thus, a crucial part of such metaheuristics is a \"schedule generation scheme\" -- procedure translating the indirect solution representation into a schedule. Schedule generation scheme is used every time a new candidate solution needs to be evaluated. Being relatively slow, it eats up most of the running time of the metaheuristic and, thus, its speed plays significant role in performance of the metaheuristic. Despite its importance, little attention has been paid "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07786","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07786","created_at":"2026-05-18T00:36:41.995288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07786v1","created_at":"2026-05-18T00:36:41.995288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07786","created_at":"2026-05-18T00:36:41.995288+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXPJKXEPX6BF","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXPJKXEPX6BFKYR6","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXPJKXEP","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS","json":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS.json","graph_json":"https://pith.science/api/pith-number/MXPJKXEPX6BFKYR6GLKXS6VMZS/graph.json","events_json":"https://pith.science/api/pith-number/MXPJKXEPX6BFKYR6GLKXS6VMZS/events.json","paper":"https://pith.science/paper/MXPJKXEP"},"agent_actions":{"view_html":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS","download_json":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS.json","view_paper":"https://pith.science/paper/MXPJKXEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07786&json=true","fetch_graph":"https://pith.science/api/pith-number/MXPJKXEPX6BFKYR6GLKXS6VMZS/graph.json","fetch_events":"https://pith.science/api/pith-number/MXPJKXEPX6BFKYR6GLKXS6VMZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS/action/storage_attestation","attest_author":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS/action/author_attestation","sign_citation":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS/action/citation_signature","submit_replication":"https://pith.science/pith/MXPJKXEPX6BFKYR6GLKXS6VMZS/action/replication_record"}},"created_at":"2026-05-18T00:36:41.995288+00:00","updated_at":"2026-05-18T00:36:41.995288+00:00"}