{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G5MVELSDNK2AFB2FZ6GHCT7YSK","short_pith_number":"pith:G5MVELSD","schema_version":"1.0","canonical_sha256":"3759522e436ab4028745cf8c714ff8929885e31881c47d0419423814e0871007","source":{"kind":"arxiv","id":"1703.03961","version":1},"attestation_state":"computed","paper":{"title":"A review of Dan's reduction method for multiple polylogarithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Steven Charlton","submitted_at":"2017-03-11T12:10:07Z","abstract_excerpt":"In this paper we will give an account of Dan's reduction method for reducing the weight $ n $ multiple logarithm $ I_{1,1,\\ldots,1}(x_1, x_2, \\ldots, x_n) $ to an explicit sum of lower depth multiple polylogarithms in $ \\leq n - 2 $ variables.\n  We provide a detailed explanation of the method Dan outlines, and we fill in the missing proofs for Dan's claims. This establishes the validity of the method itself, and allows us to produce a corrected version of Dan's reduction of $ I_{1,1,1,1} $ to $ I_{3,1} $'s and $ I_4 $'s. We then use the symbol of multiple polylogarithms to answer Dan's questio"},"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":"1703.03961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-03-11T12:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"02353b9b69a39b2082ca212966f10b87be34dce4de2b61c7eee2a48849a6ce88","abstract_canon_sha256":"42934a300e2fdf28e3ebff16abc27509a18c02d10595e691b70a6dde51d8e060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:52.589748Z","signature_b64":"ORvz+hd6DpeYVjJULm2cTxhIvQfi/X/LkBNUmIlS1WmWSNNm/G4VXsW/7G7HpDZdyBY+3ZrR5Q4dqARdQ93fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3759522e436ab4028745cf8c714ff8929885e31881c47d0419423814e0871007","last_reissued_at":"2026-05-18T00:48:52.588972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:52.588972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A review of Dan's reduction method for multiple polylogarithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Steven Charlton","submitted_at":"2017-03-11T12:10:07Z","abstract_excerpt":"In this paper we will give an account of Dan's reduction method for reducing the weight $ n $ multiple logarithm $ I_{1,1,\\ldots,1}(x_1, x_2, \\ldots, x_n) $ to an explicit sum of lower depth multiple polylogarithms in $ \\leq n - 2 $ variables.\n  We provide a detailed explanation of the method Dan outlines, and we fill in the missing proofs for Dan's claims. This establishes the validity of the method itself, and allows us to produce a corrected version of Dan's reduction of $ I_{1,1,1,1} $ to $ I_{3,1} $'s and $ I_4 $'s. We then use the symbol of multiple polylogarithms to answer Dan's questio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03961","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":"1703.03961","created_at":"2026-05-18T00:48:52.589104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03961v1","created_at":"2026-05-18T00:48:52.589104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03961","created_at":"2026-05-18T00:48:52.589104+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5MVELSDNK2A","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5MVELSDNK2AFB2F","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5MVELSD","created_at":"2026-05-18T12:31:15.632608+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/G5MVELSDNK2AFB2FZ6GHCT7YSK","json":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK.json","graph_json":"https://pith.science/api/pith-number/G5MVELSDNK2AFB2FZ6GHCT7YSK/graph.json","events_json":"https://pith.science/api/pith-number/G5MVELSDNK2AFB2FZ6GHCT7YSK/events.json","paper":"https://pith.science/paper/G5MVELSD"},"agent_actions":{"view_html":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK","download_json":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK.json","view_paper":"https://pith.science/paper/G5MVELSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03961&json=true","fetch_graph":"https://pith.science/api/pith-number/G5MVELSDNK2AFB2FZ6GHCT7YSK/graph.json","fetch_events":"https://pith.science/api/pith-number/G5MVELSDNK2AFB2FZ6GHCT7YSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/action/storage_attestation","attest_author":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/action/author_attestation","sign_citation":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/action/citation_signature","submit_replication":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/action/replication_record"}},"created_at":"2026-05-18T00:48:52.589104+00:00","updated_at":"2026-05-18T00:48:52.589104+00:00"}