{"as_of":"2026-08-14T14:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ff8ddf0379867556c88805d1033cebc3c3270db231d66ad680f89e056ecbe17","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:19:29.847364Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2508.05524/citation-record","integrity":"/paper/2508.05524/integrity","json":"/paper/2508.05524/citation-record.json","paper":"/paper/2508.05524"},"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-05T23:19:30.748085Z","title":"MS-TCN: Multi- stage temporal convolutional network for action seg- mentation","venue":null,"work_id":"c9d7b10f-da99-496f-ba3c-05e3f675d1e4","year":2019},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.640328Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:96fc9e4dfc65d2618dad21800462972bc5fe24f5f0417653a077ec19d754dfc1","observation_id":"572e275f-04bb-4f2c-86e2-cdb49e51c978","resolution":{"observed_at":"2026-08-05T23:19:30.752643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.725515Z","title":"Unsupervised learning from narrated instruc- tion videos","venue":null,"work_id":"57dfaa96-8d03-4acd-bb64-7598684b3d5c","year":2016},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.645156Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:b69cc9381e28acf6d68b6ed30b243bc8500ba522c220b5608327e8fe468ae251","observation_id":"f8fdc2cf-49af-4aef-a96a-df35139bbe1b","resolution":{"observed_at":"2026-08-05T23:19:30.730027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.705582Z","title":"How much temporal long-term context is needed for action segmentation? In IEEE International Con- ference on Computer Vision (ICCV), 2023","venue":null,"work_id":"fd73d187-318d-488b-9456-5164e97414cc","year":2023},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.648892Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:a4aea82c414ceb17c0dfce06dc0cb82eb03b98745431341dcfeadd5c3cb04ee7","observation_id":"96f459d9-11dc-45e6-a465-b463fdc9a8d3","resolution":{"observed_at":"2026-08-05T23:19:30.711367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.694169Z","title":"Opental: Towards open set temporal action localization","venue":null,"work_id":"3bb7ccab-7460-4594-b15b-f0acde413d37","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.652559Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:f13a0afab815be66516135d0437ef8f790323743a9da1ef58d2282ba515ae53a","observation_id":"e54a09be-b24c-40e1-abc8-dc53b9fd355b","resolution":{"observed_at":"2026-08-05T23:19:30.698974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.683527Z","title":"Exploiting vlm local- izability and semantics for open vocabulary action de- tection","venue":null,"work_id":"826701ca-8738-49e6-9052-001c305e82b8","year":2025},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.656338Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:cb00f01615ada00ca54b498677c248519e9624eea694a954b09a929718def0e7","observation_id":"5a3a715f-80de-4dba-bdd6-2544b4f053fd","resolution":{"observed_at":"2026-08-05T23:19:30.687116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.672079Z","title":"Unified fully and timestamp supervised temporal action segmenta- tion via sequence to sequence translation","venue":null,"work_id":"efd354b4-1c24-427c-b88d-a61d5fcf74db","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.660472Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:d2e61b8d0aecaeba92ebca430a7cdd860838048018abcc095b44c2f9a3d46840","observation_id":"8447f0c2-5e15-4d91-b3fc-60f6a09f04cb","resolution":{"observed_at":"2026-08-05T23:19:30.676653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.661415Z","title":"Quo vadis, ac- tion recognition? a new model and the kinetics dataset","venue":null,"work_id":"0400d5a6-4e01-44b2-869d-62d3fce7b53a","year":null},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.664464Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:29673153dd0de012092d2ae9d9f9c5dbb83f194eefac9b6f84192ca14784a742","observation_id":"5fc85778-d83c-41bc-a143-b510834ed142","resolution":{"observed_at":"2026-08-05T23:19:30.665336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.649957Z","title":"D3tw: Discriminative differ- entiable dynamic time warping for weakly supervised action alignment and segmentation","venue":null,"work_id":"63c0c695-409b-42e2-bb98-de9a45b2bdf9","year":2019},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.667942Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:e56da1e9a7abe18c73a19427e0e2e17fec7a7f6d529992af66fcb0279699d9f9","observation_id":"860a7c66-e282-4460-a5f6-da76a54036ac","resolution":{"observed_at":"2026-08-05T23:19:30.654679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.635672Z","title":"Leveraging action affinity and continuity for semi-supervised temporal action segmentation","venue":null,"work_id":"c4beec0c-8f13-499e-a49e-770be37c125b","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.671365Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:87ef5644cfbcee02155566b023107968499de250b2d406e863610bacc142ab78","observation_id":"19b3c718-a9a8-4914-9e24-74f663acdbe7","resolution":{"observed_at":"2026-08-05T23:19:30.640488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.623370Z","title":"Weakly-supervised ac- tion segmentation with iterative soft boundary assign- ment","venue":null,"work_id":"54c4bb23-bb90-4e46-b408-88f7ace23fa9","year":2018},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.675383Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:d8a31121a387431f22bd728199f2ae186bd5dd6817b5e4a9971c536ed87c8765","observation_id":"6dfae051-93aa-43b7-873a-fb85e263b351","resolution":{"observed_at":"2026-08-05T23:19:30.628843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.609718Z","title":"Fast and unsupervised action boundary detec- tion for action segmentation","venue":null,"work_id":"de299d79-6b33-4527-af82-ee5a85bf3fe3","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.679793Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:db1c85bc3c2b970ea8ebfd9c30b40066db6fe25f24a768404f33c0a20a11c395","observation_id":"a885190b-9722-4727-a90a-0d12af268adf","resolution":{"observed_at":"2026-08-05T23:19:30.615303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.597487Z","title":"Sct: Set constrained temporal transformer for set supervised action segmen- tation","venue":null,"work_id":"f51a8005-ca3f-4cf2-b4c1-aceb01f91fc8","year":2020},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.683662Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:580622932aac03f839fe15645d29c3f76e0818fd35307f141afc006cccc3e7cb","observation_id":"acf25b58-f53a-4a44-b60c-94009b98e730","resolution":{"observed_at":"2026-08-05T23:19:30.601377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15556","last_updated":"2024-06-21T18:00:05Z","snapshot_observed_at":"2026-08-12T23:37:18.322689Z","submitted_at":"2024-06-21T18:00:05Z","title":"Open-Vocabulary Temporal Action Localization using Multimodal Guidance","version":1},"cited_work":{"arxiv_id":"2406.15556","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.15556","snapshot_observed_at":"2026-08-05T23:19:30.160375Z","title":"Open-Vocabulary Temporal Action Localization using Multimodal Guidance","venue":"cs.CV","work_id":"bd3a4ae1-89e6-4673-a5bb-2a5112017b87","year":2024},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.687405Z"},"links":{"cited_paper":"/paper/2406.15556","citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:891b8569a5923ab64f0b77acef6b980977fb00ca751864fe73676626a04950f0","observation_id":"911e6c4f-728d-4741-a3f8-ae48377164fe","resolution":{"observed_at":"2026-08-05T23:19:30.165799Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.587410Z","title":"Im- proving action segmentation via graph-based temporal reasoning","venue":null,"work_id":"ad3a609e-3fdf-4432-93fa-056e26279f8d","year":2020},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.691247Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:4da51ef87a774d5bf2476135f190daf67cad1478d8dabc72830e392eb166a1c5","observation_id":"da12f3b9-f7fe-47b0-ba54-58962dafc11d","resolution":{"observed_at":"2026-08-05T23:19:30.591068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.576517Z","title":"Alleviating over-segmentation errors by detecting action boundaries","venue":null,"work_id":"c7571cd1-8000-45d5-9c57-5293106f86ab","year":2021},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.694485Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:50350464c7c85f496313d6296462c7f77ad5f6a8a9ddda50803b8bc65559a8d5","observation_id":"b5186c11-47c9-442e-a27c-d057486c0aa4","resolution":{"observed_at":"2026-08-05T23:19:30.580209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.564320Z","title":"Fast saliency based pooling of fisher encoded dense trajectories","venue":null,"work_id":"51987f3b-4fe7-44bd-9419-3a5f1bffeeee","year":2014},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.697777Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:e907d6f28d8cf4177ecfbde601e098e04f0eef00a088bbe3608545591078ddf3","observation_id":"4d7d1d20-6f9e-4e78-b04a-341b660a5486","resolution":{"observed_at":"2026-08-05T23:19:30.568854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.553557Z","title":"Timestamp-supervised action segmentation with graph convolutional networks","venue":null,"work_id":"048ec7cb-04ac-44c5-9c70-7a77ec4426fe","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.702128Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:98410de4675a68e352c0c5d1cabcad5ec8c24919bfdf26c528e57ee1e28d4ffa","observation_id":"441bdc0d-92c8-40d6-9d90-c0dc5e7a679c","resolution":{"observed_at":"2026-08-05T23:19:30.557513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.541077Z","title":"The lan- guage of actions: Recovering the syntax and semantics of goal-directed human activities","venue":null,"work_id":"afc6d5e2-d98a-46bf-917d-cb59e22bef81","year":2014},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.705441Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:c047ac5a627c67f31364892005119736d8df48e74a2ec4d09c2f557fc1b38fc0","observation_id":"729c4f7c-0763-41f4-a833-d2bdd26585b4","resolution":{"observed_at":"2026-08-05T23:19:30.545726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.529949Z","title":"An end-to-end generative framework for video segmenta- tion and recognition","venue":null,"work_id":"addc1663-c312-4ed5-a718-efedd5e20820","year":2016},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.709781Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:d6a9aeabfaed39a201570ff7b02df7ec030a62ff52315bc14ca7f2ee4788c241","observation_id":"faec9408-14a2-412d-b053-720ba8ba04d5","resolution":{"observed_at":"2026-08-05T23:19:30.533766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.515946Z","title":"Weakly supervised learning of actions from transcripts","venue":null,"work_id":"bd9ebcf8-df1f-4a89-8318-b100488ab05e","year":2017},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.714745Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:8980e295561fb1dcc4807fbfffa464b7920992eaccfac71356d40e860c548838","observation_id":"8c6a920b-5e45-4978-82cf-e91ff9181aa5","resolution":{"observed_at":"2026-08-05T23:19:30.522568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.503326Z","title":"Unsupervised learning of action classes with continuous temporal embedding","venue":null,"work_id":"bc741be3-8d56-4054-ad93-9fd63082dbe5","year":2019},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.719498Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:1b96c0f08a82a6a38103ed376ac2da7fba1f385f93187bc228f35f09e799e56f","observation_id":"8b15ac05-c186-4110-b967-5c3405410ea5","resolution":{"observed_at":"2026-08-05T23:19:30.507347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.491984Z","title":"Unsu- pervised action segmentation by joint representation learning and online clustering","venue":null,"work_id":"616941d8-dec6-4e15-83da-9abb9be90a6f","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.723821Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:7492ad8877f896c958d02763463ee5aef871f91c5fc0309b0804aeac80d0888e","observation_id":"05898e64-b5e6-4178-bfef-1ac11be915a5","resolution":{"observed_at":"2026-08-05T23:19:30.496042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.479147Z","title":"Set-constrained viterbi for set-supervised action segmentation","venue":null,"work_id":"6a78224d-02d8-4071-82ae-a7db184bdf83","year":2020},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.738482Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:fb446ac504abb5c51ad1f99be7070ec93bf1fa0df2e77e3b412443279b08123c","observation_id":"82d221ca-8114-45f7-804d-fb9921609d15","resolution":{"observed_at":"2026-08-05T23:19:30.483388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.468608Z","title":"Weakly super- vised energy-based learning for action segmentation","venue":null,"work_id":"0458af0b-ac70-4fe3-ae61-6794f303033e","year":2019},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.742473Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:e8dca50685dbccae0261feb12458007862955c3b87e6c5a30757b5692713977c","observation_id":"553d5dfd-81f2-4f68-997e-8fdea60b786c","resolution":{"observed_at":"2026-08-05T23:19:30.472395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.456999Z","title":"MS-TCN++: Multi-stage temporal convolutional network for action segmenta- tion","venue":null,"work_id":"dbbe7b1d-51fe-4ffd-b348-5651f7e211d0","year":2020},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.745840Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:046041248f77f33effe6088f7c1498cd4042bbf3e3f5fba6ea499087fe01b04f","observation_id":"68bf94cd-ca7a-403a-a11f-76dc0268ad66","resolution":{"observed_at":"2026-08-05T23:19:30.461109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.444986Z","title":"Tempo- ral action segmentation from timestamp supervision","venue":null,"work_id":"d039b701-3eeb-4fa6-978b-013799cfbf5b","year":2021},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.749559Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:317f8fd774beae245b24ed7a3925d46792a9a2e3327cefc953a4121e98fb3d85","observation_id":"05eb7d70-fb0d-4042-beb2-e5ae32a42e94","resolution":{"observed_at":"2026-08-05T23:19:30.449971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.421838Z","title":"Diffusion ac- tion segmentation","venue":null,"work_id":"0c8367b5-dff6-42ce-a534-76259149476b","year":2023},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.753490Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:b2bdad1564568ff6bdec3aafb77a6f199890f71fa9488b4d1d3cde35b37aa92c","observation_id":"e32a1d71-0e47-4db5-98b4-df35a5f65d5e","resolution":{"observed_at":"2026-08-05T23:19:30.425591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.402941Z","title":"Weakly-supervised ac- tion segmentation and alignment via transcript-aware union-of-subspaces learning","venue":null,"work_id":"01cef02d-4087-45ee-8031-becb464929ec","year":2021},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.757364Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:b80d0a5695ba42a3baf93ea2c816672caf13aee5eec539e8c8978c9e02468078","observation_id":"3aad209e-8209-452c-8321-77d3078bdeab","resolution":{"observed_at":"2026-08-05T23:19:30.406791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.389298Z","title":"Fact: Frame-action cross-attention temporal modeling for efficient action segmentation","venue":null,"work_id":"91bd2c86-1933-4f69-a937-af54ce2122de","year":2024},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.762092Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:078fa20509fd144d8693eed2e1d627409674ce22a6e4613cb595925ade116663","observation_id":"4e9c8877-f191-44f5-8895-c3064acbb339","resolution":{"observed_at":"2026-08-05T23:19:30.392964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.377538Z","title":"Streamer: Streaming representation learn- ing and event segmentation in a hierarchical manner","venue":null,"work_id":"d4e67408-88eb-4bda-bf4d-1c04e254e1b3","year":null},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.765470Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:8b17d462d6d8417ccae10b67ed5c349adc6a72d766ba91a1b9b8129654c8ce58","observation_id":"dab04da1-b345-4d81-aa82-cf73b05ec2b2","resolution":{"observed_at":"2026-08-05T23:19:30.382473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-05T23:19:29.768945Z","title":"Representation learning with contrastive predictive coding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.768945Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:797ca44f06c97c64636b3ba62f6bcb2b9a5350224d369d822f867539aafadf9d","observation_id":"69418f4d-975c-4158-bda9-da2a94425418","resolution":{"observed_at":"2026-08-05T23:19:29.768945Z","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-05T23:19:30.367077Z","title":"A generalized and robust framework for timestamp supervision in temporal action segmen- tation","venue":null,"work_id":"b4a567a1-f0cf-4aec-a36d-2944bd7c74e6","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.772727Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:04457811edfd5b3ab22497ab4592916538438d45249583e5902463db01be43cd","observation_id":"543f0698-4b22-4a12-bd75-4a1b61d32c07","resolution":{"observed_at":"2026-08-05T23:19:30.370769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.356410Z","title":"Temporal action detection using a statistical language model","venue":null,"work_id":"aebd6713-5fe0-414b-9c7f-6bcc201507d6","year":null},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.776311Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:97d78bbfbf6bf48ba1319bb57065bed63b5ade0f08f56fcefb12119b3a6514c3","observation_id":"85f92cad-e08d-408c-b5e3-3549e392f556","resolution":{"observed_at":"2026-08-05T23:19:30.360035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.345268Z","title":"Weakly supervised action learning with rnn based fine- to-coarse modeling","venue":null,"work_id":"edb07cc7-aae5-4492-8ac0-0af26109a657","year":2017},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.780841Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:f39592bd7d8980eba92f3082f8d6815726e6c4fab3828c2eadb85e2ca958d519","observation_id":"ef161b3f-62f7-4737-9df6-d3127f91f239","resolution":{"observed_at":"2026-08-05T23:19:30.349566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.334543Z","title":"Action sets: Weakly supervised action segmentation without ordering constraints","venue":null,"work_id":"9e31fedc-ee4c-4163-8e25-747cafa70e66","year":2018},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.784813Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:e10c6b12536cdee993aa6f6789a8b99994449ba8b83a76e72950fc736adfcfeb","observation_id":"1b3af591-7dc8-4096-99be-f2dd6ffd8c71","resolution":{"observed_at":"2026-08-05T23:19:30.338400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.323715Z","title":"Neuralnetwork-viterbi: A framework for weakly supervised video learning","venue":null,"work_id":"59a75e0d-7b84-4bae-b278-325d03174a6f","year":2018},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.788186Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:1720026edc3aa458d6a2364da50656d65758b3bf72ef7bee076b8955bda4747f","observation_id":"bd6328ff-c74b-43ad-83bd-60d46284e51f","resolution":{"observed_at":"2026-08-05T23:19:30.327930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.312161Z","title":"A database for fine grained activity detection of cooking activities","venue":null,"work_id":"fe1d80a5-9f92-4cd5-99e1-277bee246634","year":2012},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.791733Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:286eaae851806224ccb790b4edd2c32322492974f9802157c64caafb1c1e188e","observation_id":"d0e2b3f1-17ed-4dd0-a052-47a1a8b512a0","resolution":{"observed_at":"2026-08-05T23:19:30.316494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.299786Z","title":"Temporally- weighted hierarchical clustering for unsupervised ac- tion segmentation","venue":null,"work_id":"1f6c37b7-0eb9-4e38-afde-206afe009aa0","year":2021},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.795065Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:b3fe929498405ca409755ce0b0f217d2749c8a420b6bba432714a132eff22f4e","observation_id":"c87c29c9-83d8-48b0-ab48-434a7fd2aa5e","resolution":{"observed_at":"2026-08-05T23:19:30.304636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.289191Z","title":"Estimating the dimension of a model","venue":null,"work_id":"6d080ed7-0a89-414c-b5b9-3d955784d6fa","year":1978},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.798519Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:f3a74a08cfa9674ab75c0a8191cd5dd17e1b7e94b73c9529d8c81477c59e64af","observation_id":"f47f416b-a522-446e-aa22-29f9f9d7889a","resolution":{"observed_at":"2026-08-05T23:19:30.292611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.277021Z","title":"Unsupervised learning and segmentation of complex activities from video","venue":null,"work_id":"2a0d7241-56e3-4a90-84d5-9de8ee1a339f","year":2018},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.802592Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:0e46322d9dd5f4e5281a38243839df2b5b8b687373a24c8da9c0ca5eb13a053c","observation_id":"06bd317b-0ffc-477b-9e00-6c56146d22a2","resolution":{"observed_at":"2026-08-05T23:19:30.281476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.265136Z","title":"Iterative contrast-classify for semi-supervised tempo- ral action segmentation","venue":null,"work_id":"8c898521-24e8-4d02-bfc4-fa24a919685a","year":2022},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.806423Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:157f2c11dc6b84d19434c32de24d27e41300b913df284f76fb63b5c0b5ada2ad","observation_id":"f727c8c7-da00-4474-ad74-6753879c00aa","resolution":{"observed_at":"2026-08-05T23:19:30.269340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.253338Z","title":"Robust action seg- mentation from timestamp supervision","venue":null,"work_id":"cf3c264b-2baa-4a1d-a6f0-68036086623e","year":null},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.810403Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:2266a212cf6a35ae5870d62725c04b11137bf3dc7d041ed28f2a6750eff9e0db","observation_id":"56a87ff3-f5dd-445f-9e2d-bff0b76c3cae","resolution":{"observed_at":"2026-08-05T23:19:30.258122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.240366Z","title":"Hierarchical vector quantization for unsupervised action segmentation","venue":null,"work_id":"cf8fd346-edb1-41b5-9d2e-5ebf37e94173","year":2025},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.815397Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:c4e7faf8480b70fada27bc882731fd312a3b201e54ea86fb0fa7c3a3adf10d72","observation_id":"9c6add69-5ee2-41d8-b711-8e44e9f63f09","resolution":{"observed_at":"2026-08-05T23:19:30.245527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:19:30.130100Z","title":null,"venue":null,"work_id":"77b3d3a9-8d3f-429c-89f5-5e9ef11ccf1f","year":2013},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.819913Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:f49e3c65cd89b37f010950fa2d61afebc7320d6154c11174bb1b9319c2fbc649","observation_id":"6508d000-70c0-4a2f-b3ba-f9545fb43234","resolution":{"observed_at":"2026-08-05T23:19:30.135404Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.228058Z","title":"Learning latent temporal structure for complex event detection","venue":null,"work_id":"d66a7fb2-f3af-4314-b26f-b94eeb9adfc5","year":2012},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.824175Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:080882428e9fb67cdf11e2dd9f0e6eb9c8a8ee0ec5cabcc24b979d70d915a07d","observation_id":"3b04102f-34a6-4d0e-8723-a4713891855b","resolution":{"observed_at":"2026-08-05T23:19:30.232544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.212941Z","title":"Permutation-aware activ- ity segmentation via unsupervised frame-to-segment alignment","venue":null,"work_id":"beec14b0-d927-4c78-a358-7bf3a842b32a","year":2024},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.833065Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:36017707ec0c21099da3f88933ee11d5d9d839e152b36faa9a9e60cbe51a7ea8","observation_id":"6eda3c7e-ca65-4bd7-aff5-041312cb30db","resolution":{"observed_at":"2026-08-05T23:19:30.217522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.198463Z","title":"Temporally consistent unbalanced optimal transport for unsupervised action segmentation","venue":null,"work_id":"d277ff5a-4f77-43a5-8742-102781c233eb","year":2024},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.838957Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:a953a2a11ec7df858c7482cf502bf96f4f652bdfaf2dbff6b877e594aa5b2bcc","observation_id":"d65bd48a-7ed1-4525-b19b-b46eb7c58384","resolution":{"observed_at":"2026-08-05T23:19:30.202692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.185145Z","title":"AS- Former: Transformer for action segmentation","venue":null,"work_id":"e81635e5-e535-43c8-8e3b-c7217741e94a","year":2021},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.842871Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:1d163355d4ac7e96115a129f8f1185b5f7b75fadd4af5cdcf73a7599e4f26796","observation_id":"2d3f55a0-5eef-441a-acb0-6df2c3934bf1","resolution":{"observed_at":"2026-08-05T23:19:30.190150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T23:19:30.173474Z","title":"Ow- tal: learning unknown human activities for open-world temporal action localization","venue":null,"work_id":"268def0b-e43b-4de5-811d-ddaf3f9de163","year":2023},"citing_paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T23:19:29.847364Z"},"links":{"citing_paper":"/paper/2508.05524"},"observation_digest":"sha256:1b8b0a2377db58a787152cb42ffc5c597830c2ade3681ab3d17a1e094791df59","observation_id":"b758467e-c427-490e-bc83-5af32da81b2e","resolution":{"observed_at":"2026-08-05T23:19:30.177725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.05524","last_updated":"2025-09-12T17:45:56Z","latest_version":2,"primary_category":"cs.GR","snapshot_observed_at":"2026-08-11T23:18:38.238347Z","submitted_at":"2025-08-07T15:53:26Z","title":"GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":46},"total_outbound_references":49},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2508.05524."}