{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OMBTF4MTQNCAY2JFLF2RDYGVKL","short_pith_number":"pith:OMBTF4MT","schema_version":"1.0","canonical_sha256":"730332f19383440c6925597511e0d552e72172ccdc401ff1bde2662afa1adf2f","source":{"kind":"arxiv","id":"1705.02299","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the tensor rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.AG","authors_text":"Alessandra Bernardi, Edoardo Ballico, Elena Guardo, Luca Chiantini","submitted_at":"2017-05-05T17:00:47Z","abstract_excerpt":"We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and unique."},"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":"1705.02299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-05-05T17:00:47Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"e121bc6dca715924d9522ba2b591c0b4ae9a4259c072f3d6c2de3ae91a0d7c1a","abstract_canon_sha256":"0444cd03fd2ed590c6dd0bcc0d65b1625b5d6be431dafdccce526d0f046ffe04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:58.643225Z","signature_b64":"2NHBI3Ru/HKCXGOQ8p65XaHS1xJEvneOUtDeTQIL6ZxFAcXdN70pAS26SabL94Be99YdNhzyCho4eAaHR1IpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"730332f19383440c6925597511e0d552e72172ccdc401ff1bde2662afa1adf2f","last_reissued_at":"2026-05-18T00:44:58.642877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:58.642877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the tensor rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.AG","authors_text":"Alessandra Bernardi, Edoardo Ballico, Elena Guardo, Luca Chiantini","submitted_at":"2017-05-05T17:00:47Z","abstract_excerpt":"We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and unique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02299","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":"1705.02299","created_at":"2026-05-18T00:44:58.642935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02299v1","created_at":"2026-05-18T00:44:58.642935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02299","created_at":"2026-05-18T00:44:58.642935+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMBTF4MTQNCA","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMBTF4MTQNCAY2JF","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMBTF4MT","created_at":"2026-05-18T12:31:34.259226+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/OMBTF4MTQNCAY2JFLF2RDYGVKL","json":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL.json","graph_json":"https://pith.science/api/pith-number/OMBTF4MTQNCAY2JFLF2RDYGVKL/graph.json","events_json":"https://pith.science/api/pith-number/OMBTF4MTQNCAY2JFLF2RDYGVKL/events.json","paper":"https://pith.science/paper/OMBTF4MT"},"agent_actions":{"view_html":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL","download_json":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL.json","view_paper":"https://pith.science/paper/OMBTF4MT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02299&json=true","fetch_graph":"https://pith.science/api/pith-number/OMBTF4MTQNCAY2JFLF2RDYGVKL/graph.json","fetch_events":"https://pith.science/api/pith-number/OMBTF4MTQNCAY2JFLF2RDYGVKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL/action/storage_attestation","attest_author":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL/action/author_attestation","sign_citation":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL/action/citation_signature","submit_replication":"https://pith.science/pith/OMBTF4MTQNCAY2JFLF2RDYGVKL/action/replication_record"}},"created_at":"2026-05-18T00:44:58.642935+00:00","updated_at":"2026-05-18T00:44:58.642935+00:00"}