{"as_of":"2026-08-10T12:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b3d8b74109a04e9136f8b3dd7508c27d86d6fb57d5c73d43f8fd4ce54ae4cfb","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T18:41:23.657804Z","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":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:50:32.567707Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.10308","snapshot_observed_at":"2026-08-07T22:50:32.567707Z","title":"Llm-powered preference elicitation in combinatorial assignment","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.09053","last_updated":"2025-08-05T02:23:31Z","snapshot_observed_at":"2026-08-08T10:12:47.586452Z","submitted_at":"2025-02-13T08:08:27Z","title":"Game Theory Meets Large Language Models: A Systematic Survey with Taxonomy and New Frontiers","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T22:50:32.567707Z"},"links":{"cited_paper":"/paper/2502.10308","citing_paper":"/paper/2502.09053"},"observation_digest":"sha256:02837e2bd9978f25f44a62cad2e098cf3cbadafd83d4f334a0a4b6a6d9198729","observation_id":"de92d01b-d73b-44c4-a735-de751488f9e5","resolution":{"observed_at":"2026-08-07T22:50:32.567707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.10308","snapshot_observed_at":"2026-08-03T19:53:49.786701Z","title":", Jiang, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.22834","last_updated":"2026-07-29T13:05:56Z","snapshot_observed_at":"2026-08-07T10:53:02.994694Z","submitted_at":"2025-11-28T01:52:45Z","title":"Complexity Beyond Incentives: The Critical Role of Reporting Language","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-03T19:53:49.786701Z"},"links":{"cited_paper":"/paper/2502.10308","citing_paper":"/paper/2511.22834"},"observation_digest":"sha256:80aea95c76cfe402b7e1774b1ab21e7302669f44ec097da3a7830f9dec0fd5b7","observation_id":"c087852a-94a2-420c-819d-0a4363d877e1","resolution":{"observed_at":"2026-08-03T19:53:49.786701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.10308","snapshot_observed_at":"2026-08-02T23:58:47.429792Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12089","last_updated":"2026-06-27T04:49:42Z","snapshot_observed_at":"2026-08-07T01:50:59.966280Z","submitted_at":"2026-02-12T15:41:57Z","title":"Choose Your Agent: Tradeoffs in Adopting AI Advisors, Coaches, and Delegates in Multi-Party Negotiation","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-02T23:58:47.429792Z"},"links":{"cited_paper":"/paper/2502.10308","citing_paper":"/paper/2602.12089"},"observation_digest":"sha256:c778ecaa0f7befd943433d03251f554f9e302f48e99dd7018de0a162afb2ebc6","observation_id":"9d1b7a8a-dc9e-4c29-a1a7-9717cacdc3c8","resolution":{"observed_at":"2026-08-02T23:58:47.429792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.10308/citation-record","integrity":"/paper/2502.10308/integrity","json":"/paper/2502.10308/citation-record.json","paper":"/paper/2502.10308"},"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-07T18:41:24.252526Z","title":null,"venue":null,"work_id":"5eae6451-459a-4fe5-a0b6-de571855f7e3","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.476013Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:a7a7a6d3aad163e1874487e00d91f2f7ec26e2880efff8da081a7748dbfe7fe5","observation_id":"84eebb43-177f-4baf-8292-c861ddbb7aa6","resolution":{"observed_at":"2026-08-07T18:41:24.255049Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.243711Z","title":"- {group}","venue":null,"work_id":"1e4d07df-692e-477d-8539-afeea5c9da33","year":2024},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.503616Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:721cdd4a45e43c3f307528169c3d6372f2ed826ef20f4ce9cbf9a978c01c02d6","observation_id":"5bca0491-8bfd-4aa5-ab76-e36ad25aa0d6","resolution":{"observed_at":"2026-08-07T18:41:24.247007Z","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-07T18:41:24.215464Z","title":null,"venue":null,"work_id":"5a197764-716f-475c-bf79-7b736d1e2076","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.571154Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:7266551a0d5ae6d1ab152d9ffe95cbbff447fdb93b589edd69ec9cc031085c08","observation_id":"78e5d213-4cdb-464c-b867-a228d29ae7a2","resolution":{"observed_at":"2026-08-07T18:41:24.218915Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.205925Z","title":"Make sure to reference both your relative preferences within each tier and the specific impacts of course combinations on your overall academic plan","venue":null,"work_id":"45b19726-d95a-458e-be4d-7c203060d3f3","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.574388Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:b297ea870847e53332fd1a455d173f008e4048cea589bc1f3135e07bbddf9a1a","observation_id":"34b92f88-610e-4029-8110-9f9872ac0981","resolution":{"observed_at":"2026-08-07T18:41:24.209452Z","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-07T18:41:24.114379Z","title":null,"venue":null,"work_id":"c90286a0-3466-4f65-bbed-c637a3d9b5b3","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.598772Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:24d0dadda8fa278ecdfaa7837c839830553bd2c81b88310ce3442a06e98e2c61","observation_id":"c6eab9fd-75f3-4efc-a06f-29b16505d2c7","resolution":{"observed_at":"2026-08-07T18:41:24.149582Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.061438Z","title":null,"venue":null,"work_id":"4a9b4003-f3dc-4957-8098-f679728202c2","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.601739Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:21c45f079cfe684982afedad00b49664fa28d82d6fd59c149035e39d12199a04","observation_id":"662b8631-6565-490a-91db-a5825301a26d","resolution":{"observed_at":"2026-08-07T18:41:24.072042Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.234257Z","title":null,"venue":null,"work_id":"0c8b3fcd-2da9-49a0-964d-09b5446db5c4","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.536467Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:fa064a5d9759713ca406711e64f10b44e77f525680a49044242dc32e7c321559","observation_id":"ea87d927-3f38-43eb-830a-a10a0f45ea5a","resolution":{"observed_at":"2026-08-07T18:41:24.237977Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.224994Z","title":null,"venue":null,"work_id":"2a9afde3-f8ae-4099-8796-76cf4817e70c","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.551319Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:b766c7677a58d7488bb6e9994f74347040dc0043f1c0538ae12b9d7bdb5fd613","observation_id":"42161e34-3c2e-4f34-9983-96ad4f72fc34","resolution":{"observed_at":"2026-08-07T18:41:24.228262Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.035839Z","title":null,"venue":null,"work_id":"e591b3dc-2b45-4106-995c-d18bce34b2c3","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.611500Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:33c65ef618f5ef3ac4666d56ebe9186c27d7963a7d6d8c5534108992e8bdba64","observation_id":"e6e5f07e-d92a-4ae0-b093-b60738eb9990","resolution":{"observed_at":"2026-08-07T18:41:24.038585Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.026521Z","title":null,"venue":null,"work_id":"6b64d843-2a05-45b8-82c2-b0f5929f7c09","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.615098Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:c5ba1d08c4053d77a175bcaa0490b4e9dbb9e710411f77c66f5d4c2008eb6b16","observation_id":"0c40d549-d30b-44e9-8cc3-93ba6cc76e77","resolution":{"observed_at":"2026-08-07T18:41:24.029756Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.196779Z","title":null,"venue":null,"work_id":"f0f46598-4b34-49b6-9dd8-a49755f546de","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.578080Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:8e928034c71cf20cd9d6035760fee560ba6d72193af9ffa51cb98857af06a473","observation_id":"403f7e37-9ee4-4006-a7ff-7eabecae5bfa","resolution":{"observed_at":"2026-08-07T18:41:24.200107Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.187810Z","title":null,"venue":null,"work_id":"3f78491b-758e-40e8-9a7d-1b643f39aeb3","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.581267Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:a4e0cf8098d9fc98f8413e9247b07b1e395770028e0964c311ba6093285b5fda","observation_id":"0b225939-afab-43b4-9961-adb60aad6113","resolution":{"observed_at":"2026-08-07T18:41:24.190902Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T18:41:24.179419Z","title":null,"venue":null,"work_id":"7c2196f9-a92c-47ab-abfe-8ff4a27356db","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.584621Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:b50fe7f53d631edd06b391a35fd838056d8de0e7c9e80b555c5cebe6d0b600d6","observation_id":"92db3b3a-8467-492a-bdbd-de6b0246ec91","resolution":{"observed_at":"2026-08-07T18:41:24.182207Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.171318Z","title":null,"venue":null,"work_id":"cded3d8b-a578-4f30-b52e-2686d3305ea5","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.588170Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:856f956a1f9213ee67730827fbcdbf218ebec58df163b3ff93e3720601645ca9","observation_id":"b4f8b729-a59a-4baf-936a-b61135458fd6","resolution":{"observed_at":"2026-08-07T18:41:24.174220Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.162960Z","title":null,"venue":null,"work_id":"e295b497-e864-4858-be4b-4f15a2ebe98d","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.592010Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:acccb44fbda1e5cd39bf18e3c4e7ad7f53048458cb264f6a051c9ec2a52e3b2f","observation_id":"16796496-21bd-421b-be46-64abbc475b1a","resolution":{"observed_at":"2026-08-07T18:41:24.165945Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.155017Z","title":null,"venue":null,"work_id":"b15cdf89-572e-4391-b742-8c3a19bc2b41","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.595592Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:ab48cfb11a1d26110fda6b4f9e930bc97cc342e761eef205c4a37484939edc1b","observation_id":"7a812c66-b652-4e1f-91c9-790fceff9160","resolution":{"observed_at":"2026-08-07T18:41:24.157793Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.872772Z","title":null,"venue":null,"work_id":"ea451013-02dd-42e3-b4ef-3544636b47f8","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.637851Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:c12e325d1a78dd8cca26fbe4b6cd3736deedfd21134c4137ebb2e91388ed6438","observation_id":"baf638eb-526c-402a-9ac5-4d5b1e159456","resolution":{"observed_at":"2026-08-07T18:41:23.876319Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.863167Z","title":null,"venue":null,"work_id":"f7a3ad0d-98bf-468a-ad37-7766e26acd74","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.641107Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:82864f425709fa1ee794f78b221bb72e6cb9f488b118a87ad7828150e48d628b","observation_id":"e0845382-44e0-4b3c-80c9-b2e0815c9540","resolution":{"observed_at":"2026-08-07T18:41:23.866512Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.053205Z","title":null,"venue":null,"work_id":"fb064286-1945-4085-8fd4-f96aea215802","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.604639Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:f85daeecd9281ebca3a1b28d51b44955f938c6e2906fd8b996d7b1af0f8cf250","observation_id":"e8ab3f76-15a8-44b8-a626-160df7ef46ce","resolution":{"observed_at":"2026-08-07T18:41:24.056208Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.044475Z","title":null,"venue":null,"work_id":"ed88bd8d-4579-4037-a8a6-45975273f120","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.608033Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:051a2cf23a7b72125293cb09382bb459c728131828377a0d1862be7fbe4e36fd","observation_id":"8fb659d8-5a8d-4233-9a3f-ea4f74b11212","resolution":{"observed_at":"2026-08-07T18:41:24.047479Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.833638Z","title":null,"venue":null,"work_id":"c01d58ee-07f3-429a-bf0b-907996bb03c1","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.651315Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:936504b7fc2721e4b824a09ccce0ca4fed11b80ef31fe9b264152d041a492a89","observation_id":"aad569a8-0382-4428-a589-11f43a8b3ae3","resolution":{"observed_at":"2026-08-07T18:41:23.836848Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.823314Z","title":null,"venue":null,"work_id":"ecbd8927-6838-4624-9ae1-6341b79f9865","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.654879Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:81f46481a3603e211f38682c6b479e75af71fadeca4fc84d75a28b55678be072","observation_id":"aa87fd5f-b662-46e2-9ed1-3cdf66d2d94e","resolution":{"observed_at":"2026-08-07T18:41:23.826430Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:24.017546Z","title":null,"venue":null,"work_id":"84831808-bc6a-4c13-a4cc-3cd4c45c9cc1","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.618242Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:ab0a3be52881c63b97fda5a0319575adf7c3d728d43b98efdbd75e2825d936d6","observation_id":"3faafb96-d1c8-43c2-9856-88fe07f42b9a","resolution":{"observed_at":"2026-08-07T18:41:24.020752Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.916187Z","title":null,"venue":null,"work_id":"09fd9ffb-1371-45c2-85d2-7ec8508abe56","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.621675Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:86e04f69b26d00c00e636b58d4cbde0ff02e48b0385dfe451510d9e9f0c3485a","observation_id":"c91f7402-89b5-4ae1-8be5-ba24f8db9ebb","resolution":{"observed_at":"2026-08-07T18:41:23.935688Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.907956Z","title":null,"venue":null,"work_id":"ab29fb9b-1ced-4b64-b6c0-35d37275040d","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.625106Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:8f6533bf5f284ed5ad93d6fdf70cd87f18e82d8a75e683645fb2bb52dd59f298","observation_id":"45cb407c-1a7f-4ebc-86cd-c51f9bbed376","resolution":{"observed_at":"2026-08-07T18:41:23.910949Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.899289Z","title":null,"venue":null,"work_id":"19c66f5e-3e23-4da9-8b32-3ece44930ab1","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.628480Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:700acc8c4b25f3183aaaec2009e3fe2b41795901aea0a86203e36fdc20580d3d","observation_id":"7b2c9f6a-877d-4748-9268-1f60ca45c2a3","resolution":{"observed_at":"2026-08-07T18:41:23.902317Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.890657Z","title":null,"venue":null,"work_id":"d6236c46-c54a-4d4e-9b67-d950229ce4f9","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.631593Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:1152f27e7d44da46bc1c0bd09287eeb7bd104e4e4b4e199777543c5f9efa5001","observation_id":"5e723fe4-e5a9-4b75-93e6-a2f50e25ca62","resolution":{"observed_at":"2026-08-07T18:41:23.893711Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.881961Z","title":null,"venue":null,"work_id":"08a42f35-6663-4061-a09c-349348743187","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.634814Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:14569f6a9468acd9dce389d2085e76b2b57f82ebaad3f0df198c8cddc09bf39e","observation_id":"82906de4-ce5b-43c8-bd46-6ad311ca2dd7","resolution":{"observed_at":"2026-08-07T18:41:23.885234Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.853600Z","title":null,"venue":null,"work_id":"8bbc52a2-2e7f-416a-8607-7aca28cf0f50","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.644747Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:27ad46e774fc0dabc8b2c73fae30bd9a039d01839d4fe77ee3652bdf817aede7","observation_id":"34da093c-1ba7-4e8f-961d-acffc6dfd9c1","resolution":{"observed_at":"2026-08-07T18:41:23.856788Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.843276Z","title":null,"venue":null,"work_id":"44b2614a-4f53-4aa7-9255-5898375d56e1","year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.648007Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:e13ec2877e6b8cc6b4de41d760d0299491ec9a4fca1d89eb85481a8f146503ce","observation_id":"57148371-cf7a-440a-a46f-5650dad88d03","resolution":{"observed_at":"2026-08-07T18:41:23.846477Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-07T18:41:23.796877Z","title":"Taking any two reduces their combined value by 40% - Courses 20, 25, 3, 17, 11 overlap in content","venue":null,"work_id":"6de9d333-506f-40c5-99ec-b89cd52de343","year":2024},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.657804Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:9ba15a6d3e6ef52a8855fcee39766b054ca8d6684f5db89257bf7b64b32afd93","observation_id":"9eae714c-2b02-4a87-9ef3-04a643674406","resolution":{"observed_at":"2026-08-07T18:41:23.815928Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T18:41:23.445715Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.445715Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:a644b5d1b1f6957921227c3d824f12585650f6adf10c0225e93bc3f96f650d18","observation_id":"834873e6-21af-4491-b8fb-1b5dc1a8c58b","resolution":{"observed_at":"2026-08-07T18:41:23.445715Z","resolver_source":null,"status":"malformed_identifier"},"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-07T18:41:23.420119Z","title":"doi: 10.24963/ijcai.2022/","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":548,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.420119Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:2c498db05792e0c451ac5640f0230a7956c8cd1cd2b6530d05d37a4c9c2cd02b","observation_id":"9c0eb89b-3b76-47ab-a280-ee7e384d904e","resolution":{"observed_at":"2026-08-07T18:41:23.420119Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05905","last_updated":"2025-02-12T17:10:53Z","snapshot_observed_at":"2026-08-08T01:25:20.203363Z","submitted_at":"2024-05-09T17:01:31Z","title":"Truthful Aggregation of LLMs with an Application to Online Advertising","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05905","snapshot_observed_at":"2026-08-07T18:41:23.370803Z","title":"cc/paper_files/paper/2023/file/ 1577ea3eaf8dacb99f64e4496c3ecddf-Paper-Conference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.370803Z"},"links":{"cited_paper":"/paper/2405.05905","citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:6d35f595ca6bb2b9ae2868144423a959a3ff73f775c522ab21c7186a3ad76413","observation_id":"84812af7-34c5-446d-aab9-070385f4d057","resolution":{"observed_at":"2026-08-07T18:41:23.370803Z","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-07T18:41:23.381387Z","title":"php/AAAI/article/view/5606","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","version":1},"reference_index":5606,"source":"pdf_text","source_observed_at":"2026-08-07T18:41:23.381387Z"},"links":{"citing_paper":"/paper/2502.10308"},"observation_digest":"sha256:9b9a7b73757d6cfb9c01fca7faf01241956b0e156a9ae43a9213e41d4eacc3d8","observation_id":"27d33a1c-7c6b-4de0-ae0e-00fa186fe2cd","resolution":{"observed_at":"2026-08-07T18:41:23.381387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.10308","last_updated":"2025-02-14T17:12:20Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T18:33:06.113721Z","submitted_at":"2025-02-14T17:12:20Z","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":21,"unresolved":9,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":35},"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 10 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 3 inbound Pith citation observations for arXiv:2502.10308."}