{"as_of":"2026-08-23T17:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:509542c895fb829ad54f0c4d95d2e580eb85606c758270cae03a5290385142df","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:07:24.976202Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2507.04537/citation-record","integrity":"/paper/2507.04537/integrity","json":"/paper/2507.04537/citation-record.json","paper":"/paper/2507.04537"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:07:24.418711Z","title":"Peri- odic Event Scheduling with Flexible Infrastructure Assignment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.418711Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:18f4fdafaec299fab10bcd48aca83b3c39037279b221354bc8719d6ed09b3e10","observation_id":"019458de-5ed7-46ea-83b7-02cac1275ad5","resolution":{"observed_at":"2026-08-06T20:07:24.418711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.4005","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:07:25.783413Z","title":"Is equality always desir- able? Analyzing the trade-off between fairness and attractiveness in crew rostering","venue":null,"work_id":"fe2b80d9-5e78-44db-b99c-a3f55083bbe5","year":2022},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.491453Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:6835df81473d4bbb66282745911c6fb57974b812885feada29f4e02ab9ee5b15","observation_id":"73d30ed2-d4cc-41a1-baa5-b4036fa07a07","resolution":{"observed_at":"2026-08-06T20:07:25.863717Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T20:07:26.094826Z","title":"Well-solvable special cases of the traveling salesman problem: A survey","venue":null,"work_id":"e5357a55-c65d-40dd-922a-31df20a8f455","year":1998},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.537255Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:390028e495f8e9bd4140a00a48e4ef5b164faff407e7daea7b4b89b5c544ec75","observation_id":"d6c53cf3-2189-40ed-b4e9-11495f31e3c4","resolution":{"observed_at":"2026-08-06T20:07:26.147234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/oasics.atmos.2024.5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Balanced Assignments of Periodic Tasks","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"09edd332-81a3-4ff5-9ce9-05531c7d8231","year":2024},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.598303Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:123feb8af82bd8e2c8f87cccdfe559824d9a5262e4b1493fee578921217390d9","observation_id":"e6b3fe1a-5b92-43bf-a17d-9e9a9dae3f42","resolution":{"observed_at":"2026-08-06T20:07:25.427472Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05485","last_updated":"2025-05-26T13:50:50Z","snapshot_observed_at":"2026-08-16T13:36:22.825673Z","submitted_at":"2024-07-07T20:06:04Z","title":"Balanced assignments of periodic tasks","version":2},"cited_work":{"arxiv_id":"2407.05485","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.05485","snapshot_observed_at":"2026-08-06T20:07:25.621640Z","title":"Balanced assignments of periodic tasks","venue":"cs.DM","work_id":"ba172217-4e36-4f41-aed4-d2ae5b88fd77","year":2024},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.635928Z"},"links":{"cited_paper":"/paper/2407.05485","citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:6cb87c447614cae4e5f0a5db5e7b1f12f97cd7c55c3d309d0a108f2eb8c64d7d","observation_id":"2db41a9f-a78a-42d9-a3d1-2f376b14c6c1","resolution":{"observed_at":"2026-08-06T20:07:25.694120Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tc.1979","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:07:25.307086Z","title":"An optimal solution for the channel-assignment problem","venue":null,"work_id":"bd300ec0-d60b-484f-8490-45654f65504c","year":1979},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.676206Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:3f375cee91038e1fa78a306b560d3768963cee2cb7ab19524e578eed3ae366be","observation_id":"3836854f-1662-4086-b682-5be00021c81d","resolution":{"observed_at":"2026-08-06T20:07:25.351312Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0166-218x(92)00036-l","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Discrete Applied Mathematics","work_id":"93804ddf-2320-4ff6-8c9b-38c8daaf91a9","year":1994},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.737554Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:e080220444cacc90103d21d8e87f96b82fe1808674f3d1b8aef41d28e91fb747","observation_id":"dd871052-6f3d-4291-9ca0-16138013de6f","resolution":{"observed_at":"2026-08-06T20:07:25.270045Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cie.2010.03.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Computers & Industrial Engineering","work_id":"0b1f4cac-a8d9-4112-935e-d40beaeaaa81","year":2010},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.819161Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:8ccf2382f8604f8fba1d2113c351b41bb91874166e4a4f4fcf6daac46dc726f3","observation_id":"82613240-9792-414f-8e5d-b75ab20fc470","resolution":{"observed_at":"2026-08-06T20:07:25.134581Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T20:07:25.975617Z","title":"Minimizing the number of vehicles to meet a fixed periodic schedule: An application of periodic posets","venue":null,"work_id":"c7dd8539-a813-4441-9f52-16252bf5305f","year":1982},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.869687Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:d3053b506f27667d2b31108fee89d53e4a396220d2dfb3b230d7a0eff24d42a5","observation_id":"aafa2716-8a53-4ab9-b481-cbb465e3d08f","resolution":{"observed_at":"2026-08-06T20:07:26.061295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:07:24.930073Z","title":"Integrated periodic timetabling and vehicle circulation schedul- ing","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.930073Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:f53aee6c2d9d954b8bacabb2ad362f0aee3a93794ff091ffbc33520b4b2238be","observation_id":"ab81af02-de2e-4fea-aa38-52c0d9aaa029","resolution":{"observed_at":"2026-08-06T20:07:24.930073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00291-014-0364-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Cyclic and non-cyclic crew rostering problems in public bus transit","venue":"OR Spectrum","work_id":"c6746bd7-ae58-4e44-a1b3-c87066a3b0bc","year":2015},"citing_paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:07:24.976202Z"},"links":{"citing_paper":"/paper/2507.04537"},"observation_digest":"sha256:5360ccf1c3bbb3b818d5c82ec7fb533752d1f0bfc40bccee8f28a7f0cc19eac5","observation_id":"3b807786-9004-4093-8ad0-66bb2e315db6","resolution":{"observed_at":"2026-08-06T20:07:25.074075Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.04537","last_updated":"2025-07-06T21:06:59Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T02:19:44.945062Z","submitted_at":"2025-07-06T21:06:59Z","title":"The Fair Periodic Assignment Problem"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":7,"verified_fuzzy":2},"total_outbound_references":11},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2507.04537."}