{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KHCRLFGMMWCB4Z6NG7KQZDL375","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"45b22fe9197eb43b195209cd915f364b091768e8289fad93a4a60683a5bbe896","cross_cats_sorted":["cs.CY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T19:23:04Z","title_canon_sha256":"d1210e34b3ae9d499a1526cbe777fa3d47b8e9d5b51fb588ea4abe79076f2f74"},"schema_version":"1.0","source":{"id":"2605.04235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04235","created_at":"2026-06-03T02:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04235v2","created_at":"2026-06-03T02:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04235","created_at":"2026-06-03T02:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"KHCRLFGMMWCB","created_at":"2026-06-03T02:05:48Z"},{"alias_kind":"pith_short_16","alias_value":"KHCRLFGMMWCB4Z6N","created_at":"2026-06-03T02:05:48Z"},{"alias_kind":"pith_short_8","alias_value":"KHCRLFGM","created_at":"2026-06-03T02:05:48Z"}],"graph_snapshots":[{"event_id":"sha256:7a4baebba862e747200f833bf9c5f81354d5a5feb19707d6480835c0158654bc","target":"graph","created_at":"2026-06-03T02:05:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Computational experiments demonstrated that ILS outperformed in more complex scenarios when compared to the results obtained by a commercial solver on the introduced mathematical model. ILS was particularly efficient in real and artificial instances that exhibited a higher number of conflicts."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That interpersonal conflicts can be pre-quantified accurately enough for the model to produce seating plans that actually reduce real-world friction, and that the test instances sufficiently represent typical classroom conflict structures."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces the Student Seat Allocation Problem and reports that an Iterated Local Search heuristic outperforms a commercial solver on classroom instances with many conflicts."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A heuristic search method finds better classroom seating arrangements than commercial solvers when student conflicts are numerous."}],"snapshot_sha256":"8ddd9cb1913397c03da10092811391ad936acdfdb39e57998ef0d67b4f227f2d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T12:36:11.671605Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:21.001050Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T14:41:18.848554Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.04235/integrity.json","findings":[{"audited_at":"2026-05-19T14:41:18.848554Z","detected_arxiv_id":null,"detected_doi":"10.1016/j.tate.2023.104016.Jan","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.tate.2023.104016.Jan) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":8,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"79c8ba386683167e62470b2c8a473b3233f20a171fbe6de4fb9e53cfa86ae1cb","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Classroom dynamics depend on various elements that influence teaching performance and learning activities. A key challenge is to determine the most effective seating plan, where students will seat in a specific classroom setting to achieve the best learning environment. This paper introduces the Student Seat Allocation Problem (SSAP) for strategically organizing student seating in traditional classrooms to minimize interpersonal conflicts. We propose a mathematical model and an Iterated Local Search (ILS) heuristic to solve the SSAP. Computational experiments demonstrated that ILS outperformed","authors_text":"Bruna Cristina Braga Charytitsch, Mari\\'a Cristina Vasconcelos Nascimento","cross_cats":["cs.CY","math.OC"],"headline":"A heuristic search method finds better classroom seating arrangements than commercial solvers when student conflicts are numerous.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T19:23:04Z","title":"Conflict-Aware Seat Assignment in Classroom Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.04235","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T17:29:41.623935Z","id":"b18d30ad-2d52-48ae-961e-6762e75996ca","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces the Student Seat Allocation Problem and reports that an Iterated Local Search heuristic outperforms a commercial solver on classroom instances with many conflicts.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A heuristic search method finds better classroom seating arrangements than commercial solvers when student conflicts are numerous.","strongest_claim":"Computational experiments demonstrated that ILS outperformed in more complex scenarios when compared to the results obtained by a commercial solver on the introduced mathematical model. ILS was particularly efficient in real and artificial instances that exhibited a higher number of conflicts.","weakest_assumption":"That interpersonal conflicts can be pre-quantified accurately enough for the model to produce seating plans that actually reduce real-world friction, and that the test instances sufficiently represent typical classroom conflict structures."}},"verdict_id":"b18d30ad-2d52-48ae-961e-6762e75996ca"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6ff61b8d42b8a6fef7a01311b2de5abf0cfecf2adcc42066cfc59d1330a36b04","target":"record","created_at":"2026-06-03T02:05:48Z","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":"45b22fe9197eb43b195209cd915f364b091768e8289fad93a4a60683a5bbe896","cross_cats_sorted":["cs.CY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T19:23:04Z","title_canon_sha256":"d1210e34b3ae9d499a1526cbe777fa3d47b8e9d5b51fb588ea4abe79076f2f74"},"schema_version":"1.0","source":{"id":"2605.04235","kind":"arxiv","version":2}},"canonical_sha256":"51c51594cc65841e67cd37d50c8d7bff7db54d2b297d1149cb75bee53191a56d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51c51594cc65841e67cd37d50c8d7bff7db54d2b297d1149cb75bee53191a56d","first_computed_at":"2026-06-03T02:05:48.130789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T02:05:48.130789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e9qrgWlw3oezFDFBhsgj5jMix1b8rLPaJrW1beUdCBhrPnlqtR+ZCe3+VUC+l9Ir0ZoGiHoNQSupieLvLqHLCA==","signature_status":"signed_v1","signed_at":"2026-06-03T02:05:48.131285Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.04235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1f40904218fbd3f4192659a3d4fd5fee35c17aee1af4f2af32801ac3c507f60","sha256:6ff61b8d42b8a6fef7a01311b2de5abf0cfecf2adcc42066cfc59d1330a36b04","sha256:7a4baebba862e747200f833bf9c5f81354d5a5feb19707d6480835c0158654bc"],"state_sha256":"78648d8103c38176bf828da643c160a51880b934ff8a62e5946a130ee9ee6871"}