{"as_of":"2026-08-11T04:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc8c87cba26be08f652c0b4de588f41d8c1ba2f182874e9d290efe75d0d03553","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:17:37.952780Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2510.06581/citation-record","integrity":"/paper/2510.06581/integrity","json":"/paper/2510.06581/citation-record.json","paper":"/paper/2510.06581"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.726910Z","title":"Voudouris","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.726910Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:ad58c28702d080f52fec54222d708ae408b055d88acec09f1896c0c599030f7a","observation_id":"9efd6f30-8deb-4819-8e79-d65f0e1dec5a","resolution":{"observed_at":"2026-08-04T11:17:37.726910Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.733982Z","title":"On truthful mechanisms for maximin share allocations","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.733982Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:ab4fe25913de9f936f9506d3a3d5f9dbf1d056ceeb4516f72b195735e03de8ee","observation_id":"6d326ff6-dcc5-43f9-a944-43fdb8a20e75","resolution":{"observed_at":"2026-08-04T11:17:37.733982Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.739423Z","title":"Weighted maxmin fair share allocation of indivisible chores","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.739423Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:035384a1dd5c7104c7605d9a31d197aaad6b62649a6c2591549e75f630f60924","observation_id":"beb82d35-0e20-47ca-a243-2045ea43e4a4","resolution":{"observed_at":"2026-08-04T11:17:37.739423Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.745633Z","title":"Breaking the 3/4 barrier for approximate maximin share","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.745633Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:5c5e45e174fc3f17c0bddae5cbaea4d993d250fd337e49be2d2ec530c2809df0","observation_id":"1114898c-5851-431f-ac5f-bd30c861e966","resolution":{"observed_at":"2026-08-04T11:17:37.745633Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.751159Z","title":"Algorithmic fair allocation of indivisible items: a survey and new questions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.751159Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:50bff112f64fb37fabba5e7a177f027491397e930dbb629aa8fa85a280b7ffbe","observation_id":"66498095-8c76-49f9-a022-8fd982efe811","resolution":{"observed_at":"2026-08-04T11:17:37.751159Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.757868Z","title":"A polynomial-time algorithm for computing a pareto optimal and almost proportional allocation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.757868Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:a6ec0a0bde786b2fbde701cab420095a229ffa678baddd240d569c7315562598","observation_id":"f40fcb49-b3e4-4238-b218-9575581c0ec9","resolution":{"observed_at":"2026-08-04T11:17:37.757868Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.764417Z","title":"Algorithms for max-min share fair allocation of indivisible chores","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.764417Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:d3b4ead732a486e210492083b7f665febcabe71a27a1d0724c7ccc6009855419","observation_id":"d019798b-dbd7-4e3a-857e-ca2d8046eeef","resolution":{"observed_at":"2026-08-04T11:17:37.764417Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.769573Z","title":"Fair-share allocations for agents with arbitrary entitlements","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.769573Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:e81ff69dc97c505b08aa3078d0e658eb057dd7f4f6107d5e5e3a5fc7b0834c3e","observation_id":"646e3178-c80c-4132-9bfb-b657974527dd","resolution":{"observed_at":"2026-08-04T11:17:37.769573Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.775191Z","title":"Approximation algorithms for maximin fair division","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.775191Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:6c27d7fbb51c58d8a3ce4aa528868b83f0d33e7f50c5d0683de6990fd9a22668","observation_id":"1cbb6c8f-4bab-433f-beeb-7332f9be584e","resolution":{"observed_at":"2026-08-04T11:17:37.775191Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.780283Z","title":"Characterizing conflicts in fair division of indivisible goods using a scale of criteria","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.780283Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:14b09b7a62d9de35f6c930c252b5b213928e67b99028fcb793176b103ea3d55c","observation_id":"e0f84296-84f5-42fd-b7ae-ac5d5ca87b3d","resolution":{"observed_at":"2026-08-04T11:17:37.780283Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.785808Z","title":"The combinatorial assignment problem: approximate competitive equilibrium from equal incomes","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.785808Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:567ca635daaaf2796379d58aa735c1c53a4911bd70962ca893a57f4ec844f86a","observation_id":"737cf857-a769-485e-8866-98392f32d9a5","resolution":{"observed_at":"2026-08-04T11:17:37.785808Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.792161Z","title":"Fair public decision making","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.792161Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:90e62f03884c41b51d4742de4d8feebb39b8967b180ef1e2e73eedb86f23cee1","observation_id":"df0dc1d7-f8e2-4eda-80bb-e590b4cc966c","resolution":{"observed_at":"2026-08-04T11:17:37.792161Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.798098Z","title":"Weighted envy-freeness in indivisible item allocation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.798098Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:e02587516938879a0ae911c99f07f9c9223e3386c57a04e60405c330bfb32dc5","observation_id":"53b8749f-d034-4ece-924f-4b76650bcd63","resolution":{"observed_at":"2026-08-04T11:17:37.798098Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.804582Z","title":"Procaccia, Nisarg Shah, and Junxing Wang","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.804582Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:04987f66ca54e41d45255628099f763994a469edece549d359d78e195d49babc","observation_id":"e58c9e21-d1ca-407e-bd9d-f6eef4787ae4","resolution":{"observed_at":"2026-08-04T11:17:37.804582Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.813831Z","title":"Pennock, Masoud Seddighin, Saeed Seddighin, and Hadi Yami","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.813831Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:ec7ec2f519d8eea521a635f41d033cdad994fad6f89addfde2a74a2b91f662c0","observation_id":"13ed2a0b-179c-44c2-bde5-38a0f08d8ee5","resolution":{"observed_at":"2026-08-04T11:17:37.813831Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.819234Z","title":"On picking sequences for chores","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.819234Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:d759f56774d6379a8e1965d30fb06b6e832884583139445d3b31c1e425fe9c18","observation_id":"3b540369-f443-42bd-91a9-b571a5c0f082","resolution":{"observed_at":"2026-08-04T11:17:37.819234Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.825284Z","title":"Resource allocation and the public sector","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.825284Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:9ebe1ff2abee890d67eb55d55ac17985c60bf8a08f447d8cfd76a363c2c002c1","observation_id":"d9a7ff39-af47-45e5-9f4a-148219452825","resolution":{"observed_at":"2026-08-04T11:17:37.825284Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.830745Z","title":"Fair allocation of indivisible goods: Improvements and generalizations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.830745Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:5b53523318067655e5c167504193dbb8cb6df853d3f2475ea8520c2eee2a9112","observation_id":"5bdcaf54-764b-473a-95dd-872f93257699","resolution":{"observed_at":"2026-08-04T11:17:37.830745Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.836210Z","title":"A survey on fair allocation of chores","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.836210Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:78dc85fff5965015c405a6663f1343e2fa76adbaf7087e3d9c081ceb781fa7d7","observation_id":"ff7cad64-436f-42e9-969c-60126f2cbfbc","resolution":{"observed_at":"2026-08-04T11:17:37.836210Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.841955Z","title":"Near fairness in matroids","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.841955Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:421b571da70e9d737f3ae83872ba7cd70a4cb31bf727fee339becfd1da1438e2","observation_id":"1cd47b5b-2e6e-451c-938d-92487507a014","resolution":{"observed_at":"2026-08-04T11:17:37.841955Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.848354Z","title":"An algorithmic framework for approximating maximin share allocation of chores","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.848354Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:8e62788728b545031b0f0790d54950b5b0c8146cf8e0d40a9ae1400771a22d35","observation_id":"d1aec4be-3723-4f12-b9a7-962a3bb21255","resolution":{"observed_at":"2026-08-04T11:17:37.848354Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.853975Z","title":"A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.853975Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:ff74e81ebe67e5272788a796926e0db4a1a8da2b5c483b99497d189af2c8d1c8","observation_id":"80ef2256-60d6-49e8-883b-fde614419bad","resolution":{"observed_at":"2026-08-04T11:17:37.853975Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.858961Z","title":"Fair and efficient resource allocation with partial information","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.858961Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:8ca55e5a46b2feea47ba2a7f256538ecdf6a997fcc0ab5d566aa59a89d5cc2a9","observation_id":"01b5c089-25e0-4c5a-b1e5-3086ccee54f7","resolution":{"observed_at":"2026-08-04T11:17:37.858961Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.865365Z","title":"A reduction from chores allocation to job scheduling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.865365Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:ccc03269c1e699a94ba5bc8b5dc5dde2014d0a5013852b913d74c66b3df96266","observation_id":"15fb2cae-efd2-4440-91b7-771492a7082f","resolution":{"observed_at":"2026-08-04T11:17:37.865365Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.871453Z","title":"Procaccia, and Junxing Wang","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.871453Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:f07e7d314cccec308f02a2bfe08569263cbeb189b54f06fd580f8459139f4e82","observation_id":"df4fbe03-1bf6-4d39-a67c-53971593c767","resolution":{"observed_at":"2026-08-04T11:17:37.871453Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.877427Z","title":"Almost (weighted) proportional allocations for indivisible chores","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.877427Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:ec694b340bb2602ba83322195e1dc55dc321cc3fda9227f84cda1ac80bda23ff","observation_id":"4defc5a4-e8e4-4094-9a7d-f5b86a6fd4c7","resolution":{"observed_at":"2026-08-04T11:17:37.877427Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.884375Z","title":"Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.884375Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:b1656abc6481f7537523c2c40ff781180fc89f01bad092f33216429d140d239b","observation_id":"692f76b8-273c-4166-a8ab-b2c2d530a1b2","resolution":{"observed_at":"2026-08-04T11:17:37.884375Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.890604Z","title":"Fair allocation of indivisible chores: Beyond additive costs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.890604Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:258991190bf460ca1c64e882f8a4854c0ad01403f5d3a3701d33dbef84f1fe9e","observation_id":"151643d1-03ed-4e6a-b922-fdcda74301ac","resolution":{"observed_at":"2026-08-04T11:17:37.890604Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.898772Z","title":"Almost envy-free allocations of indivisible goods or chores with entitlements","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.898772Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:1747ad0f8feacab48b32fd17981ad960853fa4e454c6b863efefd3d237d70742","observation_id":"5c622ee2-49d2-4197-a714-d293dfad877d","resolution":{"observed_at":"2026-08-04T11:17:37.898772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.12984","snapshot_observed_at":"2026-08-04T11:17:37.905974Z","title":"Lower bound for online MMS assignment of indivisible chores","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.905974Z"},"links":{"cited_paper":"/paper/2507.12984","citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:1a30f9829e9298971a2607b1023086fbbf6d83241c2c4f8132409bc6b8fe8e8d","observation_id":"5c72174e-cbbb-4769-b0dd-891938f88083","resolution":{"observed_at":"2026-08-04T11:17:37.905974Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.913470Z","title":"Shmoys and \\' E va Tardos","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.913470Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:d15b8be24f7ec191c229f9b3c5f6a82a5e12e6dd896257593c3156f3f7a7b367","observation_id":"4ac84478-9bb7-4d29-9a9e-6f326e38d41a","resolution":{"observed_at":"2026-08-04T11:17:37.913470Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.920374Z","title":"The problem of fair division","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.920374Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:8306be2c5814547d70a6a44e046a8ed7dba011dfa0f74cd22dbc3f615dc2c326","observation_id":"0a1afb0c-7228-4b4a-95e8-2760c943fd35","resolution":{"observed_at":"2026-08-04T11:17:37.920374Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.926073Z","title":"Online MMS allocation for chores","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.926073Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:c58c4dd80226f3ba15ee578370f639815e7ddacbde1884e58cb0c2d00f96b8d6","observation_id":"8d74efc8-fd5d-4d96-8bc2-16ccb0cc3f9d","resolution":{"observed_at":"2026-08-04T11:17:37.926073Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.930873Z","title":"Weighted fair division of indivisible items: A review","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.930873Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:38635229e5d6e36e553e1e099c9aaccf25e65e4a6dc92064392cf661e55e79ac","observation_id":"ca500a45-4788-4244-9ca6-d18bda49d0f6","resolution":{"observed_at":"2026-08-04T11:17:37.930873Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.936097Z","title":"Equity, envy, and efficiency","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.936097Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:bdc45e528a6bb468ed41f1b66fe208157fb8385edca205d6197dbbea0f9196d0","observation_id":"c9c85c0d-f604-43ba-8bdd-10f8ae0d9f80","resolution":{"observed_at":"2026-08-04T11:17:37.936097Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.941115Z","title":"Improved approximation of weighted MMS fairness for indivisible chores","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.941115Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:727ebaa8aee8e6d2145245a205c84ee35df63a15ba47b5b7c978972d856547d8","observation_id":"b89adc2f-11bb-46c2-b5d9-11fc6ada5cfd","resolution":{"observed_at":"2026-08-04T11:17:37.941115Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.947943Z","title":"Weighted EF1 allocations for indivisible chores","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.947943Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:3c47230c00686b59d78ef9c608eb59946d7099d369ac78d2c6835175a2a5fa97","observation_id":"cd779ad7-1356-4c89-8fcd-2b2cae00b210","resolution":{"observed_at":"2026-08-04T11:17:37.947943Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:17:37.952780Z","title":"Multi-agent online scheduling: MMS allocations for indivisible items","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.952780Z"},"links":{"citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:348a81964bc12e9abb7772886f9f7bb8cb63e21f98019a30cc817879639fbe4c","observation_id":"d7ee6881-75cf-403d-b20b-90f7ca075344","resolution":{"observed_at":"2026-08-04T11:17:37.952780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":38},"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 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2510.06581."}