{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PLHLLMLOXQEESDXZMEDWBPMXNQ","short_pith_number":"pith:PLHLLMLO","schema_version":"1.0","canonical_sha256":"7aceb5b16ebc08490ef9610760bd976c002d533521aa38f3f83508f6c486ccda","source":{"kind":"arxiv","id":"1105.2024","version":2},"attestation_state":"computed","paper":{"title":"Symbols of One-Loop Integrals From Mixed Tate Motives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ph","math-ph","math.MP"],"primary_cat":"hep-th","authors_text":"Anastasia Volovich, Marcus Spradlin","submitted_at":"2011-05-10T19:21:34Z","abstract_excerpt":"We use a result on mixed Tate motives due to Goncharov (arXiv:alg-geom/9601021) to show that the symbol of an arbitrary one-loop 2m-gon integral in 2m dimensions may be read off directly from its Feynman parameterization. The algorithm proceeds via recursion in m seeded by the well-known box integrals in four dimensions. As a simple application of this method we write down the symbol of a three-mass hexagon integral in six dimensions."},"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":"1105.2024","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2011-05-10T19:21:34Z","cross_cats_sorted":["hep-ph","math-ph","math.MP"],"title_canon_sha256":"b56f67f39637b5f4934a3bbf68985a7db2922161aabab41fc4cfe576ce265640","abstract_canon_sha256":"fb7052bb5c6a1583a691ac75569d2d0d8f07edfa74e7c13182ce60b109fdfc4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:01.750297Z","signature_b64":"maD89Gf2AHgZf1yuL1lz1E3XtJ52LCEDmoOf39Gxm3qztb3UFmhvOHCcX29Fmh1PU4ZVoigPFYV6+c0oEg8YBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aceb5b16ebc08490ef9610760bd976c002d533521aa38f3f83508f6c486ccda","last_reissued_at":"2026-05-18T02:02:01.749551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:01.749551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbols of One-Loop Integrals From Mixed Tate Motives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ph","math-ph","math.MP"],"primary_cat":"hep-th","authors_text":"Anastasia Volovich, Marcus Spradlin","submitted_at":"2011-05-10T19:21:34Z","abstract_excerpt":"We use a result on mixed Tate motives due to Goncharov (arXiv:alg-geom/9601021) to show that the symbol of an arbitrary one-loop 2m-gon integral in 2m dimensions may be read off directly from its Feynman parameterization. The algorithm proceeds via recursion in m seeded by the well-known box integrals in four dimensions. As a simple application of this method we write down the symbol of a three-mass hexagon integral in six dimensions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2024","kind":"arxiv","version":2},"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":"1105.2024","created_at":"2026-05-18T02:02:01.749670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2024v2","created_at":"2026-05-18T02:02:01.749670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2024","created_at":"2026-05-18T02:02:01.749670+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLHLLMLOXQEE","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLHLLMLOXQEESDXZ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLHLLMLO","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2501.10551","citing_title":"An Empirical Study to Understand How Students Use ChatGPT for Writing Essays","ref_index":74,"is_internal_anchor":true},{"citing_arxiv_id":"2506.16453","citing_title":"Understanding the Challenges and Opportunities of Generative AI Apps: An Empirical Study","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"2512.02318","citing_title":"COGNITION: From Evaluation to Defense against Multimodal LLM CAPTCHA Solvers","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2601.14004","citing_title":"Locate, Steer, and Improve: A Practical Survey of Actionable Mechanistic Interpretability in Large Language Models","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.00851","citing_title":"Reliability of Large Language Models for Design Synthesis: An Empirical Study of Variance, Prompt Sensitivity, and Method Scaffolding","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22688","citing_title":"COMPASS: A Unified Decision-Intelligence System for Navigating Performance Trade-off in HPC","ref_index":164,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22688","citing_title":"COMPASS: A Unified Decision-Intelligence System for Navigating Performance Trade-off in HPC","ref_index":128,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ","json":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ.json","graph_json":"https://pith.science/api/pith-number/PLHLLMLOXQEESDXZMEDWBPMXNQ/graph.json","events_json":"https://pith.science/api/pith-number/PLHLLMLOXQEESDXZMEDWBPMXNQ/events.json","paper":"https://pith.science/paper/PLHLLMLO"},"agent_actions":{"view_html":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ","download_json":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ.json","view_paper":"https://pith.science/paper/PLHLLMLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2024&json=true","fetch_graph":"https://pith.science/api/pith-number/PLHLLMLOXQEESDXZMEDWBPMXNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PLHLLMLOXQEESDXZMEDWBPMXNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ/action/storage_attestation","attest_author":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ/action/author_attestation","sign_citation":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ/action/citation_signature","submit_replication":"https://pith.science/pith/PLHLLMLOXQEESDXZMEDWBPMXNQ/action/replication_record"}},"created_at":"2026-05-18T02:02:01.749670+00:00","updated_at":"2026-05-18T02:02:01.749670+00:00"}