{"as_of":"2026-08-08T14:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c655d359d584691b5f0768884755a09ee575200c8b7c706ac132fb72b7c999e","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T19:22:02.522858Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2512.01113/citation-record","integrity":"/paper/2512.01113/integrity","json":"/paper/2512.01113/citation-record.json","paper":"/paper/2512.01113"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:22:02.327028Z","title":"Local computation of pagerank contributions","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.327028Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:63ccbf8c4f8d1101fc3cac69aadbaa041f3deca76d1fb8c224a600f1ebc78d23","observation_id":"13bbb65d-5b27-4f72-ad7f-7f28f11f4a9f","resolution":{"observed_at":"2026-08-03T19:22:02.327028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09308","last_updated":"2024-06-13T16:42:06Z","snapshot_observed_at":"2026-07-06T18:30:28.421247Z","submitted_at":"2024-06-13T16:42:06Z","title":"Transformers meet Neural Algorithmic Reasoners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09308","snapshot_observed_at":"2026-08-03T19:22:02.331817Z","title":"Transformers meet Neural Algorithmic Reasoners","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.331817Z"},"links":{"cited_paper":"/paper/2406.09308","citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:86b8813c91de3decd6b5b52c28a5687377e0dce7c3ff6c6aabf5f3ea3261e21e","observation_id":"c31ab942-883c-4dd2-a798-90386fedc992","resolution":{"observed_at":"2026-08-03T19:22:02.331817Z","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-03T19:22:02.336272Z","title":"GraphWiz: An Instruction-Following Language Model for Graph Problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.336272Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:338d3df282f0d8fbe7d787a20b5389ad14771632db00b081b598d8e43d5b0062","observation_id":"54da12da-b4cc-43ad-9b84-84a30b487403","resolution":{"observed_at":"2026-08-03T19:22:02.336272Z","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-03T19:22:02.340445Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.340445Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:78fb6f1362ae60e5fab95bf7a8fb2a62e2c42726987791b9c5a3a0cca0e2477f","observation_id":"0ab6fb5d-be23-4307-94c4-dbd553635dd2","resolution":{"observed_at":"2026-08-03T19:22:02.340445Z","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-03T19:22:02.344298Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.344298Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:afae788e82af808215bdd9543ed752bbb06db435047905fbfff5468a9c28d9b0","observation_id":"8cf53c7c-9858-4992-8780-27f23ae9b887","resolution":{"observed_at":"2026-08-03T19:22:02.344298Z","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-03T19:22:02.348194Z","title":"Computers and thought","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.348194Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:1c6113e4d2204da21e4b6bd53a4619d2a2f3244f7f3c1ad2d8f26e9f2d9b702d","observation_id":"b35420eb-9047-4026-a04d-20648fe4f8e1","resolution":{"observed_at":"2026-08-03T19:22:02.348194Z","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-03T19:22:02.352517Z","title":"Efficiently identifying task groupings for multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.352517Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:3e82b69eeefb9016c52b24744ac21a7c8bbb09fa88b1111db8ea2655763eed04","observation_id":"6c8478e2-d252-4f54-8ea9-46d68d47babd","resolution":{"observed_at":"2026-08-03T19:22:02.352517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.11198","last_updated":"2020-11-03T19:20:22Z","snapshot_observed_at":"2026-07-06T09:14:40.956312Z","submitted_at":"2020-04-23T14:46:10Z","title":"SIGN: Scalable Inception Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.11198","snapshot_observed_at":"2026-08-03T19:22:02.356335Z","title":"Sign: Scalable inception graph neural networks","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.356335Z"},"links":{"cited_paper":"/paper/2004.11198","citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:0b2971a55036ddd93c5c1786ee43eb4ce346080a65f2d1baac7aa38c00e7f04c","observation_id":"ce30729c-07e2-4ea5-8c24-15cbe411c421","resolution":{"observed_at":"2026-08-03T19:22:02.356335Z","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-03T19:22:02.360520Z","title":"Beyond erdos-renyi: Generalization in algorithmic reasoning on graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.360520Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:49c0f4b0c02dec0e20b70e256c774e5f1a3ad437fc94fddadf900a802be06620","observation_id":"5908bc52-078b-44a1-ae64-b9b62d21137b","resolution":{"observed_at":"2026-08-03T19:22:02.360520Z","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-03T19:22:02.364190Z","title":"Learning to branch for multi-task learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.364190Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:8558ca86aaf8bf075c94f885f078862347b0dd93282b0e7319e8b6a41d634dbd","observation_id":"9e117d07-098f-42d3-b2eb-a78248fcb145","resolution":{"observed_at":"2026-08-03T19:22:02.364190Z","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-03T19:22:02.367838Z","title":"Dselect-k: Differentiable selection in the mixture of experts with applications to multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.367838Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:884ab2bd95e48fa27a78aa98567a39fa9b76a95269754e08eef144a5d805998c","observation_id":"fceb3d4a-8ad6-4290-a5a2-a41ddbe8f62c","resolution":{"observed_at":"2026-08-03T19:22:02.367838Z","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-03T19:22:02.371806Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.371806Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:a1ebade054c6b6ee511d78593b6714467d74d849d872c0b9eae1f0906a61c25f","observation_id":"eada9ac5-62c2-45c3-8cfa-097c68340af1","resolution":{"observed_at":"2026-08-03T19:22:02.371806Z","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-03T19:22:02.375596Z","title":"A generalist neural algorithmic learner","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.375596Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:3f9a04f6826503b8b8eb3b6176d985049c09e3b2fa5a698965afdabfeca3072c","observation_id":"17c6b314-25e9-43c2-9285-8f92c71591a9","resolution":{"observed_at":"2026-08-03T19:22:02.375596Z","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-03T19:22:02.379262Z","title":"Datamodels: Predicting predictions from training data","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.379262Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:17ee3be0e7a154ee012edc0b2e6ccf15f15b84895d59e17e487e0e1c1cb3f482","observation_id":"df50591b-9a41-48f4-b657-52f354b02dda","resolution":{"observed_at":"2026-08-03T19:22:02.379262Z","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-03T19:22:02.383662Z","title":"Neural tangent kernel: Convergence and generalization in neural networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.383662Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:267a7355be29bd4cb3619ba54adc79f98db933ad525d25bd3ba88cd5c3f585d5","observation_id":"eb7e3333-000a-44c3-9224-dc7cc58c6205","resolution":{"observed_at":"2026-08-03T19:22:02.383662Z","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-03T19:22:02.387352Z","title":"Extensions of Lipshitz mapping into Hilbert space","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.387352Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:8115517a56814d9dea66d2f4a207b28a723e8798745a8eada8c90f25b1a8eb82","observation_id":"b933d3b8-b3e6-48fd-b0fd-60e4156af72a","resolution":{"observed_at":"2026-08-03T19:22:02.387352Z","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-03T19:22:02.390994Z","title":"Heat kernel based community detection","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.390994Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:e815c844afe2721d9472d354628544b3a4552be45c0b03c6dc6e5841a0e527f7","observation_id":"08aff21f-9608-41ff-ae37-164856dd4915","resolution":{"observed_at":"2026-08-03T19:22:02.390994Z","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-03T19:22:02.394549Z","title":"Boosting multitask learning on graphs through higher-order task affinities","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.394549Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:de2d7178d090c7c0b5d866a087525896334fdbf209049aa9908cef9ad8f6e318","observation_id":"a408217b-1abf-4b07-b3fa-918aa01e40ce","resolution":{"observed_at":"2026-08-03T19:22:02.394549Z","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-03T19:22:02.398180Z","title":"Identification of Negative Transfers in Multitask Learning Using Surrogate Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.398180Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:9543d626faa752cfe7ea930e1e99c98df31f70944ce69d33d03458b0650c49ad","observation_id":"fa950491-5339-4439-a488-6679de30aa32","resolution":{"observed_at":"2026-08-03T19:22:02.398180Z","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-03T19:22:02.401938Z","title":"Scalable Multitask Learning Using Gradient-based Estimation of Task Affinity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.401938Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:7554971bf200ac31bdb9d9b381c372f581d4d828c8925f499735b86221e27029","observation_id":"b8d933bc-0ee4-4c44-b42f-a00c8f9f0696","resolution":{"observed_at":"2026-08-03T19:22:02.401938Z","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-03T19:22:02.405419Z","title":"Scalable Fine-tuning from Multiple Data Sources: A First-Order Approximation Approach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.405419Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:7fb34688949392df2a5926171d709fd17e657cf08300c1ca8618569904c8be04","observation_id":"d2b9cc0a-e1f4-4bf5-b3b9-ae2ef1ba5b45","resolution":{"observed_at":"2026-08-03T19:22:02.405419Z","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-03T19:22:02.408779Z","title":"Efficient Ensemble for Fine-tuning Language Models on Multiple Datasets","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.408779Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:629f9a427c55199461aa81fea16bcb103d2e7879cd062d068ee42db963e98177","observation_id":"771dcbec-d4c7-4e01-9058-ff4a2ba1c93d","resolution":{"observed_at":"2026-08-03T19:22:02.408779Z","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-03T19:22:02.412398Z","title":"Topological structure of complex predictions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.412398Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:4d56902c910d6f1907fb8181a018733c54c2fc99e831afa93d9a1be5e3daddf3","observation_id":"de7b0e83-26e6-4d53-8a10-45ff8200e00b","resolution":{"observed_at":"2026-08-03T19:22:02.412398Z","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-03T19:22:02.415938Z","title":"Fully-adaptive feature sharing in multi-task networks with applications in person attribute classification","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.415938Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:6fd4758d84df7df2b64f2652d12a79082cd9ff6c27e40911697a53caff3b9215","observation_id":"576fbd29-dd0c-49bc-b880-b9b2e938f76d","resolution":{"observed_at":"2026-08-03T19:22:02.415938Z","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-03T19:22:02.419525Z","title":"Simulation of Graph Algorithms with Looped Transform- ers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.419525Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:78aab594ac2513872fe6183b2397eb8b9ba75f110aead9ecf86d77f38941b7f7","observation_id":"1aa7fafa-95de-44ff-9e53-da347c1c71d5","resolution":{"observed_at":"2026-08-03T19:22:02.419525Z","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-03T19:22:02.423186Z","title":"Graphinstruct: Empowering large language models with graph understanding and reasoning capability","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.423186Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:780662ba5daac620519e0de5e014219c55e6459bff414c1d20d1799634b9872d","observation_id":"da7db29f-0a66-4cee-9109-579efb7562e5","resolution":{"observed_at":"2026-08-03T19:22:02.423186Z","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-03T19:22:02.426840Z","title":"Modeling task relationships in multi-task learning with multi-gate mixture-of-experts","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.426840Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:91c75a6521d01ae8ed5271b1322927f460ef624bf333d5465c20a538d266f110","observation_id":"c9b0d504-91dd-441b-a30a-1636bef1cc14","resolution":{"observed_at":"2026-08-03T19:22:02.426840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-03T19:22:02.430464Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.430464Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:11d5af66555b5616461708c791b8e705db4bfc6001f3c414c4f854ebb2933874","observation_id":"921699bc-5eec-49e9-b5b7-0b2a3de27276","resolution":{"observed_at":"2026-08-03T19:22:02.430464Z","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-03T19:22:02.434236Z","title":"Towards Principled Graph Transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.434236Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:4c8cb441655a544cc476c1eaed1b82235a3573f3c60b2f98b021e90eeb83abaf","observation_id":"d7d15a27-472a-45f9-9ea5-d49241936c67","resolution":{"observed_at":"2026-08-03T19:22:02.434236Z","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-03T19:22:02.437712Z","title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.437712Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:523c830cdb8710ba3aa63f8d62b5ac27ebc3a7be49f23dc209063bb486cb8e74","observation_id":"d91b9d59-8c3b-40e6-8e48-a31c48253e87","resolution":{"observed_at":"2026-08-03T19:22:02.437712Z","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-03T19:22:02.441793Z","title":"Trak: Attributing model behavior at scale","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.441793Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:021c5ee4f720bb271741f2b3e3119a1010581657da71b597ede807e06b4cb768","observation_id":"ee174e14-52e4-4a1d-b91b-5caa0121887a","resolution":{"observed_at":"2026-08-03T19:22:02.441793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05862","last_updated":"2024-02-08T17:51:44Z","snapshot_observed_at":"2026-08-04T14:08:07.809870Z","submitted_at":"2024-02-08T17:51:44Z","title":"Let Your Graph Do the Talking: Encoding Structured Data for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05862","snapshot_observed_at":"2026-08-03T19:22:02.445263Z","title":"Let your graph do the talking: Encoding structured data for llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.445263Z"},"links":{"cited_paper":"/paper/2402.05862","citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:dfd976c5d4c034483f0b22d51d58a62761070fb05c2cae56701b3b6fe86ec6bb","observation_id":"ee465691-ffa1-45c0-8237-8be7b0285dcd","resolution":{"observed_at":"2026-08-03T19:22:02.445263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05098","last_updated":"2017-06-15T21:38:12Z","snapshot_observed_at":"2026-08-04T14:30:44.904839Z","submitted_at":"2017-06-15T21:38:12Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05098","snapshot_observed_at":"2026-08-03T19:22:02.449224Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.449224Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:180375c12cfb47e8e8a292fa4b98ee49c0b867552052c8f2c5776ced9512c402","observation_id":"f09f4d36-ae2c-4a9c-a1ee-370b8f0b2e3b","resolution":{"observed_at":"2026-08-03T19:22:02.449224Z","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-03T19:22:02.453353Z","title":"Artificial Intelligence: A modern approach","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.453353Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:7cd063111d1765811b39e0a50694a9d77328a3956e45e44fce1fe15c5136d349","observation_id":"e45c6e58-2363-49bc-bd5b-bd2511e50bef","resolution":{"observed_at":"2026-08-03T19:22:02.453353Z","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-03T19:22:02.456868Z","title":"Understanding transformer reasoning capabilities via graph algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.456868Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:d4cfd92ea9d69a24bf2f3642392f6c9dd34160677d76c12926f70238339e9205","observation_id":"e3e26f60-992e-4f89-bf28-e5f9a8ce8ead","resolution":{"observed_at":"2026-08-03T19:22:02.456868Z","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-03T19:22:02.460629Z","title":"Grapharena: Evaluating and exploring large lan- guage models on graph computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.460629Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:bf6fbf3c20faa0462d258cd3df5dbc4bcc889edd9f0e7406060aebe324e7ba27","observation_id":"966ebc83-de13-4767-a31a-6073bd9e4bce","resolution":{"observed_at":"2026-08-03T19:22:02.460629Z","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-03T19:22:02.464191Z","title":"Graph neural prompting with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.464191Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:543dbc1d52ceac1c092c05dbaea461d6ab6fcc98e2194e991efabea3cef75c7b","observation_id":"9b00410b-6b0e-4653-96b3-2d8c5f027296","resolution":{"observed_at":"2026-08-03T19:22:02.464191Z","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-03T19:22:02.468103Z","title":"Fast random walk with restart and its applications","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.468103Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:b8d0c021a3b06768c946cfe2eb3e7f798685d9f2ddaf4471b85825f6f2031dcd","observation_id":"67c41e16-5a7d-49f8-812d-98a055d4d456","resolution":{"observed_at":"2026-08-03T19:22:02.468103Z","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-03T19:22:02.471717Z","title":"Branched multi-task networks: Deciding what layers to share","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.471717Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:a609805c77c9e8e7ebe5688f37a391d1315963213896ca3a89f53e17c1dbce25","observation_id":"6b073d0e-f57c-42fa-9b6a-0aa78b8b5672","resolution":{"observed_at":"2026-08-03T19:22:02.471717Z","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-03T19:22:02.475740Z","title":"The CLRS algorithmic reasoning benchmark","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.475740Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:32ba42e8e4ad0ac4b737077006812ec3d25e77369a8aaee44618da6c3c3be2fe","observation_id":"dfb450c8-6014-4eab-a76d-b667518f7076","resolution":{"observed_at":"2026-08-03T19:22:02.475740Z","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-03T19:22:02.479246Z","title":"Neural algorithmic reasoning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.479246Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:7a8e6d9ed74af5c85110a05a1e730f01cab6eec99d8978e9cb3d8f9c771164a7","observation_id":"18b9e9af-2bef-4ec8-8ba4-ac1e6aca0dc5","resolution":{"observed_at":"2026-08-03T19:22:02.479246Z","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-03T19:22:02.482662Z","title":"Graph Attention Networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.482662Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:e3dc6a1ec472502e4c4562ae0a50c9e66432709ef83f34a120967d6facb32a82","observation_id":"ecd3a787-ead5-455d-869f-56bd8163756b","resolution":{"observed_at":"2026-08-03T19:22:02.482662Z","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-03T19:22:02.486080Z","title":"Neural execution of graph algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.486080Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:79a5c2cbc6b348af291e4df934c89168abbb9212ac69506353afc6342f0808a7","observation_id":"ec2d1e72-6c62-4fde-b4ef-81ceaf63f377","resolution":{"observed_at":"2026-08-03T19:22:02.486080Z","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-03T19:22:02.489982Z","title":"Iteratively Prompt Pre-trained Language Models for Chain of Thought","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.489982Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:374f83c7d57c11dd587b1c27925c0e7b170b14684ab7e024e97dccd0df0a3c58","observation_id":"e5331fab-a555-4f41-b026-859a176c20cf","resolution":{"observed_at":"2026-08-03T19:22:02.489982Z","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-03T19:22:02.493604Z","title":"Can Language Models Solve Graph Problems in Natural Language?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.493604Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:51beef3d9d41f208e5b5dd3fa04b6dcdeb114515d5fa188c44a0929e0e557971","observation_id":"d6ff4cce-a060-4ebb-bf56-4f55db2e12bf","resolution":{"observed_at":"2026-08-03T19:22:02.493604Z","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-03T19:22:02.497131Z","title":"Overlapping community detection using neighborhood-inflated seed expansion","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.497131Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:df655a48d4e21129c9d96d8fa38433cb5178eaece1fdd2a4a460d14a40a4e836","observation_id":"00d91632-a0cc-432e-b686-d77ee958cd98","resolution":{"observed_at":"2026-08-03T19:22:02.497131Z","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-03T19:22:02.500444Z","title":"Understanding and improving information transfer in multi-task learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.500444Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:29380cbb3eb99f5aec5af7308b704b97196a8344b6a543a39c85c14f56176d46","observation_id":"56e336de-90da-4071-8a8f-fd61b5cbcc95","resolution":{"observed_at":"2026-08-03T19:22:02.500444Z","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-03T19:22:02.503969Z","title":"Precise high-dimensional asymptotics for quantifying heterogeneous transfers","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.503969Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:152e0ecef38e0d7cf9c18d6e9af957d067914baec1dc3cdd66a0dcac89fe9a5b","observation_id":"22de4123-8bfb-448e-beae-c5cf2b3aa616","resolution":{"observed_at":"2026-08-03T19:22:02.503969Z","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-03T19:22:02.507478Z","title":"Overlapping community detection at scale: a nonnegative matrix factorization approach","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.507478Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:29f42e08c409f7c89eea0c54493ade92cc52a38bd2f6b63b96c66661d1a9aa30","observation_id":"3aed5aaf-ead1-4b5f-b383-6217ee9cbeeb","resolution":{"observed_at":"2026-08-03T19:22:02.507478Z","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-03T19:22:02.510998Z","title":"Approximate personalized pagerank on dynamic graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.510998Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:cac5b4de30131b76720b54b18b30b2b2925ffbc14c43cf50ca219d6ea375839d","observation_id":"2c2d887c-b867-48dc-a517-2841a97d456a","resolution":{"observed_at":"2026-08-03T19:22:02.510998Z","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-03T19:22:02.514549Z","title":"Greaselm: Graph reasoning enhanced language models for question answering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.514549Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:ed4218ce121d60662be3564a3d3eb877dd9b4d096e56f00fd04b0066562f9c5b","observation_id":"6a1447d3-20da-4157-9508-f1bfa8e83e40","resolution":{"observed_at":"2026-08-03T19:22:02.514549Z","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-03T19:22:02.518142Z","title":"Linear-Time Demonstration Selection for In-Context Learning via Gradient Estimation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.518142Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:a42c8469c877e7ee3dae0c72af0b39ad32c1a331ed7b20af9663c17d3f19043f","observation_id":"cb1fdf35-df46-4c72-bf6b-84617c7a9671","resolution":{"observed_at":"2026-08-03T19:22:02.518142Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:22:02.522858Z","title":"We evaluate the error rates as one minus the average exact match across output text sequences","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.522858Z"},"links":{"citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:690562927513164b3dd74a220f82eae4fa770787720f348a4e29b86018ce436d","observation_id":"f857e533-e80e-4f09-ae43-e4e647c0418b","resolution":{"observed_at":"2026-08-03T19:22:02.522858Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":53},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2512.01113."}