{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IHXUV4JHGEYWF5UCZNMEMJHVNW","short_pith_number":"pith:IHXUV4JH","schema_version":"1.0","canonical_sha256":"41ef4af127313162f682cb584624f56d8e55bb829781b4b3e25b529b5b35df16","source":{"kind":"arxiv","id":"1506.03176","version":2},"attestation_state":"computed","paper":{"title":"Symmetric tensors: rank, Strassen's conjecture and e-computability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"A.V. Geramita, E. Carlini, L. Chiantini, M.V. Catalisano, Y. Woo","submitted_at":"2015-06-10T05:58:55Z","abstract_excerpt":"In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new cases."},"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":"1506.03176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2015-06-10T05:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"a52b66148f421557204db8f629b35128d29f1553879d699534282fa2c7171d29","abstract_canon_sha256":"b68d62d3f4a790480a32b0e09cb21addf3ab26addaa8db81baf5d4cbebcc76b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:08.557124Z","signature_b64":"A+NMRc6Sb8kMPcw1mSmdb73DVBrpAfapoFX8yKVQJcbjsv3QIaTmIqHL5r/IwUphckwv5BaO9+tXVFmaZK0DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41ef4af127313162f682cb584624f56d8e55bb829781b4b3e25b529b5b35df16","last_reissued_at":"2026-05-18T01:53:08.556696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:08.556696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric tensors: rank, Strassen's conjecture and e-computability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"A.V. Geramita, E. Carlini, L. Chiantini, M.V. Catalisano, Y. Woo","submitted_at":"2015-06-10T05:58:55Z","abstract_excerpt":"In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03176","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":"1506.03176","created_at":"2026-05-18T01:53:08.556762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03176v2","created_at":"2026-05-18T01:53:08.556762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03176","created_at":"2026-05-18T01:53:08.556762+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHXUV4JHGEYW","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHXUV4JHGEYWF5UC","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHXUV4JH","created_at":"2026-05-18T12:29:25.134429+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/IHXUV4JHGEYWF5UCZNMEMJHVNW","json":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW.json","graph_json":"https://pith.science/api/pith-number/IHXUV4JHGEYWF5UCZNMEMJHVNW/graph.json","events_json":"https://pith.science/api/pith-number/IHXUV4JHGEYWF5UCZNMEMJHVNW/events.json","paper":"https://pith.science/paper/IHXUV4JH"},"agent_actions":{"view_html":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW","download_json":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW.json","view_paper":"https://pith.science/paper/IHXUV4JH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03176&json=true","fetch_graph":"https://pith.science/api/pith-number/IHXUV4JHGEYWF5UCZNMEMJHVNW/graph.json","fetch_events":"https://pith.science/api/pith-number/IHXUV4JHGEYWF5UCZNMEMJHVNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW/action/storage_attestation","attest_author":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW/action/author_attestation","sign_citation":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW/action/citation_signature","submit_replication":"https://pith.science/pith/IHXUV4JHGEYWF5UCZNMEMJHVNW/action/replication_record"}},"created_at":"2026-05-18T01:53:08.556762+00:00","updated_at":"2026-05-18T01:53:08.556762+00:00"}