{"as_of":"2026-08-11T07:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:459dbd805be0d95c3517d17d860e29b2d05a29e98b928f49a906e65aa694de0e","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:18:34.244695Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.15798/citation-record","integrity":"/paper/2505.15798/integrity","json":"/paper/2505.15798/citation-record.json","paper":"/paper/2505.15798"},"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-07T15:18:40.657544Z","title":"https://huggingface.co/Dolphin-2.1-Mistral-7B","venue":null,"work_id":"299bf8dc-aa95-4b8c-86ab-aaab54e83865","year":2025},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.265703Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:138f7e752c83553090def64d675e07473236d26b91987f932f3885b090db2918","observation_id":"7a1b1e06-07cb-414b-9fa7-47714864649c","resolution":{"observed_at":"2026-08-07T15:18:40.771043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:40.447237Z","title":"https://huggingface.co/MetaMath-Mistral-7B","venue":null,"work_id":"a8717a50-e4f6-4962-9442-3514a8aae261","year":2025},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.375546Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:b1fc5ad3775f7ff500ff8809abf3621513d50c9db77293e50461b4713e10e006","observation_id":"ad699ec8-9f1c-4bf9-8263-62e721f746a2","resolution":{"observed_at":"2026-08-07T15:18:40.544623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:40.228606Z","title":"https://huggingface.co/ Speechless-Code-Mistral-7B-v1.0","venue":null,"work_id":"aec416c5-17ef-44ee-a9c4-fdc7c7c32c2d","year":2025},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.468867Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:3b11756dc83b0d607457f6d65407d67dd7b8db8d1ec5b2497a4d96c62656bc66","observation_id":"b101b89c-2056-49da-af86-9ce95e54f122","resolution":{"observed_at":"2026-08-07T15:18:40.312150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:40.012387Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"98bc9eca-2c2c-42aa-a7ff-e91a6f3bb7da","year":2025},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.588921Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:88894639ecb8ac1eff9f9f223c758957d305b3da3d98af70faece09eb7a9041f","observation_id":"58af553b-51a5-49ed-b2f8-0c91d7d01f1a","resolution":{"observed_at":"2026-08-07T15:18:40.132515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11216","last_updated":"2025-02-28T07:54:28Z","snapshot_observed_at":"2026-08-07T13:53:53.520863Z","submitted_at":"2021-10-21T15:50:05Z","title":"User-friendly introduction to PAC-Bayes bounds","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.11216","snapshot_observed_at":"2026-08-07T15:18:29.725760Z","title":"User-friendly introduction to pac-bayes bounds","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.725760Z"},"links":{"cited_paper":"/paper/2110.11216","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:e5ae8800abb725a33744a68528d863ca818ac3b083d5dd39f6a3f33d930d8e67","observation_id":"eea5609d-508c-4df0-9e96-cb3c38f166fa","resolution":{"observed_at":"2026-08-07T15:18:29.725760Z","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-07T15:18:39.837656Z","title":"SemEval-2019 task 5: Multilingual detection of hate speech against immigrants and women in Twitter","venue":null,"work_id":"6d9e3b84-a8f1-4d5c-b186-b5c390890344","year":2019},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.863805Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:25f83499730583bacfe3f6a5a765d4179b4424a3338b5e15b8381c4e7a50b5a4","observation_id":"dfd603ff-4808-4fa6-8ec0-7552304f8bb0","resolution":{"observed_at":"2026-08-07T15:18:39.952333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:39.556657Z","title":"Remote sensing image scene classification: Benchmark and state of the art","venue":null,"work_id":"fa9cf0b1-bdd5-469e-b78d-0e0baedc58fe","year":2017},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:29.995017Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:89b95f39a016c1bcf890c39c59baed37bc1c13b8286dc79b0e5967f11b015345","observation_id":"5ebed87a-486e-4bb5-a90e-48ce3ae8b863","resolution":{"observed_at":"2026-08-07T15:18:39.707961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:30.129743Z","title":"Describing textures in the wild","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.129743Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:2167a5506d4d4587a5e30e13d7eaf74f524ef583c0e9e7336436bf577b2a50f9","observation_id":"e9bcdc5f-0f0e-4481-9b22-ccf6bc1f1285","resolution":{"observed_at":"2026-08-07T15:18:30.129743Z","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-07T15:18:39.344625Z","title":"Model breadcrumbs: Scaling multi-task model merging with sparse masks","venue":null,"work_id":"13fdfd29-2e06-4c7b-a3f7-c235271ee943","year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.267564Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:9db8e9e7cbf6e5b25ace79ff49f09d5d15fd06f8ce6b128ffa8917c6852c93e6","observation_id":"92156348-2d27-4937-832a-cc9767c593d6","resolution":{"observed_at":"2026-08-07T15:18:39.456434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-08-10T01:12:16.468283Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-07T15:18:30.380006Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.380006Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:ccaf7f71975a28eeb6e8313d6e753c3dc0eb92cc5faa858d8d912d8b13f116eb","observation_id":"6502cb83-d36a-431b-a7fb-5ed1710579c0","resolution":{"observed_at":"2026-08-07T15:18:30.380006Z","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-07T15:18:39.128565Z","title":"Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data","venue":null,"work_id":"2e9282cf-7a55-49d3-a3f7-0dadbd883f00","year":2017},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.500460Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:d12840940b9e3c8430df0aae5d7d1f2a2ba1b7892eaa4c96b7ee39fd77ff8754","observation_id":"eb4c1c01-1acf-43ab-a7a5-16b4de28b405","resolution":{"observed_at":"2026-08-07T15:18:39.236751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:38.891394Z","title":null,"venue":null,"work_id":"b0ff075d-a6ca-406a-b19d-6fe1b4844675","year":2021},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.553604Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:7e56bfbb27f9f356124cd23ac716196985fbcd34dc850cfef9883eafbee44b82","observation_id":"6070768b-24ad-4c8f-98c0-1002273cea89","resolution":{"observed_at":"2026-08-07T15:18:39.016924Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13257","last_updated":"2025-01-09T22:21:56Z","snapshot_observed_at":"2026-08-09T03:38:22.081528Z","submitted_at":"2024-03-20T02:38:01Z","title":"Arcee's MergeKit: A Toolkit for Merging Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13257","snapshot_observed_at":"2026-08-07T15:18:30.678778Z","title":"Arcee’s mergekit: A toolkit for merging large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.678778Z"},"links":{"cited_paper":"/paper/2403.13257","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:636657191439ccd0b4f8b6d5ddf281ad4cb7029e0c7cac1e48aef74c516fca1a","observation_id":"f813858e-b38a-41ff-8888-5b48f64b5b94","resolution":{"observed_at":"2026-08-07T15:18:30.678778Z","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-07T15:18:38.679469Z","title":"Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification","venue":null,"work_id":"030cbd60-7952-41d4-b238-6272c5baf74d","year":2019},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.784584Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:aafb8ecf960c1162332c3032316a060a8722d466c2cb12154d792125b45a19f2","observation_id":"b93f8573-21a6-4819-9737-b9f93fe59496","resolution":{"observed_at":"2026-08-07T15:18:38.773251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-07T15:18:30.877098Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.877098Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:3789bb2492d8d51a640badae3e0531869e399cad72ea67a454c978e0c63e3451","observation_id":"8a3d5f87-0d50-4cc8-a639-1acec00dbb13","resolution":{"observed_at":"2026-08-07T15:18:30.877098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13269","last_updated":"2024-08-19T03:31:19Z","snapshot_observed_at":"2026-07-06T15:58:08.777051Z","submitted_at":"2023-07-25T05:39:21Z","title":"LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Composition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13269","snapshot_observed_at":"2026-08-07T15:18:30.942304Z","title":"Lo- rahub: Efficient cross-task generalization via dynamic lora composition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:30.942304Z"},"links":{"cited_paper":"/paper/2307.13269","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:88891b165402088eab5de0c013aa804274f0b4e04598f1fec279eece7a4b809e","observation_id":"0187f126-abfb-43a7-a20d-0a351751c25e","resolution":{"observed_at":"2026-08-07T15:18:30.942304Z","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-07T15:18:38.487851Z","title":"Editing models with task arithmetic","venue":null,"work_id":"0cc5a8c4-9a00-4865-b61b-75ded80857ff","year":2023},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.053188Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:505a0c6db695d5ba981057b251d58d47d60264375c107bbc93d313ac87793f7a","observation_id":"17aec79c-8d6f-4f7b-aa63-356a67db9f2e","resolution":{"observed_at":"2026-08-07T15:18:38.589221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-07T15:18:31.153601Z","title":"Mistral 7b","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.153601Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:54413bd90e1b253ef74e00c93b9c30a8b0825dec20025922947573fade9cecfb","observation_id":"274b4db5-8710-40e5-a14b-6547ab57afd6","resolution":{"observed_at":"2026-08-07T15:18:31.153601Z","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-07T15:18:38.326504Z","title":"Fantastic generalization measures and where to find them","venue":null,"work_id":"d0431cd6-5a1a-4f32-a260-896de115bd3c","year":2020},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.283372Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:bcb2c4bba02fce072e115980ac1be846be52c0f10f071d8abcb4b0ae00f2fcf6","observation_id":"620c2983-42d0-4d03-9577-88b7195e9c27","resolution":{"observed_at":"2026-08-07T15:18:38.411559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:31.393015Z","title":"3d object representations for fine- grained categorization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.393015Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:2016774451a627b68e7fa7928dd41448cbfadd08103914e687a828b6054fa167","observation_id":"2e7c3a83-f30a-4fbd-848e-4d49a5b6b59e","resolution":{"observed_at":"2026-08-07T15:18:31.393015Z","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-07T15:18:38.039391Z","title":"Tutorial on practical prediction theory for classification","venue":null,"work_id":"88b0100e-4098-4354-b780-dd30fadb1d9b","year":2005},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.514898Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:d9b8b2b32ec3156912138625ed0128e950fca40056d8cd7db5faf09dff4e9cf0","observation_id":"5349625c-1235-4757-ae1a-4c34743fe410","resolution":{"observed_at":"2026-08-07T15:18:38.177891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:37.824904Z","title":"Bounds for averaging classifiers","venue":null,"work_id":"cc9d96db-f6f3-49a0-b0e1-cd36ffe4b8c9","year":2001},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.603971Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:ccd5fc861a4a8cbd277b47c3003a76bd1b3b064caa2cb733f8402aa9634aaf62","observation_id":"348a4607-e082-44ff-9a72-b64cd9ccd1d1","resolution":{"observed_at":"2026-08-07T15:18:37.913096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:31.678298Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.678298Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:78141b665835d83d4c24b4933e50626eea4340981a336ceac064821f7ee9d80c","observation_id":"ce52f18f-5d7c-4dd3-b1ef-fa18ac78addc","resolution":{"observed_at":"2026-08-07T15:18:31.678298Z","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-07T15:18:37.626041Z","title":"Learning new tricks from old dogs: Multi-source transfer learning from pre-trained networks","venue":null,"work_id":"aa0c30de-7693-4587-a863-063504251c73","year":2019},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.750088Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:e055dbc236377ce46afa34c478c5dec46a811bdda1f6bb794cfc67b43ab2aef8","observation_id":"26a55920-9326-45a3-9d94-9e0c971d2b9a","resolution":{"observed_at":"2026-08-07T15:18:37.715763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15698","last_updated":"2023-09-27T14:40:12Z","snapshot_observed_at":"2026-08-04T10:16:25.449869Z","submitted_at":"2023-09-27T14:40:12Z","title":"Deep Model Fusion: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15698","snapshot_observed_at":"2026-08-07T15:18:31.823158Z","title":"Deep model fusion: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.823158Z"},"links":{"cited_paper":"/paper/2309.15698","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:47b5ec0c6b274121573cee969fc76288554635b148fb9fca029bc2ebc169c457","observation_id":"001b5d8a-0b71-407f-9b32-d52c141a150b","resolution":{"observed_at":"2026-08-07T15:18:31.823158Z","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-07T15:18:37.484053Z","title":null,"venue":null,"work_id":"c6839fc5-4a05-46e8-9b56-cef263d77275","year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.873868Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:b14cea8b02af9a6e067f97be57c625bfc6e14192c2a2d49070d9e2fa64eb5c52","observation_id":"dd06c783-0a3f-4d24-bbe5-8593821a35c7","resolution":{"observed_at":"2026-08-07T15:18:37.547490Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:31.947754Z","title":"Merging models with fisher-weighted averaging","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:31.947754Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:f44c9c3b187905651f28c8e7fdd58f339aa2feffd0c09459671574074e8d1a6f","observation_id":"86ddb6f2-f69a-4603-b4ae-9a74844371af","resolution":{"observed_at":"2026-08-07T15:18:31.947754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08215","last_updated":"2023-10-12T11:04:17Z","snapshot_observed_at":"2026-08-10T16:23:39.512795Z","submitted_at":"2023-10-12T11:04:17Z","title":"Trustworthy Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08215","snapshot_observed_at":"2026-08-07T15:18:32.006759Z","title":"Trustworthy machine learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.006759Z"},"links":{"cited_paper":"/paper/2310.08215","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:f60b29edae6f76d0cfd144858d74bd87cbdf93147842dd884321ab5f50b83957","observation_id":"784ada7c-49f8-47c8-9183-54a8e37fee2e","resolution":{"observed_at":"2026-08-07T15:18:32.006759Z","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-07T15:18:37.267144Z","title":"Reading digits in natural images with unsupervised feature learning","venue":null,"work_id":"3a70ebe1-d78e-41da-a609-acca058d568f","year":2011},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.045122Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:4aac4d2ae4e1f1f745668716bcf243c0c32fefae844cedc0c7366a4db5c5c232","observation_id":"7703f498-98aa-43d8-88b1-8dd3a3baf3d8","resolution":{"observed_at":"2026-08-07T15:18:37.373231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:32.092186Z","title":"Exploring generalization in deep learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.092186Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:426415934276b06cbdf94d9cdd4a34964196cb0c4250001cff0b5b00b125e200","observation_id":"18a71b86-e904-4170-9ad8-25d4edae4019","resolution":{"observed_at":"2026-08-07T15:18:32.092186Z","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-07T15:18:37.124107Z","title":"A survey on transfer learning","venue":null,"work_id":"2d00986c-62cf-4b99-9782-d2c21c1cc2b8","year":2009},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.241353Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:9b8b6116558f5d121c191d2e79682b73fde7514c475e5b28ca1a2048072b18b3","observation_id":"4664df5d-1aa4-41ca-ac9f-5e4f2dcf2391","resolution":{"observed_at":"2026-08-07T15:18:37.192784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:36.915334Z","title":"Tighter risk certificates for neural networks","venue":null,"work_id":"5b66f99a-8f42-4e6f-be23-a87d40030057","year":2021},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.420517Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:0e53f43228c9e4d4479ab12b54d82a0cf82ccf3b1c5201d355543d9c2a1375e7","observation_id":"5c9b56a2-82f1-414a-9c4a-ea72bf946a24","resolution":{"observed_at":"2026-08-07T15:18:37.028780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:32.557897Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.557897Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:7616123bcb2c7ff161e024c2d6f643c5d4c88fc76ce71b08179d95af44647b30","observation_id":"3e8e4c91-1b32-49f7-b419-71b2997ff0e3","resolution":{"observed_at":"2026-08-07T15:18:32.557897Z","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-07T15:18:36.672336Z","title":"Rapin and O","venue":null,"work_id":"24a7ffef-0beb-49f0-b92e-483361edacf5","year":2018},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.667392Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:6589457f12722001149ea94099d77b27c7517811d5f8f0e32c35c9ec6c1d7e14","observation_id":"2cbcff26-451a-450a-9aad-f65859847ae4","resolution":{"observed_at":"2026-08-07T15:18:36.792750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07206","last_updated":"2023-12-22T16:30:43Z","snapshot_observed_at":"2026-07-06T14:17:55.154712Z","submitted_at":"2022-11-14T08:51:04Z","title":"Scalable PAC-Bayesian Meta-Learning via the PAC-Optimal Hyper-Posterior: From Theory to Practice","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07206","snapshot_observed_at":"2026-08-07T15:18:32.793198Z","title":"Pac-bayesian meta- learning: From theory to practice","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.793198Z"},"links":{"cited_paper":"/paper/2211.07206","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:d0c3361726ad2a01aeb1c032dfee1048426126ab4f94429263fd631975435f03","observation_id":"4de7a78f-0a06-4ced-bf77-6cb8ab9a05f0","resolution":{"observed_at":"2026-08-07T15:18:32.793198Z","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-07T15:18:36.433878Z","title":"Pac-bayesian generalisation error bounds for gaussian process classification","venue":null,"work_id":"3a3accf7-38cf-438d-8b22-f78e20a0f3bb","year":2002},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:32.905232Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:568b9f808e4cf01beeb21c0b3f29d0bc8ce08a2f7c333b493ccfd779b9996edc","observation_id":"34dca013-7fba-4d73-a81d-a469a7fcb033","resolution":{"observed_at":"2026-08-07T15:18:36.569637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:33.034672Z","title":"Understanding machine learning: From theory to algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.034672Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:7ddb5e7cec7f412ceb98811f97a46aa45b7ca823b6ad4edbfd7a675d55815067","observation_id":"97f00178-e29f-4d12-bbfa-87839f2f4e17","resolution":{"observed_at":"2026-08-07T15:18:33.034672Z","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-07T15:18:36.188642Z","title":"Evaluating the evaluators: Are validation methods for few-shot learning fit for purpose? Transactions on Machine Learning Research, 2024","venue":null,"work_id":"0b114366-53eb-4557-a854-b0cf8b6cfb04","year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.210749Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:079ea131ed19898f0ea23623df48a8370efee16d2b96a241e0408335ee8424e9","observation_id":"cddacdfe-66a5-4fdd-8ab4-0565c8dae70b","resolution":{"observed_at":"2026-08-07T15:18:36.305849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:35.868850Z","title":"A com- prehensive survey of few-shot learning: Evolution, applications, challenges, and opportunities","venue":null,"work_id":"fe5aabfd-0805-403d-851a-0aa536489762","year":2023},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.330349Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:e60b28ff0806a6776e7ea2ec80029d6fbe1ef7a3d37c119431676b79f8611871","observation_id":"2cdd1a5d-5ee9-451b-9a8c-c71e1c54a682","resolution":{"observed_at":"2026-08-07T15:18:36.049956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:35.616095Z","title":null,"venue":null,"work_id":"7da8fab9-2869-4612-bba5-40e22caabe59","year":2012},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.404432Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:a6b5ed4c41f648c569aaa5b24d56fe37b9e66b243199115d7db6836a5488479f","observation_id":"ecc7ca1c-ef7a-47a0-a6cc-fcaffd8ca45c","resolution":{"observed_at":"2026-08-07T15:18:35.737464Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09261","last_updated":"2022-10-17T17:08:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-17T17:08:26Z","title":"Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09261","snapshot_observed_at":"2026-08-07T15:18:33.617047Z","title":"Challenging big- bench tasks and whether chain-of-thought can solve them","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.617047Z"},"links":{"cited_paper":"/paper/2210.09261","citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:78acf9690d664a316c0e2e128866087cf0fd4a85f2ff079ae91696f6dcc49120","observation_id":"704be4bd-3a0e-43ee-a646-0fb93d97377a","resolution":{"observed_at":"2026-08-07T15:18:33.617047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:18:33.737019Z","title":"Fusionbench: A compre- hensive benchmark of deep model fusion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.737019Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:f1eaf319a6a2e9bc16691b26b19b703af4a6ea9510fe0c28a463058bf31f0fec","observation_id":"8a7e861c-2934-457c-8303-303d6b6f9a9b","resolution":{"observed_at":"2026-08-07T15:18:33.737019Z","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-07T15:18:35.344276Z","title":"Sun database: Large-scale scene recognition from abbey to zoo","venue":null,"work_id":"bfadb78d-aea4-4360-a068-5a7c0eeb82da","year":2010},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.848467Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:a9fd2cc32152f5666d1a3075e184f8a198c6de9b4397d63446a6a6073b628bbf","observation_id":"c45e0d58-7e07-4050-87f1-ed789491e8bc","resolution":{"observed_at":"2026-08-07T15:18:35.472345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:35.009141Z","title":"Ties-merging: Resolving interference when merging models","venue":null,"work_id":"ffa81a94-06ef-4efb-aebe-633d06214b0c","year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:33.987683Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:d7062102c196d83a5d8da223a4a51b9fb46b5f58e027ad6ea9d019aeb7e79d04","observation_id":"7d427dd9-a3a3-4748-8c92-11685da281f6","resolution":{"observed_at":"2026-08-07T15:18:35.184771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:34.796496Z","title":"Adamerging: Adaptive model merging for multi-task learning","venue":null,"work_id":"272ea6c4-b483-415e-991c-0515e7d8194b","year":2024},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:34.096834Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:4d904fde1d4c6e8cad999ae01503ad8b708bc05e082a1d8eb37b8a5b1df8af08","observation_id":"213deba6-b928-43d6-bf8d-3337fe62cb77","resolution":{"observed_at":"2026-08-07T15:18:34.886804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:18:34.570854Z","title":"+ Bound” indicate that we use the PAC-Bayes bound as the optimisation objective. We also provide an additional “Upper Bound","venue":null,"work_id":"24000207-18dc-4671-bc05-27d3211c89a8","year":2017},"citing_paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:34.244695Z"},"links":{"citing_paper":"/paper/2505.15798"},"observation_digest":"sha256:f2d1b4c4cbef45629544af82f43bf2930ce63ef5d26e9da010dad968416da30f","observation_id":"9ca80f36-d132-4f96-a0c4-f22dddbdf190","resolution":{"observed_at":"2026-08-07T15:18:34.701657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.15798","last_updated":"2025-05-21T17:51:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T13:00:10.927584Z","submitted_at":"2025-05-21T17:51:05Z","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":46},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2505.15798."}