{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7CLYY5FXTSWOXKOXBJJO6XU3SZ","short_pith_number":"pith:7CLYY5FX","schema_version":"1.0","canonical_sha256":"f8978c74b79caceba9d70a52ef5e9b966239d79f1867351859cc597429f75e27","source":{"kind":"arxiv","id":"2502.08684","version":1},"attestation_state":"computed","paper":{"title":"Self-Evaluation for Job-Shop Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Imanol Echeverria, Maialen Murua, Roberto Santana","submitted_at":"2025-02-12T11:22:33Z","abstract_excerpt":"Combinatorial optimization problems, such as scheduling and route planning, are crucial in various industries but are computationally intractable due to their NP-hard nature. Neural Combinatorial Optimization methods leverage machine learning to address these challenges but often depend on sequential decision-making, which is prone to error accumulation as small mistakes propagate throughout the process. Inspired by self-evaluation techniques in Large Language Models, we propose a novel framework that generates and evaluates subsets of assignments, moving beyond traditional stepwise approaches"},"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":"2502.08684","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-12T11:22:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"02feda310f07d2fd15690591181f7d08598a113b3e782d86d089d990b8a332a7","abstract_canon_sha256":"c88a65b2388ce10c6204143384b413138c5617fe26924304628f538b937b4a6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:28.494699Z","signature_b64":"TwYOpFVOvRosQ2Ua46KRUwYTK3UODtjyzDSpO0MLAEPUBh+Bcur75ZjSPfqC+6yBISaBelIvnbBx2yvTxMVxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8978c74b79caceba9d70a52ef5e9b966239d79f1867351859cc597429f75e27","last_reissued_at":"2026-07-05T10:13:28.494266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:28.494266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Evaluation for Job-Shop Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Imanol Echeverria, Maialen Murua, Roberto Santana","submitted_at":"2025-02-12T11:22:33Z","abstract_excerpt":"Combinatorial optimization problems, such as scheduling and route planning, are crucial in various industries but are computationally intractable due to their NP-hard nature. Neural Combinatorial Optimization methods leverage machine learning to address these challenges but often depend on sequential decision-making, which is prone to error accumulation as small mistakes propagate throughout the process. Inspired by self-evaluation techniques in Large Language Models, we propose a novel framework that generates and evaluates subsets of assignments, moving beyond traditional stepwise approaches"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08684","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.08684/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.08684","created_at":"2026-07-05T10:13:28.494321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08684v1","created_at":"2026-07-05T10:13:28.494321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08684","created_at":"2026-07-05T10:13:28.494321+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CLYY5FXTSWO","created_at":"2026-07-05T10:13:28.494321+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CLYY5FXTSWOXKOX","created_at":"2026-07-05T10:13:28.494321+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CLYY5FX","created_at":"2026-07-05T10:13:28.494321+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/7CLYY5FXTSWOXKOXBJJO6XU3SZ","json":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ.json","graph_json":"https://pith.science/api/pith-number/7CLYY5FXTSWOXKOXBJJO6XU3SZ/graph.json","events_json":"https://pith.science/api/pith-number/7CLYY5FXTSWOXKOXBJJO6XU3SZ/events.json","paper":"https://pith.science/paper/7CLYY5FX"},"agent_actions":{"view_html":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ","download_json":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ.json","view_paper":"https://pith.science/paper/7CLYY5FX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08684&json=true","fetch_graph":"https://pith.science/api/pith-number/7CLYY5FXTSWOXKOXBJJO6XU3SZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7CLYY5FXTSWOXKOXBJJO6XU3SZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ/action/storage_attestation","attest_author":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ/action/author_attestation","sign_citation":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ/action/citation_signature","submit_replication":"https://pith.science/pith/7CLYY5FXTSWOXKOXBJJO6XU3SZ/action/replication_record"}},"created_at":"2026-07-05T10:13:28.494321+00:00","updated_at":"2026-07-05T10:13:28.494321+00:00"}