{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QTSFYSIJZL5SYK7FHLLP2T7S7L","short_pith_number":"pith:QTSFYSIJ","schema_version":"1.0","canonical_sha256":"84e45c4909cafb2c2be53ad6fd4ff2fae85364d2bdfde2a6cf080fddf1a90363","source":{"kind":"arxiv","id":"0909.4277","version":1},"attestation_state":"computed","paper":{"title":"Sharp Bounds for Sums Associated to Graphs of Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OA","authors_text":"James A. Mingo (Queen's University), Roland Speicher (Queen's University)","submitted_at":"2009-09-23T19:04:56Z","abstract_excerpt":"We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form\n  S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices are constrained to be equal. The upper bound is easily obtained from a graph G associated to the constraints in the sum."},"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":"0909.4277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2009-09-23T19:04:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ffa319b370e334a44acb948e39b93fbdf5fbe068ce0e312544534edcd2086e28","abstract_canon_sha256":"06c5f547bd51679f7d9f88cd6880597c015c50a680c98adbb2f833bf543adf8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:32.467925Z","signature_b64":"QD0Z552RFfaVKmzF4D4/cMP/AKykZHlpjFZTGnYGm+LBHYKo0oTlmaqxa1AJ+sLW/hOol7XT7DWsMrH8yUQ2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84e45c4909cafb2c2be53ad6fd4ff2fae85364d2bdfde2a6cf080fddf1a90363","last_reissued_at":"2026-05-18T03:42:32.467182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:32.467182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Bounds for Sums Associated to Graphs of Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OA","authors_text":"James A. Mingo (Queen's University), Roland Speicher (Queen's University)","submitted_at":"2009-09-23T19:04:56Z","abstract_excerpt":"We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form\n  S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices are constrained to be equal. The upper bound is easily obtained from a graph G associated to the constraints in the sum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4277","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":"0909.4277","created_at":"2026-05-18T03:42:32.467301+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4277v1","created_at":"2026-05-18T03:42:32.467301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4277","created_at":"2026-05-18T03:42:32.467301+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTSFYSIJZL5S","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTSFYSIJZL5SYK7F","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTSFYSIJ","created_at":"2026-05-18T12:26:01.383474+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/QTSFYSIJZL5SYK7FHLLP2T7S7L","json":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L.json","graph_json":"https://pith.science/api/pith-number/QTSFYSIJZL5SYK7FHLLP2T7S7L/graph.json","events_json":"https://pith.science/api/pith-number/QTSFYSIJZL5SYK7FHLLP2T7S7L/events.json","paper":"https://pith.science/paper/QTSFYSIJ"},"agent_actions":{"view_html":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L","download_json":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L.json","view_paper":"https://pith.science/paper/QTSFYSIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4277&json=true","fetch_graph":"https://pith.science/api/pith-number/QTSFYSIJZL5SYK7FHLLP2T7S7L/graph.json","fetch_events":"https://pith.science/api/pith-number/QTSFYSIJZL5SYK7FHLLP2T7S7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L/action/storage_attestation","attest_author":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L/action/author_attestation","sign_citation":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L/action/citation_signature","submit_replication":"https://pith.science/pith/QTSFYSIJZL5SYK7FHLLP2T7S7L/action/replication_record"}},"created_at":"2026-05-18T03:42:32.467301+00:00","updated_at":"2026-05-18T03:42:32.467301+00:00"}