{"as_of":"2026-08-21T10:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d8b6b13ff80634f17ef75a29f1c5529d09a82d076829f4235b058070113c05b0","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:25:38.498028Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:29:08.158722Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T22:29:08.232404Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"cited_work":{"arxiv_id":"2508.06995","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06995","snapshot_observed_at":"2026-08-05T22:29:08.232404Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","venue":"cs.CV","work_id":"d6d49716-23da-4cc9-b4eb-55fea403297c","year":2025},"citing_paper":{"arxiv_id":"2508.06997","last_updated":"2025-08-09T14:17:51Z","snapshot_observed_at":"2026-08-14T21:09:23.343052Z","submitted_at":"2025-08-09T14:17:51Z","title":"Conformal Set-based Human-AI Complementarity with Multiple Experts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:29:08.158722Z"},"links":{"cited_paper":"/paper/2508.06995","citing_paper":"/paper/2508.06997"},"observation_digest":"sha256:f8313cba76f9edd20d0273e81de6bd1ade9981cf69c656a04bcdbc338289f49a","observation_id":"ff406d0b-d9cf-42ba-adff-140139113c80","resolution":{"observed_at":"2026-08-05T22:29:08.322890Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06995/citation-record","integrity":"/paper/2508.06995/integrity","json":"/paper/2508.06995/citation-record.json","paper":"/paper/2508.06995"},"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-05T22:25:39.460842Z","title":"Deepjs: Job scheduling based on deep reinforcement learning in cloud data center,","venue":null,"work_id":"5bfeebf1-a0fe-47a3-9b89-579793beb43c","year":2019},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.150784Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:8855ef99393267abde83230240d9653c0ddbf2c2f00a6092eeb6df89cedab0fa","observation_id":"1f20ce2b-6316-4a90-90af-101d48ea33cd","resolution":{"observed_at":"2026-08-05T22:25:39.465844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.445615Z","title":"Bin packing with linear usage costs–an application to energy management in data centres,","venue":null,"work_id":"40f2e349-804f-414d-86d9-7a195f788894","year":2013},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.156769Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b3cdb6d2f8c3b3539a498c8f39c57c4c9cdafe21cd339774958412998c107514","observation_id":"127c51b2-ee86-4fc6-92c4-5cc9442be819","resolution":{"observed_at":"2026-08-05T22:25:39.450785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.413610Z","title":"Data center demand response in deregulated electricity markets,","venue":null,"work_id":"15dc8ffc-e10b-40cf-b54f-d54ab1d3ef8a","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.167947Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:da28ab2e454ef6c3a1461fa336444cc89e46dd39a12e5475a391c2453abbc5d3","observation_id":"2ab8b117-3688-46ef-85fb-bca45c12a195","resolution":{"observed_at":"2026-08-05T22:25:39.419538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.397828Z","title":"Learning scheduling algorithms for data processing clusters,","venue":null,"work_id":"8fa69317-bedb-4187-af72-c3b8fb9ccf68","year":2019},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.272803Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:852ef5e4bc8d9364802eb35f22ddd774c7a76aa86248954a40f7d25881d44fe5","observation_id":"2cf0fa90-fca2-4a58-8990-c239eeb80c27","resolution":{"observed_at":"2026-08-05T22:25:39.402692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.382371Z","title":"Online job scheduling scheme for low-carbon data center operation: An information and energy nexus perspective,","venue":null,"work_id":"a43c4ebe-6053-4edd-9a73-efebb5914484","year":2023},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.278307Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:151c0a9128949fbde9f84e02d542aa06c768f7592a5c60999f774fdf2914a588","observation_id":"324563ec-f79d-41c9-813c-bf2dbd5682a0","resolution":{"observed_at":"2026-08-05T22:25:39.387458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.366916Z","title":"Modeling demand response capability by inter- net data centers processing batch computing jobs,","venue":null,"work_id":"48ccbf3e-1b5b-4d05-976c-8569b422e5d4","year":2014},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.283843Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b71134ccd2ac1c08d641f969acb353767f77881eeac8e78d26633fb3cebb9be6","observation_id":"093a587e-4545-40d6-9136-a7fae41ebf1d","resolution":{"observed_at":"2026-08-05T22:25:39.371880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.351486Z","title":"A two-stage framework for the multi-user multi-data center job scheduling and resource allocation,","venue":null,"work_id":"229d581e-3de3-4c4e-a44c-2d072400e5f6","year":2020},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.289223Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:9ad875eb9f078de7af76f3f68e57abfeb317b427611f40476f4d1024d272156d","observation_id":"d5095122-3f8a-4b81-8a04-85f94ed6cc4a","resolution":{"observed_at":"2026-08-05T22:25:39.356376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.335878Z","title":"Managing data center cluster as non-wire alternative: A case in balancing market,","venue":null,"work_id":"09eededd-8daf-4911-93fd-0c84c5bbf0c0","year":2024},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.294051Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:19264aa367204b80526b2512ebefdcb6e2e679b5679e3461ea84d2f8a5b5cf65","observation_id":"96cad6e0-fd4a-4cbd-8d71-8f48055f5f49","resolution":{"observed_at":"2026-08-05T22:25:39.340794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.317990Z","title":"Data center participation in demand response programs with quality-of-service guarantees,","venue":null,"work_id":"d165418d-d05e-4296-993e-55502220077d","year":2019},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.301795Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b545d8db06cf113d1e7ed829540dbba34a2569b9178035a26773ae135e848161","observation_id":"b82bac92-cb23-4055-a493-dbca61f0786b","resolution":{"observed_at":"2026-08-05T22:25:39.324428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.301955Z","title":"Emission-aware stochastic resource planning scheme for data center microgrid considering batch workload scheduling and risk management,","venue":null,"work_id":"2ac6f063-49b3-4eff-acae-52c766f68526","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.306755Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:25747b71026a537375862a2b6601443d3330d4229efad85a4be638d2d7eb06d1","observation_id":"df4ff481-1e47-48fb-9273-ff0530375999","resolution":{"observed_at":"2026-08-05T22:25:39.307239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.285434Z","title":"Energy-aware virtual machine allocation in dvfs-enabled cloud data centers,","venue":null,"work_id":"66495cdd-4a9e-4abc-a0ae-9d45ead2af21","year":2021},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.312186Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:8e37a5229dd8918a31b139f8ca8fe8b74a23b94ec3f893b61b2517adbaf9d10e","observation_id":"c2cd657c-b94b-464c-9888-895f544f9ed3","resolution":{"observed_at":"2026-08-05T22:25:39.290522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.269477Z","title":"An energy- aware scheduling algorithm in dvfs-enabled networked data centers,","venue":null,"work_id":"d2231e3f-0ee1-456f-b67f-e3da14b3621d","year":2016},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.316962Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:03b27f740f636e222b058300b86790b344c7913e99f8f4c50b89695a6a41caae","observation_id":"f24bf381-8ed8-4037-84c5-c92348f49406","resolution":{"observed_at":"2026-08-05T22:25:39.274571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.253705Z","title":"Energy and performance aware fog computing: A case of dvfs and green renewable energy,","venue":null,"work_id":"2b1c34e0-346d-4f5b-9d6e-fc6cca09a9fb","year":2019},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.321748Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:7ad79fb7006b17d765f56049f9f90798d7c95d2ca6d86ba38b1a3a3e2a98bf3b","observation_id":"5709c848-59a6-4d2b-a670-c7cf74354ba7","resolution":{"observed_at":"2026-08-05T22:25:39.258734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.238530Z","title":"Energy-efficient dag scheduling with dvfs for cloud data centers,","venue":null,"work_id":"ad47d378-6aea-41ef-b0c2-d78c7b4953b9","year":2024},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.326347Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:dec5666c8ebe325567f9843dfa357beec5644c43c605aca690870acc3f1617a0","observation_id":"58967198-1e48-4804-bdfa-0fd4545da7f4","resolution":{"observed_at":"2026-08-05T22:25:39.243334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.222996Z","title":"Resource man- agement with deep reinforcement learning,","venue":null,"work_id":"e8682f22-0d81-4a4f-b8ad-874b3ee1d18f","year":2016},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.330825Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:e8554bd22a64066b33a4b0a84c43a1d6ccdd160b9709febebfa9aca38ea2ffcf","observation_id":"a4c0412c-ce21-403d-95ca-edd6182b98fc","resolution":{"observed_at":"2026-08-05T22:25:39.228233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.205271Z","title":"An energy aware resource allocation based on combination of cnn and gru for virtual machine selection,","venue":null,"work_id":"902f8286-afe9-434a-9965-ba24ac5e9cda","year":2024},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.335516Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:85f2c746f289fba92f2cecd41dcaa395aaa2d03c535d834dccb7522e5f4dc3c4","observation_id":"426ae8ee-92ae-485c-812b-e55f71e3252b","resolution":{"observed_at":"2026-08-05T22:25:39.210227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.188659Z","title":"Energy-aware qos-based dynamic virtual machine consolidation approach based on rl and ann,","venue":null,"work_id":"4dc93e8a-9d00-42bd-9cf9-4a4d633bb134","year":2024},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.340061Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:fb1c328d2fb19c2000fd21249f75b812bb7b5a130ea92ec5e4aa05e0abb113fe","observation_id":"dfa689d0-478e-40c6-aa21-b1fbfe647a4a","resolution":{"observed_at":"2026-08-05T22:25:39.194621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.173312Z","title":"Virtual machine migration techniques for optimizing energy consumption in cloud data centers,","venue":null,"work_id":"91328d5c-9c30-4104-847a-712c715da61d","year":2023},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.345153Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:a96db67803b47ac8adfbf0bb9cd076f3c9a6f592b3c328eb0ccd78cbbbd32ec4","observation_id":"43bef59f-9275-4762-a41d-f78b86e3ff74","resolution":{"observed_at":"2026-08-05T22:25:39.178243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.157508Z","title":"Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing,","venue":null,"work_id":"6b2f7d0e-295a-40c8-a48b-61a8437ad6a7","year":2012},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.350185Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:837ab05fee1e4747dfadbe88ce1e39e06c5975671af21a92fae0e3e6c49750ea","observation_id":"9a7fbc8c-1f96-4dc8-a457-c83a5f685c70","resolution":{"observed_at":"2026-08-05T22:25:39.162573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.141285Z","title":"A survey of network isolation solutions for multi-tenant data centers,","venue":null,"work_id":"81b109e1-1091-4050-8fac-0c06253a18a8","year":2016},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.354968Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b7336b9901255581ce26362c99b116202e9a44f4052b99daa62f0df61202e59a","observation_id":"34d5444a-5af0-4cfd-bc17-d8a6b9596408","resolution":{"observed_at":"2026-08-05T22:25:39.146126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.125674Z","title":"Data center access control,","venue":null,"work_id":"b39fe74c-2b9c-45c4-b00e-1f578130bf56","year":2025},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.359814Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:82b8f97a5b54e8c5a2c04df48b204b9df60f9e51d66cbb207b99068adfbc72ee","observation_id":"8900520c-188c-408f-beff-c333f544acd0","resolution":{"observed_at":"2026-08-05T22:25:39.130388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.109505Z","title":"United states data center energy usage report,","venue":null,"work_id":"5e0902af-7fbb-43b9-a306-a0fca1aa2b7e","year":2016},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.364611Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:bd716129a192dccf8d71d3cc1037631c0e3086df5769b5a93033e989172084a1","observation_id":"104b563f-8ef0-4ff7-af60-ae73ae299652","resolution":{"observed_at":"2026-08-05T22:25:39.114670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.091961Z","title":"Carbon- aware computing for datacenters,","venue":null,"work_id":"c660639e-2842-4044-876a-0262d233ddc6","year":2022},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.369277Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:4c36c230d2d5dc9a38302879b427495e7dab2a2af1ff2a242a6141d95f162374","observation_id":"472e6a2c-a8ad-4aa0-bb2c-b4056f4a8587","resolution":{"observed_at":"2026-08-05T22:25:39.098041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.073297Z","title":"{Prediction-Based} power oversubscription in cloud platforms,","venue":null,"work_id":"be090706-e8fe-479a-872d-3e26ec698888","year":2021},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.374056Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:483a1d5f64eead96f16c5f8cc3f0ecb8378c70ab9e526e78ee2e7e2428fb9368","observation_id":"fddf847a-e00e-488e-8295-9b3db3cea358","resolution":{"observed_at":"2026-08-05T22:25:39.080022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.055212Z","title":"Precise power capping for latency-sensitive applications in datacenter,","venue":null,"work_id":"af5314c6-6f6d-47e7-bc7f-abc4fac7f1e6","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.378637Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:ecdb0e659b028c0d6c58a85a1b6277b9838abac5650de31cd10733559d2dad18","observation_id":"6e017ad1-d90f-4766-b721-7fa552afb81c","resolution":{"observed_at":"2026-08-05T22:25:39.060699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.039455Z","title":"Dynamic application-aware power capping,","venue":null,"work_id":"25645085-a9c3-436e-ba70-c85dc20fc34c","year":2017},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.383101Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:c932c24e9c4846cc4d3e1bc6f2aa2844b3214117a4f178459253f59f1142f259","observation_id":"bfc4e5ae-aa34-4950-9fac-61e039858dd3","resolution":{"observed_at":"2026-08-05T22:25:39.044573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.022100Z","title":"Understanding the impact of dynamic power capping on appli- cation progress,","venue":null,"work_id":"4fdea4ae-f3ff-4473-851e-349916e413b7","year":2019},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.387916Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b8ea796ca64da09e316530d5662416fe331f0c32d19a528f4b954f768eda5a34","observation_id":"0f5dbf34-26e2-48ae-8d4d-226281625935","resolution":{"observed_at":"2026-08-05T22:25:39.027951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.005254Z","title":"Power capping: What works, what does not,","venue":null,"work_id":"9e3f8c65-174c-408f-a7b2-319dfb3a762c","year":2015},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.392345Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:35f6dc18182e51a0a4055f659f6e9adf3c71734f7f0ea0757cee065e8722d13f","observation_id":"d6a565da-3154-48ba-a67a-de0b9178bfcb","resolution":{"observed_at":"2026-08-05T22:25:39.010406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.988676Z","title":"Classified power capping by network distribution trees for green computing,","venue":null,"work_id":"483c20cd-1aaa-416b-b76c-d42c203fcb3b","year":2013},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.396764Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:2d5b502093498f82e03d52a20eb76458e339cd9073a2c0d5b86e5158fd3e5c2c","observation_id":"fd0d18c4-551d-4f12-88b6-4e3a2f3d7980","resolution":{"observed_at":"2026-08-05T22:25:38.993952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.401586Z","title":"Power modeling for effective datacenter planning and compute management,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.401586Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:4e87d7afec68218cd7a30ebddbe608adec49871bbb45dc31a7685aeb21e29741","observation_id":"66516b1a-eecd-401e-8086-fd6126ee1163","resolution":{"observed_at":"2026-08-05T22:25:38.401586Z","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-05T22:25:38.960129Z","title":"Ai-driven job scheduling in cloud computing: a comprehensive review,","venue":null,"work_id":"dc722e3d-8607-4263-b377-4428d1497ddb","year":2025},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.406060Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:dd5baad453b02487f54594eec5427fe3e18204c0bfb03986333f305be01c20cc","observation_id":"83ca971b-5891-41fb-8f35-8f1e99e6c66b","resolution":{"observed_at":"2026-08-05T22:25:38.965975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02223","last_updated":"2024-01-04T12:15:45Z","snapshot_observed_at":"2026-08-17T18:09:59.999007Z","submitted_at":"2024-01-04T12:15:45Z","title":"A BDI Agent-Based Task Scheduling Framework for Cloud Computing","version":1},"cited_work":{"arxiv_id":"2401.02223","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.02223","snapshot_observed_at":"2026-08-05T22:25:38.683507Z","title":"A BDI Agent-Based Task Scheduling Framework for Cloud Computing","venue":"cs.MA","work_id":"e358bd74-98db-4102-88ba-a240f725fe48","year":2024},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.410580Z"},"links":{"cited_paper":"/paper/2401.02223","citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:dcae3aa037e484a922fc51af5c186bbc22b8c93a29e8db6980ed6b88d23db92a","observation_id":"f3299a60-cbea-43da-bc1a-4a6ab00a5c65","resolution":{"observed_at":"2026-08-05T22:25:38.688880Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.07274","last_updated":"2018-11-26T04:56:31Z","snapshot_observed_at":"2026-08-15T10:58:31.329286Z","submitted_at":"2017-01-25T11:52:11Z","title":"Deep Reinforcement Learning: An Overview","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.07274","snapshot_observed_at":"2026-08-05T22:25:38.415653Z","title":"Deep reinforcement learning: An overview,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.415653Z"},"links":{"cited_paper":"/paper/1701.07274","citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:7f248e1b76e5a7b16170e7ad6d565e029e70ad9efa4a2073583c31720d95f196","observation_id":"ebf2da97-8163-4225-9558-bebdd598b548","resolution":{"observed_at":"2026-08-05T22:25:38.415653Z","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-05T22:25:38.944620Z","title":"Brief survey of model-based reinforcement learning techniques,","venue":null,"work_id":"91629a5d-83ee-4fb1-9c3b-ceb77afd911a","year":2020},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.421722Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:275d645a0c1ee66e10d6c65c075c5fafd5f548bd8889e50dfad455c6c5548e88","observation_id":"598cf5ba-3379-4a2f-96b6-62071a8dba89","resolution":{"observed_at":"2026-08-05T22:25:38.949497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.928771Z","title":"Model-based reinforcement learning with kernels for resource allocation in ran slices,","venue":null,"work_id":"ba342d70-be9c-4e27-886d-6e5980b14b7f","year":2022},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.426594Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:1d179b4c973d5b6098bb2467d39f222b49a73079055c1a391c6ff0666bad11a1","observation_id":"22d1a1e2-998c-4aad-a5a5-970f224aee6b","resolution":{"observed_at":"2026-08-05T22:25:38.933986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.913050Z","title":"Reliability-aware server consolidation for balancing energy-lifetime tradeoff in virtualized cloud datacenters,","venue":null,"work_id":"9928a55d-f908-4975-941e-e698458bdd6b","year":2014},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.431414Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:96f813fa9b6a467a9dc647c5cef8da155b11f9b655ed7f554e100c3a9cf1de5a","observation_id":"5497a8a6-71aa-447d-bbed-e1b2abef1cb6","resolution":{"observed_at":"2026-08-05T22:25:38.918415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.896390Z","title":"Implicit quantile networks for distributional reinforcement learning,","venue":null,"work_id":"0598df56-9658-4ea0-a58b-f98fd78bd6bf","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.436142Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:4ce48cb7954611026f688931864855ca940191819b59cb71cb9233c0109e7fd2","observation_id":"c0e9acf4-cfe5-4caf-a2e6-6682584b5c04","resolution":{"observed_at":"2026-08-05T22:25:38.902079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.878379Z","title":"Load balancing on cloud analyst using first come first serve scheduling algorithm,","venue":null,"work_id":"b5f16023-18f9-422f-8eda-5d6fe4127d2f","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.440956Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:467f9e0b1b9a06fc4fcda54de80acb5c11413e82611a36341c6829c6f2e5c828","observation_id":"51cc8d8c-f875-4ace-95ec-44fce5bd72ca","resolution":{"observed_at":"2026-08-05T22:25:38.885055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.862138Z","title":"Fair scheduling with tunable latency: a round-robin approach,","venue":null,"work_id":"ed822d4e-ed6c-4709-a6d1-09fb9340e15e","year":2003},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.445598Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:7414854eba7c804c741704d2ef961c6d8caa8ea603dd858ab482692d7c94d593","observation_id":"8bfe9ef7-2ca8-492c-b57f-c2bcbbde7ad7","resolution":{"observed_at":"2026-08-05T22:25:38.867105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.844838Z","title":null,"venue":null,"work_id":"eba9d4e5-5b50-4a4d-8d4c-0f3fd6fb158a","year":1998},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.450102Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:a4924ea8fd161966018120ccaebfd1ab310c9cadc1308b4a58d5e45fdc02843b","observation_id":"386d230d-96fc-48c6-af78-26761eaba166","resolution":{"observed_at":"2026-08-05T22:25:38.850280Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.827386Z","title":"Trace 201708,","venue":null,"work_id":"86d26233-0f8a-48ca-8fbd-e80259b07658","year":2017},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.454916Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:52dafc308246174bbd98946b3e74d84e75b7887c499c43d1cb59327ee22301ce","observation_id":"f8a65ebd-1755-469b-a48b-3593bba68394","resolution":{"observed_at":"2026-08-05T22:25:38.832497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.810823Z","title":"Power consumption estimation models for processors, virtual machines, and servers,","venue":null,"work_id":"4fe7b217-0669-4034-b3d7-5860c8c58448","year":2013},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.459537Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:8350693603c11ea2278f8a8b4c55244a7ed41dd4299351c9b6368e105fb24da1","observation_id":"dea6cc55-2903-4dc3-8c09-5be4b840991a","resolution":{"observed_at":"2026-08-05T22:25:38.815906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.793395Z","title":"Markets and operations,","venue":null,"work_id":"de67f20f-8468-4871-8e32-0f74cd69ce59","year":2025},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.464622Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:53a819c30528e31a2c83e913533280a9a86e612a255b4909552359e3752e597c","observation_id":"c95d5fdd-db74-4346-84c0-f41ce5227320","resolution":{"observed_at":"2026-08-05T22:25:38.799319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.776705Z","title":"Sla-driven dynamic resource management for multi-tier web applications in a cloud,","venue":null,"work_id":"bfecad7a-4f0b-4535-9f8c-c5d415116b7a","year":2010},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.469384Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:0a83623663bb36ddf6044a554755c103b34454d535df849afaf0797ba096bea9","observation_id":"7a6f73af-74e6-45e9-a3e3-c5d09c34cba8","resolution":{"observed_at":"2026-08-05T22:25:38.782502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.760205Z","title":"Analyzing alibaba’s co-located datacenter workloads,","venue":null,"work_id":"81781e3a-0527-4d9d-8efe-1c585b56bcc6","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.474020Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:31932f625eb2871c0031d1bb6f93be218b1569f1fc6f21c83875a2a66c90f7ca","observation_id":"204d1e13-49f5-4381-85aa-317abe330cd9","resolution":{"observed_at":"2026-08-05T22:25:38.765287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.478845Z","title":"Learning latent dynamics for planning from pixels,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.478845Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:44f05d4caa386d4e6f11d897f196f6469efe5bac5e5dc1b0d69fcd9b2b8e4b11","observation_id":"2e49197e-1dce-44ed-8bc7-41a6ae7db99f","resolution":{"observed_at":"2026-08-05T22:25:38.478845Z","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-05T22:25:38.732947Z","title":"Value-aware loss function for model learning in reinforcement learning,","venue":null,"work_id":"262ce59b-f23e-4516-80d2-b381cc05c858","year":2016},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.483782Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b26f1017548fdac6be5353773f9c5f8efaef320a60571cca4332dd79551e7b9b","observation_id":"586ce16b-db04-4108-a2f3-30e135e094e4","resolution":{"observed_at":"2026-08-05T22:25:38.738625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2405.00009","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:25:38.635861Z","title":"Service level agreements and security sla: A comprehensive survey,","venue":null,"work_id":"2435a8da-270d-4962-9c0f-ed84a943b195","year":2024},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.488954Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:54c5a1c3575b1c094419cf597a13c6902248977bcdbb4f54f3e6bc285715d776","observation_id":"5649f022-a54c-429e-ad7a-6c33e46aedb5","resolution":{"observed_at":"2026-08-05T22:25:38.646946Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.716545Z","title":"What is an sla? best practices for service-level agreements,","venue":null,"work_id":"614f8c75-1d79-4839-bfd3-62e50ce8135b","year":2017},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.493598Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:97912126d0db3db80098a2070a2c84096705a545c03b31e89571ca3e1d9543a0","observation_id":"338b93ce-aaed-4194-bf9d-8b6199ab53c4","resolution":{"observed_at":"2026-08-05T22:25:38.721491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:38.700444Z","title":"Iterative value-aware model learning,","venue":null,"work_id":"2ea3b5b3-486e-44bc-9134-ddb44a8197b2","year":2018},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.498028Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:b1ec67e5df926529221c88c942318e13d20739160c892d53a99b9efe673e5202","observation_id":"73a838cc-3a26-48ee-bc5d-db428541a4b7","resolution":{"observed_at":"2026-08-05T22:25:38.705420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T22:25:39.429765Z","title":"Springer, 2013, pp","venue":null,"work_id":"70dacaa9-cddd-4cd3-9a2f-5e6b2be46697","year":2013},"citing_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-05T22:25:38.162798Z"},"links":{"citing_paper":"/paper/2508.06995"},"observation_digest":"sha256:478edfebbf0a97e71043698cab2b275f7419294b664598de0b46d329a5e088db","observation_id":"237b0bab-48cb-499d-9a9e-97c5bf9280b1","resolution":{"observed_at":"2026-08-05T22:25:39.434693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":45},"total_outbound_references":51},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 1 inbound Pith citation observation for arXiv:2508.06995."}