{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G5MVELSDNK2AFB2FZ6GHCT7YSK","short_pith_number":"pith:G5MVELSD","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"},"canonical_sha256":"3759522e436ab4028745cf8c714ff8929885e31881c47d0419423814e0871007","source":{"kind":"arxiv","id":"1703.03961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03961","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03961v1","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03961","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"G5MVELSDNK2A","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5MVELSDNK2AFB2F","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5MVELSD","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G5MVELSDNK2AFB2FZ6GHCT7YSK","target":"record","payload":{"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"},"canonical_sha256":"3759522e436ab4028745cf8c714ff8929885e31881c47d0419423814e0871007","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"},"source_kind":"arxiv","source_id":"1703.03961","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4o/tdMidbkWjwfHhjcr2gvMBKN+I4vLhN6czOQh5qNU22uiwCPLxq+UObf+gxnAyIs2vwgNYMgVX6+M5hDnpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:10:49.434644Z"},"content_sha256":"17527b94be3e80d67b87fe4724697373e68c90fe6a7bd3062d1a925092dfd99d","schema_version":"1.0","event_id":"sha256:17527b94be3e80d67b87fe4724697373e68c90fe6a7bd3062d1a925092dfd99d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G5MVELSDNK2AFB2FZ6GHCT7YSK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqS9pkOAnbWGthBcIwyAalAVZMVg8oApEcpqUUz04ZjVvGw26oipMazfumHBe2FBGQrpEf4dajw3yIIb0yMMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:10:49.434986Z"},"content_sha256":"8a8ba6cd57620fdcdd5a5986bf12f746658e04c85128f3460c4c9c85da9ac9e3","schema_version":"1.0","event_id":"sha256:8a8ba6cd57620fdcdd5a5986bf12f746658e04c85128f3460c4c9c85da9ac9e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/bundle.json","state_url":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T18:10:49Z","links":{"resolver":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK","bundle":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/bundle.json","state":"https://pith.science/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5MVELSDNK2AFB2FZ6GHCT7YSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G5MVELSDNK2AFB2FZ6GHCT7YSK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"42934a300e2fdf28e3ebff16abc27509a18c02d10595e691b70a6dde51d8e060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-03-11T12:10:07Z","title_canon_sha256":"02353b9b69a39b2082ca212966f10b87be34dce4de2b61c7eee2a48849a6ce88"},"schema_version":"1.0","source":{"id":"1703.03961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03961","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03961v1","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03961","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"G5MVELSDNK2A","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5MVELSDNK2AFB2F","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5MVELSD","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8a8ba6cd57620fdcdd5a5986bf12f746658e04c85128f3460c4c9c85da9ac9e3","target":"graph","created_at":"2026-05-18T00:48:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Steven Charlton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-03-11T12:10:07Z","title":"A review of Dan's reduction method for multiple polylogarithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03961","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:17527b94be3e80d67b87fe4724697373e68c90fe6a7bd3062d1a925092dfd99d","target":"record","created_at":"2026-05-18T00:48:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"42934a300e2fdf28e3ebff16abc27509a18c02d10595e691b70a6dde51d8e060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-03-11T12:10:07Z","title_canon_sha256":"02353b9b69a39b2082ca212966f10b87be34dce4de2b61c7eee2a48849a6ce88"},"schema_version":"1.0","source":{"id":"1703.03961","kind":"arxiv","version":1}},"canonical_sha256":"3759522e436ab4028745cf8c714ff8929885e31881c47d0419423814e0871007","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3759522e436ab4028745cf8c714ff8929885e31881c47d0419423814e0871007","first_computed_at":"2026-05-18T00:48:52.588972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:52.588972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ORvz+hd6DpeYVjJULm2cTxhIvQfi/X/LkBNUmIlS1WmWSNNm/G4VXsW/7G7HpDZdyBY+3ZrR5Q4dqARdQ93fDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:52.589748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17527b94be3e80d67b87fe4724697373e68c90fe6a7bd3062d1a925092dfd99d","sha256:8a8ba6cd57620fdcdd5a5986bf12f746658e04c85128f3460c4c9c85da9ac9e3"],"state_sha256":"757d736c34eac737f5c79151cd3e478bd5ab828de2d218685c86a54a8a645571"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMctMceFi2g3CROFc8fzmxwrzmDf84qg4Tsr8pXlPRSN0Sry4J7T+RPNn7buPEgdIx/gYgWYVyhIlEW3wp16Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T18:10:49.436869Z","bundle_sha256":"337b50445717383a9d3ae399ec8befedecf8621fcef8b595806c64d09cc7c697"}}