{"as_of":"2026-08-15T11:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8de91fbd8e25807bd7a71d587629b68114b86455f6606cedb5026ef3e0252981","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:05:28.230038Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.16330/citation-record","integrity":"/paper/2505.16330/integrity","json":"/paper/2505.16330/citation-record.json","paper":"/paper/2505.16330"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:24.700248Z","title":"doi:https://dl","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.700248Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:af6af56d1927a1a473bfdf8096acfedb866b181f00499ea2c6b4117dac916fa3","observation_id":"af8d40d3-da35-4aa1-a454-4e2114e87a8e","resolution":{"observed_at":"2026-08-07T15:05:24.700248Z","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":"10.1108/el-03-2024-0070","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The Electronic Library doi:https://doi.org/10.1108/EL-03-2024-0070","venue":"The Electronic Library","work_id":"21673210-b422-4d6a-a423-111ee0b89605","year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.928646Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:9893dd5a0db09aacc28a3c4cce6f536fac8aa7f29f84c02adb6a685c075b2fcc","observation_id":"361107e5-8318-437d-87ea-c5f53d82a6a3","resolution":{"observed_at":"2026-08-07T15:05:29.782417Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.12553","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:31.541165Z","title":"Expert Systems with Applications , 125533doi:https: //doi.org/10.1016/j.eswa.2024.125533","venue":null,"work_id":"5ed043c0-ddcc-469b-9605-52f7d64e7c2c","year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.174238Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:4f5e5ee451dcb781d84d1ea9e8de398b6a9f31e5157f224368e67df9ca104b3d","observation_id":"6c1f130c-2354-4639-9d40-5fdd87cafcfa","resolution":{"observed_at":"2026-08-07T15:05:31.619779Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10886","last_updated":"2024-12-02T15:40:45Z","snapshot_observed_at":"2026-08-13T04:17:21.014136Z","submitted_at":"2024-02-16T18:43:10Z","title":"Reviewer2: Optimizing Review Generation Through Prompt Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10886","snapshot_observed_at":"2026-08-07T15:05:25.501999Z","title":"URL:https://arxiv.org/abs/ 2402.10886,arXiv:2402.10886","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.501999Z"},"links":{"cited_paper":"/paper/2402.10886","citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:e853a5f177a52d19192b7b52ed27dcfe65392977cb2cd9ad8ccf33f9f3712c26","observation_id":"b6fc9eb0-6c2e-4d15-80c1-77e3379b93a5","resolution":{"observed_at":"2026-08-07T15:05:25.501999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:25.828313Z","title":"Journal of Informetrics 16, 101306","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.828313Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:05eebf8c2de1b422720a99f1c6505d6ce42bb06da156ad6b538e6e2368c6b661","observation_id":"b7d4ac05-43b0-4440-83a5-cbdb310a21b0","resolution":{"observed_at":"2026-08-07T15:05:25.828313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:25.943595Z","title":"Journal of Infor- metrics 17, 101450","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.943595Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:1b9dff58d77f844b20f277ff2d1602ce4e6f38a36e19c783f715cbf409043a0e","observation_id":"a333f37a-67f8-4073-9289-9755ef8b3e82","resolution":{"observed_at":"2026-08-07T15:05:25.943595Z","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":"3116.2019","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:30.940990Z","title":null,"venue":null,"work_id":"790424eb-90b6-4ca5-8a33-7137ab02d664","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.990348Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:ad877c72234ddb948802303de12a640e5a2bffd907834902c976105bdd1869cc","observation_id":"8010e1d2-7f41-48ed-9955-cd68c3319efc","resolution":{"observed_at":"2026-08-07T15:05:31.043833Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:33.223621Z","title":"(Eds.), Proceedings of the 40 24th Annual Conference of the European Association for Machine Trans- lation, European Association for Machine Translation, Tampere, Finland","venue":null,"work_id":"4a69e8e2-3848-4a7d-ae80-5fa070b94d32","year":2023},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.054356Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:6bda00ae3d2ded660495f7441efc84e3acabea7f0fd125ab32c542fc6621c58e","observation_id":"682d295b-05fa-44a6-8e2c-e2ec1f79b6a5","resolution":{"observed_at":"2026-08-07T15:05:33.267595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:26.124847Z","title":"NEJM AI 0, AIoa2400196","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.124847Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:ef1bce5b3edbfe6c6d38e991b35382e75a322185e2dbceca824aeb3bd7c71e53","observation_id":"90719538-d435-4176-a4ef-0b07b74a928f","resolution":{"observed_at":"2026-08-07T15:05:26.124847Z","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":"2024.10374","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:30.729502Z","title":"Information Processing & Manage- ment 61, 103743","venue":null,"work_id":"c5370114-2d6e-4f9b-adcc-fe2dbf10afa2","year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.225245Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:157d88bbb96a352e7d05da409a542510c1fb6c993e6322544753da9d3bcfcdf2","observation_id":"d5617dc0-1d98-4b91-83c9-b83fb54db2e5","resolution":{"observed_at":"2026-08-07T15:05:30.775710Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00622","last_updated":"2023-06-01T12:45:53Z","snapshot_observed_at":"2026-08-13T11:27:23.180667Z","submitted_at":"2023-06-01T12:45:53Z","title":"ReviewerGPT? An Exploratory Study on Using Large Language Models for Paper Reviewing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00622","snapshot_observed_at":"2026-08-07T15:05:26.293474Z","title":"URL:https://arxiv.org/ abs/2306.00622,arXiv:2306.00622","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.293474Z"},"links":{"cited_paper":"/paper/2306.00622","citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:857eda22b115387c9f2aa6bf273b77b0785e5b545337cb7384145310d6fd22fa","observation_id":"38603b02-d79c-4685-9479-5a41f3a8f66a","resolution":{"observed_at":"2026-08-07T15:05:26.293474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:26.398727Z","title":"(Eds.), Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Com- putational Linguistics, Online","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.398727Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:df7d7e268395038cc5f0d4e1c8063fcdf3cb380e8e6233ecd101931926ba41de","observation_id":"c9214b50-6ded-421e-b3fe-94274ff7cc6a","resolution":{"observed_at":"2026-08-07T15:05:26.398727Z","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":"2022.10128","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:30.564304Z","title":"Journal of Infor- metrics 16, 101282","venue":null,"work_id":"29deeaec-d65f-4301-96df-7925462a35a5","year":2022},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.580241Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:c1f939de6366a20fac23bdd83571107b690e9c943aa791f3022b5307c89dd62b","observation_id":"6398b8bb-2dd9-4728-aa27-fa5c9ba40f3c","resolution":{"observed_at":"2026-08-07T15:05:30.612528Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11192-021-04049-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Scientometrics 126, 6891–6915","venue":"Scientometrics","work_id":"731ee62a-e7bf-43f6-92c4-9144e1b0289f","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.629318Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:57536968f5d3c0bff1a73906b1635c49c4a66ba6a6f5a176930338e63a7d09b3","observation_id":"22d4fdf7-3b94-46cf-8df8-17fad58bbd99","resolution":{"observed_at":"2026-08-07T15:05:29.219322Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T15:05:26.806605Z","title":"URL:https://arxiv.org/abs/ 2303.08774,arXiv:2303.08774","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.806605Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:5851a174317564089b6b24ec5ab2b05e43c8b27c123454772df3777e1a4f054e","observation_id":"4919c1f0-feee-4ed2-ab64-aaf6afd5b9ef","resolution":{"observed_at":"2026-08-07T15:05:26.806605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:32.998612Z","title":"(Eds.), Advances in Neural Information Processing Systems, Curran Associates, Inc","venue":null,"work_id":"399c27a1-2e71-4ba3-9faa-8ef82a90e803","year":2022},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.899207Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:4c6967f16f61b3f77496ef3e3d0b46ed7054da77ae6bb5b4e464ce0c5217cb20","observation_id":"f252d737-bc67-488e-a723-0b73b6772793","resolution":{"observed_at":"2026-08-07T15:05:33.099318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:26.976636Z","title":"Expert Systems with Applications 256, 124912","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.976636Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:0c1e962f257ef803acf7a988e0932a2233556e308870da1f8f1781bb9485e55c","observation_id":"d577f2c0-e563-4d7e-a4e7-721d4230489a","resolution":{"observed_at":"2026-08-07T15:05:26.976636Z","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":"10.1108/ajim-05-2022-0244","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Aslib Journal of Information Management 75, 884–916","venue":"Aslib Journal of Information Management","work_id":"5ec7e7bd-4f92-4805-8f46-03e02c1e5a8a","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.071678Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:e4846bf86ecb9bc05dd43bb251f600f23ba55eb8eb965b00d2a6468e1d6205a7","observation_id":"9ac05504-0321-4330-98a3-5458eced5374","resolution":{"observed_at":"2026-08-07T15:05:28.876975Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.05492","last_updated":"2023-06-16T23:11:06Z","snapshot_observed_at":"2026-08-13T11:14:58.069265Z","submitted_at":"2023-06-16T23:11:06Z","title":"GPT4 is Slightly Helpful for Peer-Review Assistance: A Pilot Study","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.05492","snapshot_observed_at":"2026-08-07T15:05:27.180000Z","title":"URL:https://arxiv.org/abs/2307.05492, arXiv:2307.05492","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.180000Z"},"links":{"cited_paper":"/paper/2307.05492","citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:cd6505db8fdfa34aa0d9b700410a12f63af03e3b0fea5c10a2eb9458db09e048","observation_id":"40f1571d-8121-4d95-8fff-753dede73594","resolution":{"observed_at":"2026-08-07T15:05:27.180000Z","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":"10.1086/ahr/46.1.96","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Business Cycles: A Theoretical, Historical, and Statistical Analysis of the Capitalist Process, Martino Pub","venue":"The American Historical Review","work_id":"ba7f9bbb-3d71-4311-936a-c8ba5e8e13c0","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.367425Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:1afb3eff2d44d9157344105c36f05583992a73339e770fb5b25195b73611ecfa","observation_id":"9f0650e6-75bf-41db-ae35-e1a81be9c477","resolution":{"observed_at":"2026-08-07T15:05:28.660616Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.12550","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:30.329718Z","title":"Expert Systems with Applications , 125509doi:https://doi.org/10.1016/j.eswa.2024.125509","venue":null,"work_id":"36693daf-dcf3-48cc-8119-af59cc273b76","year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.498798Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:7f1e7f2f5a8d9c6e0d24a775f4d46bb032e2f38846e5eaacc526c028ae026e3d","observation_id":"b3e0fa31-acdb-44f1-83e5-1235f6d4b21e","resolution":{"observed_at":"2026-08-07T15:05:30.361994Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:27.580103Z","title":"(Eds.), Findings of the Association for Computational Linguistics: EMNLP 2023, Association for Compu- tational Linguistics, Singapore","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.580103Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:aca36e1d895ce5f9516ed580ae127a4e21af0a454155a6b59ce66682a66ed2aa","observation_id":"ef9e8f19-5b1c-41e8-bfd6-110ba66ceb76","resolution":{"observed_at":"2026-08-07T15:05:27.580103Z","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":"10.1016/j.joi.2018.07.005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi:https://doi.org/ 10.1016/j.joi.2018.07.005","venue":"Journal of Informetrics","work_id":"a06d080e-862e-4ca9-8409-69ddfc32be37","year":2018},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.646847Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:21e59a121de44a15de25c9c3efed4a9ca0fa7e6b9cf49ca749a5bdd7ae7e3ba5","observation_id":"d959d6f1-57a3-433a-ab91-f83017cd3bfb","resolution":{"observed_at":"2026-08-07T15:05:28.460480Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T15:05:27.703912Z","title":"doi:doi:10.2478/jdis-2024-0013","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.703912Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:321490f277c7f95b07034284da5771da260ce1eecd87f927de7042a22ab3bfb3","observation_id":"574c2e32-defa-43ef-b004-5095d9c386dd","resolution":{"observed_at":"2026-08-07T15:05:27.703912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:27.850736Z","title":"Research Policy 46, 1416–1436","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.850736Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:ad9b98bbef9f33f73c98794e4b837173c23e26f7312b30857b85c58844b2ceca","observation_id":"cdd1d452-e774-411f-b167-54fa66cdd36e","resolution":{"observed_at":"2026-08-07T15:05:27.850736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:27.904255Z","title":"Journal of Informetrics 18, 101587","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.904255Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:a81ccf498785b034febbd27b3e74d1e587fb15c42238c4aac6bdb08f31250e00","observation_id":"dd741d5c-93cd-4f03-b664-863172ce02c1","resolution":{"observed_at":"2026-08-07T15:05:27.904255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:27.966163Z","title":"Plos one 18, e0284567","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.966163Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:9ebf380cbda63bd7a68c113a3dbccdf5dafa3e8f825571ee15c265cd2bfa762e","observation_id":"d3db4e77-94f6-4725-89b5-b6735e581fea","resolution":{"observed_at":"2026-08-07T15:05:27.966163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:32.783155Z","title":"(Eds.), Advances in Neu- ral Information Processing Systems, Curran Associates, Inc","venue":null,"work_id":"7e4f824a-7731-42c7-91be-d8e216740549","year":2020},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:28.060577Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:c280cdc6c24094d9fb2db69b0f3dc1fca5146816b88aa285fa9a73769818624a","observation_id":"7ae61984-241b-4984-ae11-e50bc29f83e5","resolution":{"observed_at":"2026-08-07T15:05:32.892263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:32.556992Z","title":"(Eds.), Proceedings of the 2024 Joint International Conference on Computa- tional Linguistics, Language Resources and Evaluation (LREC-COLING 2024), ELRA and ICCL, Torino, Italia","venue":null,"work_id":"65d53e2b-c719-4b5a-8905-ccaa18b602a5","year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:28.101889Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:f6b796f32e8e9833c67c72016a3d7f5bbc4f7665cd7a06e3be7e612beaf51412","observation_id":"e6c6e951-84cc-487f-9876-2c22a32a6abb","resolution":{"observed_at":"2026-08-07T15:05:32.647348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.10220","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:30.056029Z","title":"deep learning for pa- per section identification: Toward applications in chinese medical liter- ature","venue":null,"work_id":"c475e877-c22f-4367-a688-6ef580c7caac","year":2020},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:28.152419Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:3b61bcee369ba08333b8c0d3fd5b51322828443225a6d558f09667b4866441ce","observation_id":"9380a3d8-cced-451f-96ab-ed7883abdc1e","resolution":{"observed_at":"2026-08-07T15:05:30.108998Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/2232409","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"harvard university press","venue":"The Economic Journal","work_id":"a714b110-8d1a-4f65-a729-0b49474c3769","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.710492Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:52460e1eb4b277221b34985766c383d0952e47ee114b9c4fe11f751d8eeb168b","observation_id":"efc526b3-f676-4f1a-b2ec-ef07a5910fbd","resolution":{"observed_at":"2026-08-07T15:05:29.045720Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1177/000312240406900203","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi:10.1177/000312240406900203","venue":"American Sociological Review","work_id":"08d8fb7c-6e0a-4536-b319-dfa42068749d","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.624718Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:d38ea7caf5dc2b78df593b7b696d6483818ad6110f82ef6ca749a0729f6af90b","observation_id":"b7039a8c-5ce0-4010-850b-e92a33c44976","resolution":{"observed_at":"2026-08-07T15:05:29.598206Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:25.283287Z","title":"Oxford University Press","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.283287Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:1d49aeb45b1250d0a4c055adf83042f889511232c33d6a411023e1ff6529cfe0","observation_id":"653d8827-d814-467c-8348-51ba10eb4005","resolution":{"observed_at":"2026-08-07T15:05:25.283287Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:27.257853Z","title":"Cre- ativity Research Journal 24, 92–96","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.257853Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:268851334d95be28d203819e5eff92c43cb5ca61af4e3bf58fd305278540d8bf","observation_id":"59b43588-f6f3-4c96-ae27-71c5a735f051","resolution":{"observed_at":"2026-08-07T15:05:27.257853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:27.781659Z","title":"Sci- ence 342, 468–472","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:27.781659Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:18ecdaf5931a5f555d9846fb8f2b5854da6f779a6ef0ec99850ecaead3e193ca","observation_id":"c5849b11-2804-47a4-83ba-72524acb4a62","resolution":{"observed_at":"2026-08-07T15:05:27.781659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:24.517970Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.517970Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:8623d7866cb97ee24082424d34f3f8d609fa84b0458043d971a387b628ee2646","observation_id":"1fe5eb60-467d-46a4-bac3-a6ef36705384","resolution":{"observed_at":"2026-08-07T15:05:24.517970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:25.390227Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.390227Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:e1aae26fa893d60f1c1aee30d21617ec4a04e43e5ef8b374ae6e841bca342a92","observation_id":"cd548762-140a-42ab-9d1b-8d74ac450d28","resolution":{"observed_at":"2026-08-07T15:05:25.390227Z","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":"10.1007/s11192-018-2640-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Scientometrics 115, 463–486","venue":"Scientometrics","work_id":"ddc28266-f27f-4e4b-9835-a96ecd5ec044","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:26.461149Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:f6a3705e7c5745247d459538fcc40613e18aa75797f71be46af7c3267b9645b2","observation_id":"26281031-b959-46d9-97eb-ac166e996609","resolution":{"observed_at":"2026-08-07T15:05:29.361796Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:24.278034Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.278034Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:a6efd122da911cac66020e6c75dc96edaefee08e1d985100657eed504aeeda69","observation_id":"6e075715-d9c4-4d64-adff-4ca221a49889","resolution":{"observed_at":"2026-08-07T15:05:24.278034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-07T15:05:24.408113Z","title":"URL:https://arxiv.org/abs/2004.05150, arXiv:2004.05150","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.408113Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:f1c97180ae38a76f9d1d62ef6d6b2ac275286fe50daf30cc846c264014ed4f57","observation_id":"f58750d4-443e-45a8-a186-cee16b3398ba","resolution":{"observed_at":"2026-08-07T15:05:24.408113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:24.195298Z","title":"Re- search Policy 50, 104144","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.195298Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:3c3fff95462005f4962f6cd76c328ca92df2530269fe652c1bf29fffb6c6e3d8","observation_id":"1f5085bd-7473-4c16-90aa-5318db7724c9","resolution":{"observed_at":"2026-08-07T15:05:24.195298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:33.332229Z","title":"(Eds.), Findings of the Association for Computational Linguistics: NAACL 2022, Association for Computational Linguistics, Seattle, United States","venue":null,"work_id":"4fb34bae-13d0-493b-a86e-250bab12b307","year":2022},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.767231Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:80efb8bcd5c23f5017324d6ec548ea68683de10609018edc4b3a3c8b36291196","observation_id":"9ab2282b-ae64-4b6e-a0bf-2f7129a9bc16","resolution":{"observed_at":"2026-08-07T15:05:33.410734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8699.36489","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:31.768071Z","title":"Journal of Machine Learning Research 24, 1–113","venue":null,"work_id":"653c1dfe-d29e-4a83-b315-89f1717eb928","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:25.039100Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:7e945ff1083b73bc739ace272680d1eca0ffe095c992e00dc64a4e97b41761d1","observation_id":"89cd69f9-e125-4dbc-bad8-c590e628be02","resolution":{"observed_at":"2026-08-07T15:05:31.912321Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.12118","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:32.085041Z","title":"Expert Systems with Applications 235, 121186","venue":null,"work_id":"12f72851-ab4f-4339-bf3a-18313a738126","year":null},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:24.807862Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:d3b570c7b2c5d46d2d23f9f17ce5bb51b49d7650572e57268ff70ff5797c75a5","observation_id":"87621dd7-aa2f-4ae1-bcae-adbce27f41fd","resolution":{"observed_at":"2026-08-07T15:05:32.169210Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:05:28.230038Z","title":"Expert Systems with Applications 259, 125295","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:28.230038Z"},"links":{"citing_paper":"/paper/2505.16330"},"observation_digest":"sha256:17e40a729cde6ff8ea49aea4ff655da2b0c9a69a9d5c0ca5137d22c24834bf96","observation_id":"fb6ce203-8a72-4f07-840a-91266f0e935c","resolution":{"observed_at":"2026-08-07T15:05:28.230038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.16330","last_updated":"2025-05-22T07:34:59Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-11T00:41:27.573172Z","submitted_at":"2025-05-22T07:34:59Z","title":"SC4ANM: Identifying Optimal Section Combinations for Automated Novelty Prediction in Academic Papers"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":2,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":23,"verified_exact":8,"verified_fuzzy":5},"total_outbound_references":45},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2505.16330."}