{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ESDLBTIQ4EOQAIZFY3RRRN3CDM","short_pith_number":"pith:ESDLBTIQ","canonical_record":{"source":{"id":"2312.14777","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-12-22T15:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"87558f87e27220504bc2627735c242754f2ed49812ebc30b0e7d1ddc28dd5cc4","abstract_canon_sha256":"90a029904f35aa23f0ad35d4f52e30c10c2a277e7aab19282b169bac5f24d64a"},"schema_version":"1.0"},"canonical_sha256":"2486b0cd10e11d002325c6e318b7621b33451957a8d6c7c4edcb35d892d5121c","source":{"kind":"arxiv","id":"2312.14777","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14777","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14777v3","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14777","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"pith_short_12","alias_value":"ESDLBTIQ4EOQ","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"pith_short_16","alias_value":"ESDLBTIQ4EOQAIZF","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"pith_short_8","alias_value":"ESDLBTIQ","created_at":"2026-07-05T10:43:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ESDLBTIQ4EOQAIZFY3RRRN3CDM","target":"record","payload":{"canonical_record":{"source":{"id":"2312.14777","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-12-22T15:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"87558f87e27220504bc2627735c242754f2ed49812ebc30b0e7d1ddc28dd5cc4","abstract_canon_sha256":"90a029904f35aa23f0ad35d4f52e30c10c2a277e7aab19282b169bac5f24d64a"},"schema_version":"1.0"},"canonical_sha256":"2486b0cd10e11d002325c6e318b7621b33451957a8d6c7c4edcb35d892d5121c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:34.632753Z","signature_b64":"V1cvkfVYCUAqQtChw26x84iaTY0EpSVGrydIkC6AbeRc2RnHMBRDLPRA3EP4KLaX+QvflBPdy+LCK8JQZeFcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2486b0cd10e11d002325c6e318b7621b33451957a8d6c7c4edcb35d892d5121c","last_reissued_at":"2026-07-05T10:43:34.632165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:34.632165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.14777","source_version":3,"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-05T10:43:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nC0zOpXUyLfR3XMwU6vkww3mwlBnaLfuWpZQ8nydXcKq+dlOYDoS00ZwGpHPfl3Q4bc+H57Y4762mjZ90ErlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:49:07.828174Z"},"content_sha256":"5f45192b1428d293add82d8aa7aeff4b4f3abe06b1b5d6ee68b4921b73e28889","schema_version":"1.0","event_id":"sha256:5f45192b1428d293add82d8aa7aeff4b4f3abe06b1b5d6ee68b4921b73e28889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ESDLBTIQ4EOQAIZFY3RRRN3CDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact formulations and valid inequalities for parallel machine scheduling with conflicts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hande Yaman, Phablo F. S. Moura, Roel Leus","submitted_at":"2023-12-22T15:44:41Z","abstract_excerpt":"The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same machine, and the maximum processing time among all machines is minimized. We propose a new compact mixed integer linear formulation based on the representatives model for the vertex coloring problem, which overcomes a number of issues inherent in the natural assignment model. We present a polyhedral study of the associated polytope, and describe classes of valid inequalities inherited from the stable set polytope. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14777","kind":"arxiv","version":3},"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/2312.14777/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-05T10:43:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+NKWTIlXoiq5JGAZ4YTiEtTSfA0E5pFfIHLaHn18uk/OZebS4PpzuovB4y0rYVD+7LvZ91pq0fQc40/Jd/9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:49:07.828562Z"},"content_sha256":"65d3fc557f5add974ffb5f57f50454af1f220b50bbbda90557ed58c70b3d8b0c","schema_version":"1.0","event_id":"sha256:65d3fc557f5add974ffb5f57f50454af1f220b50bbbda90557ed58c70b3d8b0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM/bundle.json","state_url":"https://pith.science/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM/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-07-06T21:49:07Z","links":{"resolver":"https://pith.science/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM","bundle":"https://pith.science/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM/bundle.json","state":"https://pith.science/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESDLBTIQ4EOQAIZFY3RRRN3CDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ESDLBTIQ4EOQAIZFY3RRRN3CDM","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":"90a029904f35aa23f0ad35d4f52e30c10c2a277e7aab19282b169bac5f24d64a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-12-22T15:44:41Z","title_canon_sha256":"87558f87e27220504bc2627735c242754f2ed49812ebc30b0e7d1ddc28dd5cc4"},"schema_version":"1.0","source":{"id":"2312.14777","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14777","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14777v3","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14777","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"pith_short_12","alias_value":"ESDLBTIQ4EOQ","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"pith_short_16","alias_value":"ESDLBTIQ4EOQAIZF","created_at":"2026-07-05T10:43:34Z"},{"alias_kind":"pith_short_8","alias_value":"ESDLBTIQ","created_at":"2026-07-05T10:43:34Z"}],"graph_snapshots":[{"event_id":"sha256:65d3fc557f5add974ffb5f57f50454af1f220b50bbbda90557ed58c70b3d8b0c","target":"graph","created_at":"2026-07-05T10:43:34Z","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/2312.14777/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same machine, and the maximum processing time among all machines is minimized. We propose a new compact mixed integer linear formulation based on the representatives model for the vertex coloring problem, which overcomes a number of issues inherent in the natural assignment model. We present a polyhedral study of the associated polytope, and describe classes of valid inequalities inherited from the stable set polytope. We ","authors_text":"Hande Yaman, Phablo F. S. Moura, Roel Leus","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-12-22T15:44:41Z","title":"Compact formulations and valid inequalities for parallel machine scheduling with conflicts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14777","kind":"arxiv","version":3},"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:5f45192b1428d293add82d8aa7aeff4b4f3abe06b1b5d6ee68b4921b73e28889","target":"record","created_at":"2026-07-05T10:43:34Z","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":"90a029904f35aa23f0ad35d4f52e30c10c2a277e7aab19282b169bac5f24d64a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-12-22T15:44:41Z","title_canon_sha256":"87558f87e27220504bc2627735c242754f2ed49812ebc30b0e7d1ddc28dd5cc4"},"schema_version":"1.0","source":{"id":"2312.14777","kind":"arxiv","version":3}},"canonical_sha256":"2486b0cd10e11d002325c6e318b7621b33451957a8d6c7c4edcb35d892d5121c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2486b0cd10e11d002325c6e318b7621b33451957a8d6c7c4edcb35d892d5121c","first_computed_at":"2026-07-05T10:43:34.632165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:34.632165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V1cvkfVYCUAqQtChw26x84iaTY0EpSVGrydIkC6AbeRc2RnHMBRDLPRA3EP4KLaX+QvflBPdy+LCK8JQZeFcDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:34.632753Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.14777","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f45192b1428d293add82d8aa7aeff4b4f3abe06b1b5d6ee68b4921b73e28889","sha256:65d3fc557f5add974ffb5f57f50454af1f220b50bbbda90557ed58c70b3d8b0c"],"state_sha256":"6a2e66f2f0c1db4abced3df8dd201b8ae79d483ca14540e6366fa0e88865adcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ga4ymeVlzurPm2xc9K3B4+1xjQsiGFfcZAc7ZY0tQ1O5gdhyGlxQy3L+tPRYyNNaDoURdHlwZfdUdyFmPZhnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T21:49:07.831114Z","bundle_sha256":"bac274f4105bcc54937ae0926a12c62e8d986a2dac70638395e62df6df78cbed"}}