{"as_of":"2026-08-19T11:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bdc49f259afcfe09681e71ce230001db415306d236d5d6f21d4bcdaa6c21e32","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:37:53.734217Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2608.07674/citation-record","integrity":"/paper/2608.07674/integrity","json":"/paper/2608.07674/citation-record.json","paper":"/paper/2608.07674"},"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-11T00:37:54.198404Z","title":"Bandyapadhyay, T","venue":null,"work_id":"b7b8efb8-bf59-4fe1-8ca4-b4f3d59b9d74","year":2025},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.603428Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:1bda3508219f7f4cf9af1c962370ab96949b1867a1558603cce0158a166c6484","observation_id":"5386c1de-e561-415e-a165-5991f3975428","resolution":{"observed_at":"2026-08-11T00:37:54.203776Z","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":{"arxiv_id":"2405.10378","last_updated":"2025-02-27T16:29:30Z","snapshot_observed_at":"2026-08-18T18:28:17.325975Z","submitted_at":"2024-05-16T18:17:44Z","title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","version":2},"cited_work":{"arxiv_id":"2405.10378","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.10378","snapshot_observed_at":"2026-08-11T00:37:53.773330Z","title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","venue":"cs.DS","work_id":"31afe89f-4a98-4f20-ae18-f87e066f1c94","year":2024},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.610226Z"},"links":{"cited_paper":"/paper/2405.10378","citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:1788afe96cb10abf8f2d80ea987b7f67d7b69515484b020b804c3e5e40fe4331","observation_id":"5a20c4aa-8a93-48be-8f78-568ca0251bb0","resolution":{"observed_at":"2026-08-11T00:37:53.781801Z","resolver_source":"local_arxiv","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-11T00:37:54.181020Z","title":null,"venue":null,"work_id":"ce5a1abf-0137-4aeb-b156-a82f1a3a0c11","year":2019},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.616813Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:505f466a65ff91d8c7851564d7a283c00f0565f70fd2d854940fea54c810d241","observation_id":"b4ffe34b-90c4-4947-9f81-0e38b782c7d5","resolution":{"observed_at":"2026-08-11T00:37:54.186570Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:54.164387Z","title":null,"venue":null,"work_id":"30ecfa4f-ea45-47e8-ab5f-ceda96b0e074","year":2019},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.622664Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:448e0e627b0780fb8099dda9b1c6b834cb41d630309e402edb1599502d0ececd","observation_id":"5c4f9de0-51a5-49a9-8e92-51b43db39609","resolution":{"observed_at":"2026-08-11T00:37:54.169681Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:54.147062Z","title":"Chen, Z.-Z","venue":null,"work_id":"b6a97fca-8710-4dd6-b4cb-e8ff2e483d01","year":2021},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.629845Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:e51a5a29b0fc2634632ba0550d394f29676621c58952116560b54ff264131371","observation_id":"756a113e-3196-4494-9fe6-87291b30c526","resolution":{"observed_at":"2026-08-11T00:37:54.152910Z","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-11T00:37:54.130625Z","title":null,"venue":null,"work_id":"7f4805db-3ec3-44c3-b250-5d273ec65f80","year":2009},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.635934Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:bbd0a9429ce081cf410a6ded7c5461f53cc92e18545f3197f110f0b1ba2fc0a6","observation_id":"3b6d58ee-9ca6-4bb9-bf43-6f159c3280c8","resolution":{"observed_at":"2026-08-11T00:37:54.135796Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:54.113160Z","title":"an improved randomized approximation algorithm for maximum triangle packing","venue":null,"work_id":"de1ab749-3e97-40e3-8347-7c59d6f94b3b","year":2009},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.642693Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:589765271487abf3f2dba0d0f122b50a5ff55426e0f9430a48619ef6e2d6cc46","observation_id":"5313c623-2d1f-442c-aecc-2a3de06794f6","resolution":{"observed_at":"2026-08-11T00:37:54.118885Z","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-11T00:37:54.096450Z","title":"Chierichetti, R","venue":null,"work_id":"ac1ae95e-d8e0-4bdf-8275-12cce058f76a","year":2017},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.649115Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:056a1ce4aafa17fbf98722eb035e3e89519b49817e806b4f0308435b98a7d101","observation_id":"d6f0a9bc-7423-47e2-a062-8768e35f57da","resolution":{"observed_at":"2026-08-11T00:37:54.101604Z","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-11T00:37:54.078628Z","title":"Chleb ´ ık and J","venue":null,"work_id":"3f747711-72e0-44b4-853f-19af354eff44","year":2006},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.654452Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:779af0733e64996518bce06ec7b9d288fb7a4a70d0fd9dd85dd37eadfe5403d0","observation_id":"80073428-b407-4da9-bd41-478d36aa05a3","resolution":{"observed_at":"2026-08-11T00:37:54.083943Z","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-11T00:37:54.060448Z","title":null,"venue":null,"work_id":"e4f0d601-bd94-46f2-a34e-b29551047cf6","year":2013},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.659670Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:419ffc171d7cc2cdf97abb9af23d1bf1f4012a250a245d776919f4baf3ec73e1","observation_id":"521238a9-e77f-4f9c-a3f0-51fe6e8cf497","resolution":{"observed_at":"2026-08-11T00:37:54.065830Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:54.042363Z","title":"Dickerson, S","venue":null,"work_id":"55e6a92d-6f85-433e-aa2a-2c29538c10b8","year":2025},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.665066Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:53cc26d7cf8a2c4fb3f4f730e42707901354c2d677e62713c82614e8a00af390","observation_id":"8b0d94b2-1a9f-431a-8abb-3e6065e05ead","resolution":{"observed_at":"2026-08-11T00:37:54.047697Z","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-11T00:37:54.025546Z","title":"F¨ urer and H","venue":null,"work_id":"81eb7b30-4760-42e6-b1de-8cb1ec6bdf65","year":2014},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.669907Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:d9d01f991cf9be68c284421f328854a69721427347909d7a0220c87b51ac465f","observation_id":"e780959b-46c1-46d0-9d17-2a88266138ea","resolution":{"observed_at":"2026-08-11T00:37:54.031009Z","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-11T00:37:54.007557Z","title":null,"venue":null,"work_id":"7993409c-ea11-40ff-999c-df17f24bc8be","year":1976},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.675015Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:ca79834b3b3c34a8bd57183c57e8390756b18bae8152f052f2c4c62d2ae9a254","observation_id":"432138bf-09f4-4c9c-9e7c-44793ed3d8a0","resolution":{"observed_at":"2026-08-11T00:37:54.013012Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:53.990122Z","title":null,"venue":null,"work_id":"5d44ab0f-8975-4121-8aa9-30f9f616f48a","year":1983},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.680251Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:0021015145996ab73d3ade2c6483494b06c06630b7e4bace9d481884ef137a57","observation_id":"12f9ad2f-3d70-4717-bc36-091b2d4c3835","resolution":{"observed_at":"2026-08-11T00:37:53.995211Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:53.973294Z","title":null,"venue":null,"work_id":"2c4d85e5-f513-4fb9-8f01-0c1d682525f6","year":1979},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.685260Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:a88c26b42ec91d76ea71183e455af8274ff98b623e337da9e6fcc34f13d9f1bc","observation_id":"da8d4dc1-ff44-4009-a6b6-81ae5f302ca1","resolution":{"observed_at":"2026-08-11T00:37:53.978449Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:53.955874Z","title":"Hassan and S","venue":null,"work_id":"7962db56-2f43-4d3e-b18e-1777818fec5c","year":2006},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.690330Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:c4e8ebc1c9f7db1268b84b4fb020bb13e275f3e61ebdd62b0cc03e856b628483","observation_id":"a800c2a2-f773-4364-aebe-86581ec5f155","resolution":{"observed_at":"2026-08-11T00:37:53.960948Z","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-11T00:37:53.939050Z","title":null,"venue":null,"work_id":"60ea0adf-a082-4def-b32b-46c22b14c7c4","year":1991},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.695206Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:498b21525ef661b5566dd52b7bf97774f69cf2c376350269ecc617f07bef1e83","observation_id":"b41bc7b3-5313-40cb-be17-0f1caec11274","resolution":{"observed_at":"2026-08-11T00:37:53.944162Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:53.921945Z","title":"Micali and V","venue":null,"work_id":"7d670c0e-7f7a-4026-a03c-ed2676d028a9","year":1980},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.700091Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:bc86a73d6e8d9756879c1b89c57c6106e82cd5cb07f609bb98f86f9bc291a03f","observation_id":"3b8f5631-5cd0-4be9-be8d-ac183356bf62","resolution":{"observed_at":"2026-08-11T00:37:53.927256Z","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-11T00:37:53.903975Z","title":"Bagheri Nezhad, S","venue":null,"work_id":"d74808d1-2687-4926-9782-eb206298ab76","year":2025},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.704874Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:d4f51fa07c52a718bf114af38bad9adab31421ceb45f4cce1210b55279842c2b","observation_id":"08955e8c-8fdf-4a91-8a99-aafc447435ba","resolution":{"observed_at":"2026-08-11T00:37:53.909655Z","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-11T00:37:53.884630Z","title":"Tanahashi and Z.-Z","venue":null,"work_id":"85558a54-643f-46ff-aa9c-68d1950fdde5","year":2010},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.709553Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:dc1bbc66c00a875023573907f2836604f7e84d8add298d69d6e30a499d30d710","observation_id":"4cf5e729-9440-4d53-a4ca-c5f66da793c6","resolution":{"observed_at":"2026-08-11T00:37:53.889966Z","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-11T00:37:53.864934Z","title":"Thiery and J","venue":null,"work_id":"4d1750ce-dd04-417c-8f47-2886dc081a92","year":2023},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.714481Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:aad78b49a92ce4dadb220bbf313e34a6affd59106ad7f0cb49b624d57190a319","observation_id":"7f91f7b4-e1b1-405f-a4d0-018f2e3a0fc5","resolution":{"observed_at":"2026-08-11T00:37:53.871163Z","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-11T00:37:53.847482Z","title":null,"venue":null,"work_id":"bfc6a732-00f4-44a0-ab3b-d9f237e47e2d","year":2013},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.719338Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:415b02fb5a278b1c74c3218fe5033834af1fd8beda69d7d269888dcb9509dca8","observation_id":"382ee5a6-4e51-4b43-a2a6-703a5623cacd","resolution":{"observed_at":"2026-08-11T00:37:53.853084Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T00:37:53.829415Z","title":"van Zuylen","venue":null,"work_id":"59dd74ff-1477-4f9b-a89f-4f9e76dbaa6e","year":2013},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.724258Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:813dd0e012113bae2e036f2a6b7844a08d68b5bc6e7b4ce2af0b7d43b5a0dbd2","observation_id":"64fbb1a8-a8eb-40e5-8764-dff94881bb87","resolution":{"observed_at":"2026-08-11T00:37:53.834885Z","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-11T00:37:53.811413Z","title":"Williamson and D.B","venue":null,"work_id":"c297213d-2e09-43eb-8403-5c6608661dd2","year":2011},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.729236Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:61c11b18194aea2e9f1f0d414e10fc88da66ad5465e6607e90f18fc4143f5f48","observation_id":"8fea10ec-2e4e-4699-b16f-84ed89258ed6","resolution":{"observed_at":"2026-08-11T00:37:53.816517Z","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-11T00:37:53.794436Z","title":"Zhao and M","venue":null,"work_id":"6a12b67d-fa56-48fa-905a-51bf01861243","year":2024},"citing_paper":{"arxiv_id":"2608.07674","last_updated":"2026-08-07T18:01:30Z","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T00:37:53.734217Z"},"links":{"citing_paper":"/paper/2608.07674"},"observation_digest":"sha256:79cd9ac23a723023e25c484da7113bdc3fc06ff5bbdcc9bdd89c0d8be0bb6ae6","observation_id":"55f18096-a332-4385-8633-68d22c741d02","resolution":{"observed_at":"2026-08-11T00:37:53.800045Z","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":"2608.07674","last_updated":"2026-08-07T18:01:30Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T22:26:30.678702Z","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":15},"total_outbound_references":25},"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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.07674."}