{"work":{"id":"00eebc59-e300-4d9d-86e2-f9bc6c1bf336","openalex_id":null,"doi":null,"arxiv_id":null,"raw_key":"raw:7624f57664ed04bd3679c341","title":", \" * write output.state after.block = add.period write newline","authors":null,"authors_text":"ENTRY address archivePrefix author booktitle chapter edition editor eid eprint howpublished institution isbn journal key month note number organization pages publisher school serie","year":null,"venue":null,"abstract":null,"external_url":null,"cited_by_count":null,"metadata_source":"raw_reference","metadata_fetched_at":"2026-05-25T08:35:33.941129+00:00","pith_arxiv_id":null,"created_at":"2026-05-09T03:26:27.729439+00:00","updated_at":"2026-05-25T08:35:33.941129+00:00","title_quality_ok":true,"display_title":"\" * write output.state after.block = add.period write newline","render_title":"\" * write output.state after.block = add.period write newline"},"hub":{"state":{"work_id":"00eebc59-e300-4d9d-86e2-f9bc6c1bf336","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":78,"external_cited_by_count":null,"distinct_field_count":16,"first_pith_cited_at":"2022-01-06T09:23:18+00:00","last_pith_cited_at":"2026-04-17T23:26:27+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-01T03:23:03.786665+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"use_method","n":1}],"runs":{"context_extract":{"job_type":"context_extract","status":"succeeded","result":{"enqueued_papers":25},"error":null,"updated_at":"2026-05-24T01:25:06.862472+00:00"},"graph_features":{"job_type":"graph_features","status":"succeeded","result":{"co_cited":[{"title":"write newline","work_id":"3b731e2d-843c-43f2-b9b6-7ffd356be7ad","shared_citers":70},{"title":"GPT-4 Technical Report","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","shared_citers":12},{"title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","shared_citers":6},{"title":"N.; Kaiser, .; and Polosukhin, I","work_id":"c2e36d5a-7b5e-4c5d-beae-a708921f9fad","shared_citers":6},{"title":"Language Models are Few-Shot Learners","work_id":"214732c0-2edd-44a0-af9e-28184a2b8279","shared_citers":5},{"title":"LLaMA: Open and Efficient Foundation Language Models","work_id":"c018fc23-6f3f-4035-9d02-28a2173b2b9d","shared_citers":5},{"title":"Proximal Policy Optimization Algorithms","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","shared_citers":5},{"title":"Qwen2.5 Technical Report","work_id":"d8432992-4980-4a81-85c7-9fa2c2b87f85","shared_citers":5},{"title":"W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; et al","work_id":"3179dbba-191c-42be-9257-26dd3b40ebb4","shared_citers":5},{"title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","work_id":"e96730e3-129b-4db6-b981-15ab7932e297","shared_citers":4},{"title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","shared_citers":4},{"title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","work_id":"41fe12c4-e538-4890-a244-480650ed3078","shared_citers":4},{"title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","work_id":"a1f2574b-a899-4713-be60-c87ba332656c","shared_citers":4},{"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","shared_citers":4},{"title":null,"work_id":"25ccec76-12ea-46da-8d7c-561322b965df","shared_citers":4},{"title":null,"work_id":"b0fef766-ce94-4d61-888f-714de61f4d49","shared_citers":4},{"title":"A Survey of Large Language Models","work_id":"de1b42b5-4a0a-4b1f-8c78-1f7fe21be6c9","shared_citers":3},{"title":"A Survey on LLM-as-a-Judge","work_id":"2676656a-67bd-4ad5-bad6-cb6f5fcdbfbe","shared_citers":3},{"title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","work_id":"ed240a10-5b19-406c-baa5-30803f465785","shared_citers":3},{"title":"Constitutional AI: Harmlessness from AI Feedback","work_id":"faaaa4e0-2676-4fac-a0b4-99aef10d2095","shared_citers":3},{"title":"D.; Dhariwal, P.; Neelakantan, A.; Shyam, P.; Sastry, G.; Askell, A.; et al","work_id":"3347d907-6b52-4759-a8d7-240fe31b8225","shared_citers":3},{"title":"Distilling the Knowledge in a Neural Network","work_id":"d927ab1f-17b8-4002-9d09-c3d55764fbad","shared_citers":3},{"title":"GPT-4o System Card","work_id":"f37bf1c7-4964-4e56-9762-d20da8d9009f","shared_citers":3},{"title":"LoRA: Low-Rank Adaptation of Large Language Models","work_id":"0426219a-789e-4964-adc8-a04538510818","shared_citers":3}],"time_series":[{"n":19,"year":2024},{"n":46,"year":2025},{"n":5,"year":2026}],"dependency_candidates":[]},"error":null,"updated_at":"2026-05-24T01:25:17.051501+00:00"},"identity_refresh":{"job_type":"identity_refresh","status":"succeeded","result":{"items":[{"title":"Qwen3 Technical Report","outcome":"unchanged","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","resolver":"local_arxiv","confidence":0.98,"old_work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e"}],"counts":{"fixed":0,"merged":0,"unchanged":1,"quarantined":0,"needs_external_resolution":0},"errors":[],"attempted":1},"error":null,"updated_at":"2026-05-24T01:24:52.629933+00:00"},"summary_claims":{"job_type":"summary_claims","status":"succeeded","result":{"title":"\" * write output.state after.block = add.period write newline","claims":[{"claim_text":"It compares the model's prediction for the entire trajec- tory against the ground-truth trajectory label, Ltraj(s, a): Ltraj = LBCE \u0010 Rϕ(s, a | x), Rtraj \u0011 (12) where σ(·) denotes the sigmoid function, which converts the model's raw logit outputs into probabilities. LBCE(·, ·) denotes the BCE loss function. For a ground-truth label L ∈ { 0, 1} and a model logit output Rϕ, it is defined as LBCE(Rϕ, L) = −[L log σ(Rϕ) + (1− L) log(1 − σ(Rϕ))], By jointly optimizing this objective, Fin-PRM is train","claim_type":"method","confidence":0.6,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks \" * write output.state after.block = add.period write newline because it crossed a citation-hub threshold. Current citing contexts most often use it as method evidence (1 contexts).","role_counts":[{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-05-24T01:24:52.634268+00:00"}},"summary":{"title":"\" * write output.state after.block = add.period write newline","claims":[{"claim_text":"It compares the model's prediction for the entire trajec- tory against the ground-truth trajectory label, Ltraj(s, a): Ltraj = LBCE \u0010 Rϕ(s, a | x), Rtraj \u0011 (12) where σ(·) denotes the sigmoid function, which converts the model's raw logit outputs into probabilities. LBCE(·, ·) denotes the BCE loss function. For a ground-truth label L ∈ { 0, 1} and a model logit output Rϕ, it is defined as LBCE(Rϕ, L) = −[L log σ(Rϕ) + (1− L) log(1 − σ(Rϕ))], By jointly optimizing this objective, Fin-PRM is train","claim_type":"method","confidence":0.6,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks \" * write output.state after.block = add.period write newline because it crossed a citation-hub threshold. Current citing contexts most often use it as method evidence (1 contexts).","role_counts":[{"n":1,"context_role":"method"}]},"graph":{"co_cited":[{"title":"write newline","work_id":"3b731e2d-843c-43f2-b9b6-7ffd356be7ad","shared_citers":70},{"title":"GPT-4 Technical Report","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","shared_citers":12},{"title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","shared_citers":6},{"title":"N.; Kaiser, .; and Polosukhin, I","work_id":"c2e36d5a-7b5e-4c5d-beae-a708921f9fad","shared_citers":6},{"title":"Language Models are Few-Shot Learners","work_id":"214732c0-2edd-44a0-af9e-28184a2b8279","shared_citers":5},{"title":"LLaMA: Open and Efficient Foundation Language Models","work_id":"c018fc23-6f3f-4035-9d02-28a2173b2b9d","shared_citers":5},{"title":"Proximal Policy Optimization Algorithms","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","shared_citers":5},{"title":"Qwen2.5 Technical Report","work_id":"d8432992-4980-4a81-85c7-9fa2c2b87f85","shared_citers":5},{"title":"W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; et al","work_id":"3179dbba-191c-42be-9257-26dd3b40ebb4","shared_citers":5},{"title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","work_id":"e96730e3-129b-4db6-b981-15ab7932e297","shared_citers":4},{"title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","shared_citers":4},{"title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","work_id":"41fe12c4-e538-4890-a244-480650ed3078","shared_citers":4},{"title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","work_id":"a1f2574b-a899-4713-be60-c87ba332656c","shared_citers":4},{"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","shared_citers":4},{"title":null,"work_id":"25ccec76-12ea-46da-8d7c-561322b965df","shared_citers":4},{"title":null,"work_id":"b0fef766-ce94-4d61-888f-714de61f4d49","shared_citers":4},{"title":"A Survey of Large Language Models","work_id":"de1b42b5-4a0a-4b1f-8c78-1f7fe21be6c9","shared_citers":3},{"title":"A Survey on LLM-as-a-Judge","work_id":"2676656a-67bd-4ad5-bad6-cb6f5fcdbfbe","shared_citers":3},{"title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","work_id":"ed240a10-5b19-406c-baa5-30803f465785","shared_citers":3},{"title":"Constitutional AI: Harmlessness from AI Feedback","work_id":"faaaa4e0-2676-4fac-a0b4-99aef10d2095","shared_citers":3},{"title":"D.; Dhariwal, P.; Neelakantan, A.; Shyam, P.; Sastry, G.; Askell, A.; et al","work_id":"3347d907-6b52-4759-a8d7-240fe31b8225","shared_citers":3},{"title":"Distilling the Knowledge in a Neural Network","work_id":"d927ab1f-17b8-4002-9d09-c3d55764fbad","shared_citers":3},{"title":"GPT-4o System Card","work_id":"f37bf1c7-4964-4e56-9762-d20da8d9009f","shared_citers":3},{"title":"LoRA: Low-Rank Adaptation of Large Language Models","work_id":"0426219a-789e-4964-adc8-a04538510818","shared_citers":3}],"time_series":[{"n":19,"year":2024},{"n":46,"year":2025},{"n":5,"year":2026}],"dependency_candidates":[]},"authors":[]}}