{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KZP75SQVCGTHGZMU4KXFZDHXLC","short_pith_number":"pith:KZP75SQV","schema_version":"1.0","canonical_sha256":"565ffeca1511a6736594e2ae5c8cf7588ea1853cc20f780975a3e3edf8ccd2ae","source":{"kind":"arxiv","id":"1606.03259","version":4},"attestation_state":"computed","paper":{"title":"New Upper Bounds for Equiangular Lines by Pillar Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Emily J. King, Xiaoxian Tang","submitted_at":"2016-06-10T10:23:56Z","abstract_excerpt":"We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear algebra and combinatorial arguments to bound the number of vectors within an equiangular set which have inner products of certain signs with a negative clique. After projection and rescaling, such sets are also certain spherical two-distance sets, and semidefinite programming techniques may be used to bound the size. Applying our method, we prove new relative bou"},"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":"1606.03259","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-10T10:23:56Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"46e931dfabe5be6867862ab504aed234379226eea6b3247e082fb9bcddc1c5bd","abstract_canon_sha256":"34ef501d5316d99b3603afd16780c584384cdb1786b6a352f00f8e27bec0830b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:00.265090Z","signature_b64":"J/a5RV6QEpRepx/bud3RoekVU8FpLQCKpgZ8Pr/YeSgqZ3pDSgnrGrp6hyn8CTlOksoU3TbMffXGVz5JNN5yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"565ffeca1511a6736594e2ae5c8cf7588ea1853cc20f780975a3e3edf8ccd2ae","last_reissued_at":"2026-05-18T00:15:00.264343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:00.264343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Upper Bounds for Equiangular Lines by Pillar Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Emily J. King, Xiaoxian Tang","submitted_at":"2016-06-10T10:23:56Z","abstract_excerpt":"We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear algebra and combinatorial arguments to bound the number of vectors within an equiangular set which have inner products of certain signs with a negative clique. After projection and rescaling, such sets are also certain spherical two-distance sets, and semidefinite programming techniques may be used to bound the size. Applying our method, we prove new relative bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03259","kind":"arxiv","version":4},"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":"1606.03259","created_at":"2026-05-18T00:15:00.264468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03259v4","created_at":"2026-05-18T00:15:00.264468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03259","created_at":"2026-05-18T00:15:00.264468+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZP75SQVCGTH","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZP75SQVCGTHGZMU","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZP75SQV","created_at":"2026-05-18T12:30:29.479603+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/KZP75SQVCGTHGZMU4KXFZDHXLC","json":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC.json","graph_json":"https://pith.science/api/pith-number/KZP75SQVCGTHGZMU4KXFZDHXLC/graph.json","events_json":"https://pith.science/api/pith-number/KZP75SQVCGTHGZMU4KXFZDHXLC/events.json","paper":"https://pith.science/paper/KZP75SQV"},"agent_actions":{"view_html":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC","download_json":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC.json","view_paper":"https://pith.science/paper/KZP75SQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03259&json=true","fetch_graph":"https://pith.science/api/pith-number/KZP75SQVCGTHGZMU4KXFZDHXLC/graph.json","fetch_events":"https://pith.science/api/pith-number/KZP75SQVCGTHGZMU4KXFZDHXLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC/action/storage_attestation","attest_author":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC/action/author_attestation","sign_citation":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC/action/citation_signature","submit_replication":"https://pith.science/pith/KZP75SQVCGTHGZMU4KXFZDHXLC/action/replication_record"}},"created_at":"2026-05-18T00:15:00.264468+00:00","updated_at":"2026-05-18T00:15:00.264468+00:00"}