{"as_of":"2026-08-10T02:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53b2d2b672f43411505933a0708e76d0a0b1218f0a8de91f4a522da795cb1985","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-09T06:31:02.800959+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-08-08T19:43:47.481511Z","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-09T21:53:08.751359Z","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:f7cd18d9a4d83bb748665cab856e384fa1f0cab7f677d60012a1719dac0da4b6","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-08-08T19:43:47.481511Z","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:f935ae3b6a945f6d12625776746fe7ee7285f809f336eba045fa2cfdd2709495","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:8bb72e22244618df3ba09235339aa60dd1ddd603d7289699d3f2a340398012c1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:7e08ab7cc7443be0a7f6f20b459f6f8af96a9860cfddbff8ee2eab8211bd8c7b","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+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-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:76a1e6d0c08fbdb25b863a61fac62e74770f8b3ff81b3a29b9e8c3997f804f69","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:eecc68823bcbdddf7247e27e48851a0965b47c2aa738853db86e03b9d2ab6532","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:4d35e41ab4b8c65cc757e55f2250aa49cc96adb6c633441c61f26070f15ccc8b","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+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-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:78c5e58ba1e2d01b97f4805d0f30d5f782f492945f038d953206ca9abe48fac9","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+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-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:18a03d336a0f0a6f5b08e6f72d22a84dc32d2272d160a3e6c28f951e160525ce","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:c1c877fcd7abb70fe719f84236b3d995eb3c42ba85da37b79951af72b217b4d5","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:b71bcf4c18c94b44cbb0669e195ea9aa8ac9657945128aa0d663d3355d286b11","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:24f3e1785b537ce8dbf298c55d61aeda83d1a0d87c81d9eee63abf9369be1765","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:e39039cab3bbad97632709a8a298632bc23043721cf1eebcd657df43374030df","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+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-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:4d8af0aacf04dae4db59bda2ef4bdbc05f7e59c1225743ac61c2f05148f9e785","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:7483dbfe5e3d54914ccaa3dcf064c806bebea8ce554949c80ac2c630d147cbbe","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:2039313daeff3ba872153dc42ef3af589bdc15848f2f90f1ada342d0ebb2400f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+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-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:f0b110e2d7a7c329f1caa77d6c94faeb18584a1db598c347b522e15d4e5164d8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:451f657d01c45d476c0cff9eebfb4aead4e68f8e04435d6e552acfe356c27758","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:f3fc8d9c5c86a3b42138339fb889ffd1c18e6fd1289d171157d27d2d13d8cae8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:31326d1c156657bd030a52e827bd66da5885e61dee13324fd045af9c0fb18404","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:8a658dcd9cac2d238640d316b56fa9fa7ea147a06bc39a11fe906ace5c6e0508","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:58:08.522058Z","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-08-08T19:43:47.481511Z","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:453d3e7ead82b88128ed8219ec73618d38900f1ba794b7cff619413ad16bec62","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:99cea2fb2c1e573136b1019bf7437ba02e2d97ae29b579fec9987393f785bb9a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:f8639db562eeaa664230e55b28eb1b76964ec99e85ea8e2493502a46fdf2012f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:32c3c432fb54f8fbf6fe55a47fdfb14d035562a4bafbe04149f513a2564a5f88","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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:70501c597f0c44d8ba6e02a415e39a006dc54c9f7865dfd3965fee7d616519d8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T19:43:47.481511Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2605.07489."}