{"as_of":"2026-08-19T08:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8137b35f83fdba0e3493384cc4ad4ba7a58506f40fc56c4bb9cf79a7aa538ea3","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:19:55.432962Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2505.06005/citation-record","integrity":"/paper/2505.06005/integrity","json":"/paper/2505.06005/citation-record.json","paper":"/paper/2505.06005"},"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-15T23:19:55.777617Z","title":"Online vertex-weighted bipartite matching and single-bid budgeted allocations","venue":null,"work_id":"a96891ad-19ff-4c01-b68a-db36ddf6414e","year":2011},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.347131Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:6b4acce0bef90dfe67772a3e152e945a32c3269ea2320fd9de038eb44d924f8a","observation_id":"e2a3648a-1c89-43bf-b864-72da32a8c5c8","resolution":{"observed_at":"2026-08-15T23:19:55.782140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.765311Z","title":"Auctions with budget constraints","venue":null,"work_id":"da0b3a8b-dc6e-4f67-818d-dcd17b680343","year":2004},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.352159Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:3820306b9da99dcd36acf587bd4e16c4647b8dad6bedd54d2672f0798db3fa35","observation_id":"44b92223-044b-4e70-9f28-3a881850fba0","resolution":{"observed_at":"2026-08-15T23:19:55.769570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.753409Z","title":"Improved approximation algorithms for budgeted allocations","venue":null,"work_id":"7c14fde6-46cf-4276-aad9-a7a909a2c599","year":2008},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.356447Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:6a44a6c74e58691a30cc6d180c30083928c899e9df2688d4bc10c381e68d693c","observation_id":"22b32377-0c98-4c67-8d64-90e22b46f71d","resolution":{"observed_at":"2026-08-15T23:19:55.757384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.738583Z","title":"Karlin, and C","venue":null,"work_id":"9f17bd94-eb34-4957-b282-d2e81de355b0","year":2009},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.360873Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:ae2bc714b1ae972079f4211853310a5d794533ce8c0585182f1ce62bcce044b5","observation_id":"93ee3c57-c8e4-4466-b745-60bac6a3c6ce","resolution":{"observed_at":"2026-08-15T23:19:55.742899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.365106Z","title":"Online primal-dual algorithms for maximizing ad-auctions revenue","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.365106Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:93170d8f503509aa62819355cbdf3d5384b2a2448b66ccfe44bd7b0c7d990052","observation_id":"e87b6b6a-f3b7-4124-b89a-5b0e6ea032a9","resolution":{"observed_at":"2026-08-15T23:19:55.365106Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:19:55.718476Z","title":"Maximizing a submodular set function subject to a matroid constraint","venue":null,"work_id":"4026ce77-4f0b-46bf-ada5-83a6f9e5b605","year":2007},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.369595Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:d14d43384878fe80772801693737b68313829637803aeda51e63d8f1b7163ef7","observation_id":"f968e587-819d-4529-bde7-a2aebe08053a","resolution":{"observed_at":"2026-08-15T23:19:55.722645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.706165Z","title":"On the approximability of budgeted allocations and im- proved lower bounds for submodular welfare maximization and gap.SIAM Journal on Computing, 39(6):2189–2211, 2010","venue":null,"work_id":"a771fcab-64b0-4094-b90c-7ebd85cf8082","year":2010},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.374171Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:80643bbcff3a881fa0267eeec24c06a8fddda2f9bcecece3439f04e5654d2e03","observation_id":"1cec820f-9c27-4c31-a369-bcd4e0c50207","resolution":{"observed_at":"2026-08-15T23:19:55.710296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.694703Z","title":"Complexity of approximating bounded variants of opti- mization problems","venue":null,"work_id":"19646d6e-5872-467d-b5bd-60499034b3f6","year":2006},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.378417Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:ef85e8e6b107158f0d80ae3fe48f44e205702ac92c4c43a328e18b42344222a3","observation_id":"6b520b71-67ce-49cf-b2e6-700b9fd3ab02","resolution":{"observed_at":"2026-08-15T23:19:55.698631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.682749Z","title":"Internet advertising and the gen- eralized second-price auction: Selling billions of dollars worth of keywords","venue":null,"work_id":"0d26b9fd-b76e-4970-91e8-8ddf7f138703","year":2007},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.382525Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:4ad5af0a80715822459e673ec5fa2fcd97608c57e07c2094c57f66b9b7866365","observation_id":"8f31b965-26a7-41b2-a3e7-ff09b0053613","resolution":{"observed_at":"2026-08-15T23:19:55.687142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.671154Z","title":"A threshold of ln n for approximating set cover","venue":null,"work_id":"5f722fdc-dc94-4631-89c9-91cd782f3dc6","year":1998},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.386355Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:56ef1d9c974ab333ec0112610516b35ff45856df5ca430d4080a2962771e7e99","observation_id":"f1a23bbe-7c6a-4034-9ad5-21ac6922c1e7","resolution":{"observed_at":"2026-08-15T23:19:55.674968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.657596Z","title":"Second-price ad auctions with binary bids and markets with good competition","venue":null,"work_id":"ecb07e90-7721-42cf-8d7a-1f535b5c482f","year":2014},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.390238Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:c79edafeaba98b21c75c0293bc9e18dcde9aa5222f333fec9f810d912ab4db05","observation_id":"3c347243-2cbf-4164-a26e-bd5ecb17865b","resolution":{"observed_at":"2026-08-15T23:19:55.662091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.644436Z","title":"Approximation algorithms for budget- constrained auctions","venue":null,"work_id":"d5973742-144f-44df-9116-152185ec313d","year":2001},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.394007Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:928a7e8f70d321f15ad9351d410fe264beb1d3bf59cc79d2ebc69129f0668ecb","observation_id":"89110138-c55a-4bbf-a141-c405f647c1e0","resolution":{"observed_at":"2026-08-15T23:19:55.648594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.632400Z","title":"An improved approximation guarantee for the maximum budgeted allocation problem","venue":null,"work_id":"63a6380c-eadc-458a-a11a-d51b905ab260","year":2016},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.398362Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:48c602c57d19e7b387253975421642bc7700f3154e5e1017d20fcb42057fcff4","observation_id":"28b66494-1dc2-4c0b-adf9-abf7e88457dd","resolution":{"observed_at":"2026-08-15T23:19:55.636475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.620706Z","title":"Inapproximability results for combinatorial auctions with submodular utility functions","venue":null,"work_id":"553277b3-846a-490d-a37d-dfdae66c6f24","year":2005},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.402157Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:7d30e8ef613ae3a222cd88f01ff93917e3f3fb1c9a6b27fb53fe3ed64e687d4b","observation_id":"6cdee20a-0e55-452f-8e6b-97d0cd742bfc","resolution":{"observed_at":"2026-08-15T23:19:55.624787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.608426Z","title":"Combinatorial auctions with decreasing marginal utilities","venue":null,"work_id":"480961ee-b90d-4dbb-bea9-3e91e7eae5c8","year":2001},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.405974Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:c6c4619b50a7a992e1fccfabe8a366810cb78337ccf7eb8110a06dc573e4251d","observation_id":"55b2dd0c-48d8-41fb-b2f5-a5ad04f1c750","resolution":{"observed_at":"2026-08-15T23:19:55.612573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"questions/3410007","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:19:55.514646Z","title":"3-regular graph maximum matching.https://math.stackexchange","venue":null,"work_id":"0cf908d7-fd52-4683-9d00-a966146022db","year":2025},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.409810Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:810d64e43cddda9f0fab78700b1035942ac4d8e4a15df4264e8169639fd94c7c","observation_id":"c48700a7-2316-480a-9e93-14f2f26d1266","resolution":{"observed_at":"2026-08-15T23:19:55.524477Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.595741Z","title":"Online matching and ad allocation","venue":null,"work_id":"3e4935b2-537f-4db9-b4d3-e14d50613bbb","year":2013},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.413561Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:e43d56a10d0b09c60b07cdb69b8ce8c90e9202b461655eb8317a5b3f527cf896","observation_id":"54ed4fc7-418c-455a-95fa-17c532bba961","resolution":{"observed_at":"2026-08-15T23:19:55.600190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.417341Z","title":"Adwords and generalized online matching","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.417341Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:c9ff5592d9b6728cd81297cfef3d05dfc7bae968332436977859f8f459724fe8","observation_id":"98887ed3-a7cb-4d0d-a285-f61ad5752cc6","resolution":{"observed_at":"2026-08-15T23:19:55.417341Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:19:55.573978Z","title":"Combinatorial Optimization: Polyhedra and Efficiency","venue":null,"work_id":"bd347019-85f3-45ab-9843-efe62ae76e10","year":2003},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.420843Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:005b48044d6fc5ef304bb7a70f342d93137e4e4ffb2309cadb28a961274d58d1","observation_id":"b316fa39-80c5-4b66-b8ff-8adab1243b16","resolution":{"observed_at":"2026-08-15T23:19:55.578300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.561563Z","title":"Budgeted allocations in the full-information setting","venue":null,"work_id":"e04d6be2-419c-4ac9-8fad-87173a25f297","year":2008},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.424741Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:a17fd66fd5936ef168ff88a44d382ca33de9082a659422a96a354ef0d27bcd6b","observation_id":"568c3bb8-28f4-4675-b27e-aee040521297","resolution":{"observed_at":"2026-08-15T23:19:55.565730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.547092Z","title":"Position auctions","venue":null,"work_id":"4fb90a74-ad3e-4561-9332-d30d1db4d6e0","year":2007},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.429279Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:5a7163d4e2e7f98320d34269e61654f5b3ec7724a538c4d465089c9815c1279d","observation_id":"2e10a168-2c85-4dfe-835b-35035a94c319","resolution":{"observed_at":"2026-08-15T23:19:55.551460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:19:55.534324Z","title":"Optimal approximation for the submodular welfare problem in the value oracle model","venue":null,"work_id":"c310df05-60ff-4794-b09b-5f303571ea78","year":2008},"citing_paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:19:55.432962Z"},"links":{"citing_paper":"/paper/2505.06005"},"observation_digest":"sha256:d418d77ca02053f7231e5b49796091fc423ac49dfb8df5e0c5366a06d5d33006","observation_id":"7a605a09-e702-492c-b3d4-4274bd57f121","resolution":{"observed_at":"2026-08-15T23:19:55.538895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.06005","last_updated":"2025-05-09T12:35:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T17:05:46.270097Z","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":22},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2505.06005."}