{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2GACNUQLP5GSXWNVMMQ4D5A4UX","short_pith_number":"pith:2GACNUQL","schema_version":"1.0","canonical_sha256":"d18026d20b7f4d2bd9b56321c1f41ca5d28e51f2518e0412d62e35a6f2fd11db","source":{"kind":"arxiv","id":"1411.5012","version":1},"attestation_state":"computed","paper":{"title":"Dilogarithm ladders from Wilson loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-th","authors_text":"Marco S. Bianchi, Matias Leoni","submitted_at":"2014-11-18T20:59:36Z","abstract_excerpt":"We consider a light-like Wilson loop in N=4 SYM evaluated on a regular n-polygon contour. Sending the number of edges to infinity the polygon approximates a circle and the expectation value of the light-like WL is expected to tend to the localization result for the circular one. We show this explicitly at one loop, providing a prescription to deal with the divergences of the light-like WL and the large n limit. Taking this limit entails evaluating certain sums of dilogarithms which, for a regular polygon, evaluate to the same constant independently of n. We show that this occurs thanks to unde"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.5012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2014-11-18T20:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"89bcdeca1a2efd6fcc7e60956406512cf10d351d6d843b2336ad69fc487432f4","abstract_canon_sha256":"a12942c305664f1566dc54f3cd16500481a1b20d742c77f2cd1ce96bba22bc01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:29.329597Z","signature_b64":"bCvQEzODaqICGrCVE2ciGUIX0rqicO9VAXzAx9kEDqNc2LatS1IVFEaM2rJPqnzXwcCJXbl/dE1/wQlkaEoeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18026d20b7f4d2bd9b56321c1f41ca5d28e51f2518e0412d62e35a6f2fd11db","last_reissued_at":"2026-05-18T01:41:29.328981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:29.328981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dilogarithm ladders from Wilson loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-th","authors_text":"Marco S. Bianchi, Matias Leoni","submitted_at":"2014-11-18T20:59:36Z","abstract_excerpt":"We consider a light-like Wilson loop in N=4 SYM evaluated on a regular n-polygon contour. Sending the number of edges to infinity the polygon approximates a circle and the expectation value of the light-like WL is expected to tend to the localization result for the circular one. We show this explicitly at one loop, providing a prescription to deal with the divergences of the light-like WL and the large n limit. Taking this limit entails evaluating certain sums of dilogarithms which, for a regular polygon, evaluate to the same constant independently of n. We show that this occurs thanks to unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5012","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.5012","created_at":"2026-05-18T01:41:29.329074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5012v1","created_at":"2026-05-18T01:41:29.329074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5012","created_at":"2026-05-18T01:41:29.329074+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GACNUQLP5GS","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GACNUQLP5GSXWNV","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GACNUQL","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX","json":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX.json","graph_json":"https://pith.science/api/pith-number/2GACNUQLP5GSXWNVMMQ4D5A4UX/graph.json","events_json":"https://pith.science/api/pith-number/2GACNUQLP5GSXWNVMMQ4D5A4UX/events.json","paper":"https://pith.science/paper/2GACNUQL"},"agent_actions":{"view_html":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX","download_json":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX.json","view_paper":"https://pith.science/paper/2GACNUQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5012&json=true","fetch_graph":"https://pith.science/api/pith-number/2GACNUQLP5GSXWNVMMQ4D5A4UX/graph.json","fetch_events":"https://pith.science/api/pith-number/2GACNUQLP5GSXWNVMMQ4D5A4UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX/action/storage_attestation","attest_author":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX/action/author_attestation","sign_citation":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX/action/citation_signature","submit_replication":"https://pith.science/pith/2GACNUQLP5GSXWNVMMQ4D5A4UX/action/replication_record"}},"created_at":"2026-05-18T01:41:29.329074+00:00","updated_at":"2026-05-18T01:41:29.329074+00:00"}