{"as_of":"2026-08-11T03:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7941ff4a9cb83d2ee3c0379c902c90a7c23b9681ff64983b226c912bd86c27c4","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:42:14.668855Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:38:12.621346Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T22:38:12.757195Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"cited_work":{"arxiv_id":"2506.05613","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.05613","snapshot_observed_at":"2026-08-06T22:38:12.757195Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","venue":"cs.GT","work_id":"4603397f-88de-47b7-b255-2e6e5e94e5ff","year":2025},"citing_paper":{"arxiv_id":"2506.21493","last_updated":"2025-06-26T17:21:51Z","snapshot_observed_at":"2026-08-10T10:00:27.000186Z","submitted_at":"2025-06-26T17:21:51Z","title":"From multi-allocations to allocations, with subadditive valuations","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:38:12.621346Z"},"links":{"cited_paper":"/paper/2506.05613","citing_paper":"/paper/2506.21493"},"observation_digest":"sha256:fc2b4486303e6c8b4ec44e1b58a1a7dd9995529dc94fd1364ba197ab98f1c5f9","observation_id":"bb193ef9-1aea-466a-9427-35aa0f18c7fb","resolution":{"observed_at":"2026-08-06T22:38:12.933279Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.05613/citation-record","integrity":"/paper/2506.05613/integrity","json":"/paper/2506.05613/citation-record.json","paper":"/paper/2506.05613"},"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-07T10:42:15.290034Z","title":"Breaking the 3/4 barrier for approximate maximin share","venue":null,"work_id":"1d9bc09d-1ed3-4f6c-ac6a-7702caa07146","year":2024},"citing_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:14.320274Z"},"links":{"citing_paper":"/paper/2506.05613"},"observation_digest":"sha256:7524b218169cda1bf6600ad398b9e5a982fe43d12a603cda0dd6c82c68fa1357","observation_id":"917ac0f0-bf98-4994-9149-768fde0d9a0e","resolution":{"observed_at":"2026-08-07T10:42:15.322811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05139","last_updated":"2024-12-09T08:57:32Z","snapshot_observed_at":"2026-07-06T18:42:26.589950Z","submitted_at":"2024-07-06T17:31:58Z","title":"Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations","version":2},"cited_work":{"arxiv_id":"2407.05139","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.05139","snapshot_observed_at":"2026-08-07T10:42:14.764867Z","title":"Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations","venue":"cs.GT","work_id":"f45fc7b0-d5ec-419d-9bab-abdd231b464f","year":2024},"citing_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:14.602751Z"},"links":{"cited_paper":"/paper/2407.05139","citing_paper":"/paper/2506.05613"},"observation_digest":"sha256:304af037d4fe9b5df2fdc356fe54a58f5c383a57a3971ddd137dfd5b51aaff76","observation_id":"2a37ec28-c7f2-490a-bef3-110cf91b1e7a","resolution":{"observed_at":"2026-08-07T10:42:14.824268Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:15.102650Z","title":"The unreasonable fairness of maximum Nash welfare","venue":null,"work_id":"e07ba115-a664-4d20-be81-298260f7a678","year":2016},"citing_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"reference_index":1103,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:14.445727Z"},"links":{"citing_paper":"/paper/2506.05613"},"observation_digest":"sha256:701f2fa96c05f41d5ce7455c76ee0a70491d01b3adae65bd5e8a32983889561b","observation_id":"84a1dad4-7f56-4378-8bd2-9aa316c6442d","resolution":{"observed_at":"2026-08-07T10:42:15.132787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:15.187968Z","title":"The combinatorial assignment problem: Approximate competitive equilib- rium from equal incomes","venue":null,"work_id":"489fdb95-703d-41b5-8eb1-5c35f0578794","year":2011},"citing_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:14.378487Z"},"links":{"citing_paper":"/paper/2506.05613"},"observation_digest":"sha256:9a91ecb15514343c01d342f5abc070a437bef17aa6b9fdbed418832a211d44bc","observation_id":"0419e846-0e47-4cb5-95d0-61a6492fa110","resolution":{"observed_at":"2026-08-07T10:42:15.251997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:14.889695Z","title":"Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem","venue":null,"work_id":"798b4bfb-d582-4cd9-8ba2-ab33560b9e06","year":2024},"citing_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:14.668855Z"},"links":{"citing_paper":"/paper/2506.05613"},"observation_digest":"sha256:3277f7141879ab2cc66797cf8345da5f20ee03fce3d43b46acf62674aeeaf0ad","observation_id":"3c1f9374-5b0e-4b89-8316-0a708069909f","resolution":{"observed_at":"2026-08-07T10:42:14.952394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:15.002752Z","title":"A constant-factor approximation for nash social welfare with subadditive valuations","venue":null,"work_id":"9b75133a-18d7-4be3-ab94-2daae2b11cce","year":1961},"citing_paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:14.547239Z"},"links":{"citing_paper":"/paper/2506.05613"},"observation_digest":"sha256:b157c6761e0c008ed02617867921a3fa96b1c26059fdf40bba0d3dae3593f61c","observation_id":"3b366241-ea87-4459-89ea-80db0e58218b","resolution":{"observed_at":"2026-08-07T10:42:15.046549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05613","last_updated":"2025-06-05T21:55:07Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-08T11:57:24.890267Z","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":6},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 1 inbound Pith citation observation for arXiv:2506.05613."}