{"as_of":"2026-08-08T07:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bfae16d969e2b6bd8dbb667a6e5111674512a52a0c92e5fb487f2caba8296b94","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:09:14.463863Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.04274/citation-record","integrity":"/paper/2506.04274/integrity","json":"/paper/2506.04274/citation-record.json","paper":"/paper/2506.04274"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:20.065650Z","title":null,"venue":null,"work_id":"0fd2cc85-b172-492a-8f5c-7d0c355f435e","year":1993},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:12.671261Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:dd60b624ed9c2c114ccea87822dc8aafd303f31a561f0dd979dd5c517f6e3eb8","observation_id":"842d15b3-01c5-4d6d-8696-452b905c463e","resolution":{"observed_at":"2026-08-07T11:09:20.144918Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:19.819623Z","title":"The Hungarian method for the assignment problem,","venue":null,"work_id":"7c9c646f-2274-48c3-b0c1-26670cf67231","year":1955},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:12.715643Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:86cd3362ae4f20d5cdb127977f833e7c4602a17685b521b802120823f76c8544","observation_id":"47e5134d-9a70-4624-9cf8-215bb30445bd","resolution":{"observed_at":"2026-08-07T11:09:19.936314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:19.576095Z","title":"Assignment problem with conflicts,","venue":null,"work_id":"974fe049-26ab-4252-b99a-c41ad7e72bf7","year":2019},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:12.771467Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:db3c5f68785348b74e5564c605c55277d89d9b897b4caa31d7ef8a8598c6ca87","observation_id":"baf2e676-c0fd-4edc-b32c-9ccb7a104c1a","resolution":{"observed_at":"2026-08-07T11:09:19.742473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:19.383599Z","title":"A branch-and-bound algorithm for the knapsack problem with conflict graph,","venue":null,"work_id":"8ccf5d80-4c8a-42ee-a368-2b9dd2c6776c","year":2017},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:12.866409Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:6755bbc92ec0919a33d865cfd5655c2829e95c41efa242300b5ac3e214b54232","observation_id":"9595d933-de61-4548-879f-23a620f2f132","resolution":{"observed_at":"2026-08-07T11:09:19.447928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:19.128929Z","title":"A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts,","venue":null,"work_id":"fd6d924a-d96b-4f1c-9599-90ec7928ffa0","year":2021},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:12.935676Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:593f5911873dc21ee05c96f2361843562d4c4251462500518d01ec1a306da2a3","observation_id":"5fa7c0d2-40ce-44e9-8622-ca78e09c1df6","resolution":{"observed_at":"2026-08-07T11:09:19.259645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.927778Z","title":"The minimum spanning tree prob- lem with conflict constraints and its variations,","venue":null,"work_id":"e1db7608-8b35-4762-b9cc-d6d2dbec5ac9","year":2011},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:12.982041Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:d25191eabf2063d1ea5d10f4387bc377651acfe1a0c48f77863319aca6cc2314","observation_id":"d06729a0-8648-4721-95f1-5d9cee59877d","resolution":{"observed_at":"2026-08-07T11:09:19.041513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.799189Z","title":"A branch and cut algorithm for minimum spanning trees under conflict constraints,","venue":null,"work_id":"171e404b-8f32-42b0-a2f2-9e43ddeaef88","year":2014},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.117236Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:6ac0b7d212c77758331a28346ae7fafaa9a147fc76688e7f8c621bff631f2ed9","observation_id":"b4f932c9-31ab-4e33-ab2d-15eef29f592c","resolution":{"observed_at":"2026-08-07T11:09:18.850159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.637343Z","title":"A multi-ethnic genetic approach for the minimum conflict weighted spanning tree problem,","venue":null,"work_id":"b1673550-a731-4a2e-8ae4-f53e80fe2656","year":2019},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.268873Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:86351ea16436f9cb37fea21f1d3c8320b56269d8a154490ff1a4840f21f148d2","observation_id":"3daf60af-86d6-4c07-9a7d-bbb67fb97c15","resolution":{"observed_at":"2026-08-07T11:09:18.722667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.508766Z","title":"Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach,","venue":null,"work_id":"9722edab-be07-495c-bd8f-464af365c97b","year":2019},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.357801Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:0b9f126d3d4246d804e36c47d1448522e24dcf42ef4155d265e24b08dea5b06f","observation_id":"07b42ac6-68b4-45d8-adb5-b09c44688826","resolution":{"observed_at":"2026-08-07T11:09:18.573881Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.391410Z","title":"A lagrangian approach for the minimum spanning tree problem with conflicting edge pairs,","venue":null,"work_id":"967cff6a-ab5a-49c7-ae6f-91c7a2227e88","year":2021},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.448904Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:2ddbda67cef36b14a9d2af5242fa1793a5ca505b6cd01925ce716fef7a0b3b3f","observation_id":"79f5a856-48d3-4b0b-9b1d-81d046c4aef2","resolution":{"observed_at":"2026-08-07T11:09:18.465006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.280920Z","title":"Shortest paths with exclusive-disjunction arc pairs conflicts,","venue":null,"work_id":"7b90fe27-96e1-49af-9266-3989147f847f","year":2023},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.506046Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:5fb3ae00760c728f792874e2e8645effd97513b19422fe57e6407c9b048ef061","observation_id":"1b6f73ad-4c2b-4085-afae-190f5b76466f","resolution":{"observed_at":"2026-08-07T11:09:18.332242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:18.151347Z","title":"Set covering problem with conflict constraints,","venue":null,"work_id":"13998beb-9c2a-4989-ae2b-13d34804d872","year":2022},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.570068Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:68fc24b8d0f4d341439cb1a2b41d0428cf4e5537422cb265ad4472fa91785c3d","observation_id":"3341ea00-b171-4869-b633-ae1b4303bfc8","resolution":{"observed_at":"2026-08-07T11:09:18.211479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.995022Z","title":"Solving the set covering problem with conflicts on sets: A new parallel GRASP,","venue":null,"work_id":"b4d9f115-d946-42f1-8f04-9b08a73a70d6","year":2024},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.651024Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:4642f5aa984170f473d49df1cc3984f8c1c8fc043c177a6bb3d54aa5d34cca40","observation_id":"7c8ab1dd-f760-4106-be25-088372df429c","resolution":{"observed_at":"2026-08-07T11:09:18.101652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.860583Z","title":"Exact solution algorithms for the maximum flow problem with additional conflict constraints,","venue":null,"work_id":"e518c7af-fed0-496e-a013-6a31477b0bb6","year":2020},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.745077Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:0300a58995f6b05092b9ec594cd3cec40ea80ab75cc60d8c18b560135f9717b8","observation_id":"4ac1e495-d302-4ba0-bf15-b5c95ca21504","resolution":{"observed_at":"2026-08-07T11:09:17.915961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.713908Z","title":"Hy- bridizing carousel greedy and kernel search: A new approach for the maximum flow problem with conflict constraints,","venue":null,"work_id":"c5044cf9-f7d0-4f6d-9f1f-08d581d8b6c4","year":2025},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.814087Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:2e36f97f17f4e882b99e483ad0236413fb7f844d0abcd59caffee09f8e671c0e","observation_id":"77dfa4af-7a47-46bc-9201-252bb87546be","resolution":{"observed_at":"2026-08-07T11:09:17.780076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.605266Z","title":"Paths, trees and matchings under disjunctive constraints,","venue":null,"work_id":"03fa4aab-dfda-48df-a39a-1ef6df4ca882","year":2011},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.880629Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:ec25d5ae8ebc303e9c14da63f273933617eb7e93124a02d2490693330b6a2fd7","observation_id":"69a5ea47-d456-4520-9b57-9c65f5352b99","resolution":{"observed_at":"2026-08-07T11:09:17.661760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.440905Z","title":"The minimum cost perfect matching problem with conflict pair constraints,","venue":null,"work_id":"c18e0e9b-6c9b-422c-a360-5cb2b07a05ea","year":2013},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:13.939895Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:fb88b27b1f3f9ecc4a122a4864ee78010b6cb062864f45ad9f86a17b5564c27f","observation_id":"6161d0db-87c9-403f-ac1e-96828e10d0c8","resolution":{"observed_at":"2026-08-07T11:09:17.525379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.307356Z","title":"Iterated exact and heuristic algorithms for the minimum cost bipartite perfect matching problem with conflict constraints,","venue":null,"work_id":"38c7f673-42bd-4ed0-bd8a-6c382c13c3a0","year":2017},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.004699Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:531160b4459a64b1611f4877e0eec3e890e61af4623931c1e906ac3165abeba1","observation_id":"e07605bb-c136-4b68-9120-d341f6c5ec99","resolution":{"observed_at":"2026-08-07T11:09:17.369078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.201554Z","title":"A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints,","venue":null,"work_id":"52e294bd-cc1e-4348-aaa3-187b6e31700c","year":2018},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.083433Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:514f6d6c8e232df8859117cbe252ac7f077658acee898713b6fcbdb37770ebe3","observation_id":"39bea83e-838f-4c22-91aa-ec48b7aa0ff2","resolution":{"observed_at":"2026-08-07T11:09:17.252288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:17.066120Z","title":"Google OR-Tools - CP-SAT,","venue":null,"work_id":"b58a0acf-6d45-4060-bed0-c14e0f65a33e","year":2025},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.185881Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:77ca553ae035bfbb02cd9521b2f232945ca853a6b5e617645637b40c01d7a632","observation_id":"8d9e7721-4fb9-421d-97d3-537780d48f7d","resolution":{"observed_at":"2026-08-07T11:09:17.128343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:16.929260Z","title":"Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,","venue":null,"work_id":"e6cafd31-e721-4bc5-87eb-c0e12accaa45","year":2023},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.253227Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:e88b361aeb0b66e6810437e676194934d9d32ed687051517b818ebe0140638c6","observation_id":"ff99ed2d-b3c4-4501-b2ba-664646e3ed99","resolution":{"observed_at":"2026-08-07T11:09:17.009296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:14.847978Z","title":"Parallel drone scheduling vehicle routing problems with collective drones,","venue":null,"work_id":"52517127-1635-4f48-9ac8-596c9cd014c1","year":2024},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.314637Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:3a852b5c6f1ba1c5d85f04aaab7b1627db5c7c12154b9181e2b752198a9a0cb8","observation_id":"fb0e4ce9-80a2-4837-9493-31e831215764","resolution":{"observed_at":"2026-08-07T11:09:15.202538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:14.697268Z","title":"Solving a home healthcare routing and scheduling problem with real-world features,","venue":null,"work_id":"82b428a9-8cc9-4f9a-9317-89e8075ffe6a","year":2025},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.368901Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:734853cac8e9746f1c1da206435b2294abc251e3689cc5324b4b2c4262201e71","observation_id":"5d024882-cd59-4062-b060-d350d79d547f","resolution":{"observed_at":"2026-08-07T11:09:14.745577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:14.595155Z","title":"IBM CPLEX Optimizer,","venue":null,"work_id":"9ed9cccd-5bcc-45b9-a463-ab8ced456ab3","year":2024},"citing_paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:14.463863Z"},"links":{"citing_paper":"/paper/2506.04274"},"observation_digest":"sha256:7dd9b1a74fd47c22b1f87ac8031e578389a0c5eaabaa4b864f23ea4bcb39c17c","observation_id":"8ab48115-b848-4e0b-9e80-3288d311c779","resolution":{"observed_at":"2026-08-07T11:09:14.642525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04274","last_updated":"2025-06-03T19:26:42Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T11:03:22.687196Z","submitted_at":"2025-06-03T19:26:42Z","title":"On Solving the Assignment Problem with Conflicts"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":24},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2506.04274."}