{"as_of":"2026-08-05T07:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0087bb879b55b29af68755f2c1189551ed1520c1f9ba1b31f3427b9118386af","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-11T01:58:48.817451Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:01:57.153922Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.07489","snapshot_observed_at":"2026-08-01T12:01:57.153922Z","title":"arXiv preprint arXiv:2605.07489 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19688","last_updated":"2026-07-22T02:35:45Z","snapshot_observed_at":"2026-08-04T03:07:10.391651Z","submitted_at":"2026-07-22T02:35:45Z","title":"A Diagnostic Evaluation Framework for AI-Generated Cover Songs Using Music-Theoretic and Acoustic Features","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T12:01:57.153922Z"},"links":{"cited_paper":"/paper/2605.07489","citing_paper":"/paper/2607.19688"},"observation_digest":"sha256:245105de6256319b5abd6788e41240ea8b7622914c43d15146b5dcada607adaa","observation_id":"65899607-4d16-4a30-8b71-4dd354758b53","resolution":{"observed_at":"2026-08-01T12:01:57.153922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.07489/citation-record","integrity":"/paper/2605.07489/integrity","json":"/paper/2605.07489/citation-record.json","paper":"/paper/2605.07489"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"91dd5987-ec00-40b0-bcf7-c77f2e850c51","year":2020},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:5ab82d11f09f68b5db795445aef804d22d50f0ad886814a523a89aa6bc31cbca","observation_id":"b8eae617-2f09-47b7-ba63-5e661f8921d3","resolution":{"observed_at":"2026-05-14T14:46:28.047010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"be07a1d4-2ea1-4fb0-9bf6-f4fcf6bfeefb","year":2007},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:6f50af17bd9a3442651f3a3bcfd804c7120d9067cded39cefa76033eaadf80ba","observation_id":"8e2da3bf-327a-4274-b3a5-a93826b7ca4e","resolution":{"observed_at":"2026-05-14T14:51:28.029247Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2021.emnlp-main.552","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"S im CSE : Simple Contrastive Learning of Sentence Embeddings","venue":"Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing","work_id":"f9c0d9b5-c569-4f54-bdc7-6ff3cdd316db","year":2021},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:bd7610221de3793f5c7c9aef65a74f4e39ef10729ec80848abff2ce4fb2e70ef","observation_id":"24c4e941-6043-4508-82df-f016de51bf11","resolution":{"observed_at":"2026-05-11T02:00:52.130652Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-01T13:38:16.221421+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T13:38:16.221421+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"96522741-b9ab-474f-b496-c1b4d01e0278","year":2006},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:e4ad63f054de792a58718e7b0f18eb710b55dace26e1706ea451003ed81e3076","observation_id":"0a1c5f0a-9506-4bb4-90dc-f3680cf174a2","resolution":{"observed_at":"2026-05-14T14:51:28.017882Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6710d878-71c1-427b-be92-b8c091132549","year":2002},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:ac2f2406cc26049de76cc2febcaa7497fc3ddd44799bae86008cc6fe4657a6c3","observation_id":"bd6062de-434b-4023-98e0-515261488832","resolution":{"observed_at":"2026-05-14T14:46:28.044601Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:47:46.278816Z","title":"Ellie Pavlick and Tom Kwiatkowski","venue":null,"work_id":"42256cb4-aefd-4635-ab24-35b6179ff520","year":2020},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:8d68ef27dece9661a82cb6f15f511210a727e89b771376580d7e797be8b9d9e7","observation_id":"3733a66d-9810-47db-9afb-acce80e6714e","resolution":{"observed_at":"2026-05-11T02:00:52.117510Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-03T15:08:44.41612+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T15:08:44.41612+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.292157","doi":"10.1109/tbdata.2019.2921572","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Johnson, M","venue":"IEEE Transactions on Big Data","work_id":"34b80d84-7664-4446-9be9-1c75c193ba13","year":2021},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:a61a0c40b1e7800652bc2aa7bd605a20881c74babe6e045cd47bfd111fffde0f","observation_id":"869e87eb-260f-4f61-b87e-5ea5822e203e","resolution":{"observed_at":"2026-05-11T02:00:52.126468Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-14T05:20:54.565969+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T05:20:54.565969+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6295.121633","doi":"10.1145/1216295.1216335","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"8afd2673-2cdc-4099-9cd7-fe3d4e99513b","year":2007},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:3f811fba7310b01bc92df45f031d316872194696f9e151f92c653660370be08d","observation_id":"8e1c44eb-dd56-435f-b186-833e6531e36c","resolution":{"observed_at":"2026-05-11T02:00:52.135380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"31c2f3d9-af4a-47cd-aa04-9b72bf3dd240","year":2023},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:bb0905700701a5c4d11bca97a7a724919a1d8442a3703746162324834a2ef3b6","observation_id":"5cf3fdf4-2a6d-419b-bce8-aa0ae995626a","resolution":{"observed_at":"2026-05-14T14:46:28.041354Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8baa1fff-ff56-4649-80ea-70e7bffcf77e","year":2022},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:f761b95ddd4a180ba5fb55f46096e798fa725393a140923d655903b2abb59ae2","observation_id":"8049f4c2-785b-476e-a1f0-2e9631b63156","resolution":{"observed_at":"2026-05-14T14:46:28.042945Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7b6cc67a-f732-4f44-a5b7-13c90ecf3a59","year":2017},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:016ea9885036817435cc9d5bdbe515fe0a08bdfe0c27251a000ace636ee27698","observation_id":"e553b9f0-067c-4d49-82c7-28646305aed4","resolution":{"observed_at":"2026-05-14T14:51:28.024005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11766247_19","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"aaf519ba-5a81-49bb-bc9e-498cd9f48363","year":2006},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:139eee99b16f98e63155f3844efc450da8027283b892f53bd08bd04c284366ca","observation_id":"87e46ce4-1971-4606-92d7-ce2b1cce28f8","resolution":{"observed_at":"2026-05-11T02:00:52.121009Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-10T23:49:39.312159+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T23:49:39.312159+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"1969.Structural Functions of Harmony","venue":null,"work_id":"049f5c9b-e517-4a99-b1c0-95906637df94","year":1969},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:9e02f8e0a424e2672c0c439e8d7a41f7404d170b810a1411c92a4288ee028972","observation_id":"9dbfbd8a-2668-470d-90ed-5292c947e1be","resolution":{"observed_at":"2026-05-14T14:51:28.031911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7054.135716","doi":"10.1145/1357054.1357169","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"dd07a120-d638-43bd-8c30-a569991fe32b","year":2008},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:0676245cb3c5123e2699bc441ace5d6e7a84b72ab69b7eb0120dbd23db8167c5","observation_id":"74efd5e2-d667-4421-bd3c-5863b4d75342","resolution":{"observed_at":"2026-05-11T02:00:52.112378Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9728.2021","doi":"10.1109/icassp39728.2021","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Benign Overfitting in Binary Classification of Gaussian Mix- tures","venue":null,"work_id":"be26a294-57a7-4dd7-9fc8-e42728330d49","year":2021},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:77e6039a671e265bf9b22dfe18aea6d8689082c10092d4351621e507797f143a","observation_id":"4e0e23dc-d106-4e3f-bff5-1891de8829ad","resolution":{"observed_at":"2026-05-11T04:05:55.710302Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-21T23:23:20.57075+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T23:23:20.57075+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"484cffb2-be72-464e-9c37-98ff5eb3f6ff","year":2023},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:02598ae1b73f4a3fde45b58825eda70d7d03efa7bcde817113bb9998de0467af","observation_id":"f8f81030-1911-402d-bdf0-f4a61a773d88","resolution":{"observed_at":"2026-05-14T14:46:28.036213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"dc7238b6-1f89-46a5-b7ce-233cf270a1ea","year":null},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:c426d8986dc728879aa367aa1884fdbcce7765d7d4c1da2fe7bd1316bc071085","observation_id":"5f26eef0-e7f6-459c-a698-0dc896a5c290","resolution":{"observed_at":"2026-05-14T14:46:28.034508Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"InProceedings of the 19th International Society for Music Information Retrieval Conference (ISMIR 2018)","venue":null,"work_id":"04f47094-f842-4f84-8eb8-ab89b8a1cb5b","year":2018},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:fc1835fa9b6ce6d28bc13d19ed108789dc262830e45d9ac8298e74704ecda7bb","observation_id":"3792d620-5007-446b-9253-4bc44c97a46d","resolution":{"observed_at":"2026-05-14T14:46:28.038096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3cf712ca-1979-4ac6-9f00-862bcdd34a07","year":2020},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:c4be10127108a9b538a56de981c515eaf89a89ec60e9bfe28e9e803f88918806","observation_id":"66009d0f-486c-4e8a-bbe5-24af710c3893","resolution":{"observed_at":"2026-05-14T14:46:28.039702Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a6c05cab-3077-47b9-95fb-719d325f6afb","year":2024},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:479bd824045e41ba667f41d709508a46abf598e966f10b0deccc9a9f5aa83bad","observation_id":"3e446c22-9d38-4e8b-a141-39165989e572","resolution":{"observed_at":"2026-05-14T14:51:28.026912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.10547","last_updated":"2026-07-07T07:53:42Z","snapshot_observed_at":"2026-08-03T10:19:57.596650Z","submitted_at":"2026-01-15T16:14:25Z","title":"HeartMuLa: A Family of Open Sourced Music Foundation Models","version":3},"cited_work":{"arxiv_id":"2601.10547","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2601.10547","snapshot_observed_at":"2026-07-08T02:18:10.066236Z","title":"Heartmula: A fam- ily of open-sourced music foundation models","venue":null,"work_id":"efe461e3-4f74-493f-b142-f66d5027f0ba","year":2026},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"cited_paper":"/paper/2601.10547","citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:bdb39110af9c2573d51bf45d7615f482cfd1e4302f32a26b4d7af7b9e9104ebc","observation_id":"15c48c9e-d654-43c7-a2ae-211ea6a2d541","resolution":{"observed_at":"2026-07-08T02:18:10.066236Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.873548","doi":"10.1109/hpbdis.2019.8735487","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"197d13ff-7c9b-47dc-adae-48e24863bc30","year":2019},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:15f29497fa01ff34a0535aec5f700d8612fb250348a84a03473907cd54ee577e","observation_id":"b5754990-1249-4a05-8dcd-731ed184823f","resolution":{"observed_at":"2026-05-11T02:00:52.139216Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8215.2021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"28ad65cf-3357-4b52-9581-0f73d063c4cc","year":2021},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:28652df8b466952354ae734952e6f1f2b0f8d59ad389905ee32137e082e53aae","observation_id":"0383ddd7-7339-4442-ac97-5e8f62fe8424","resolution":{"observed_at":"2026-05-11T04:05:55.729815Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"You and Po-Sheng Liu","venue":null,"work_id":"aea8b2a5-87d5-4a2b-b3bb-c9701d63cc4d","year":2016},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:0c46233fe11fd05670c9a462a26f15a577a4e3d8e36e69699495185a26be3fa4","observation_id":"ab81e2c6-1b24-4fa1-932b-65a349ddd333","resolution":{"observed_at":"2026-05-14T14:51:28.034804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Rea- son","venue":null,"work_id":"0aaefb1e-6b42-479d-b9ac-4374fce1c26c","year":2024},"citing_paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-11T01:58:48.817451Z"},"links":{"citing_paper":"/paper/2605.07489"},"observation_digest":"sha256:87bd19f4aefe12bc98c34a09f703e37105515c70a5f067b3c85fd39f44171717","observation_id":"b6a883b3-45d2-40d7-82d1-b5b6710d8eee","resolution":{"observed_at":"2026-05-14T14:46:28.032979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.07489","last_updated":"2026-05-08T09:29:33Z","latest_version":1,"primary_category":"cs.SD","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:29:33Z","title":"A Decomposed Retrieval-Edit-Rerank Framework for Chord Generation"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":8,"verified_fuzzy":4},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2605.07489."}