{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:POZZHYP6CKPDUYPQDYZOV4KIIK","short_pith_number":"pith:POZZHYP6","schema_version":"1.0","canonical_sha256":"7bb393e1fe129e3a61f01e32eaf148428e0fe23d171d31ee1b828f806966b414","source":{"kind":"arxiv","id":"2502.09530","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous generating sets for flags","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Chayim Lowen, Federico Glaudo, Noah Kravitz","submitted_at":"2025-02-13T17:43:43Z","abstract_excerpt":"We prove that any triple of complete flags in $\\mathbb R^d$ admits a common generating set of size $\\lfloor 5d/3\\rfloor$ and that this bound is sharp. This result extends the classical linear-algebraic fact -- a consequence of the Bruhat decomposition of $\\text{GL}_d(\\mathbb R)$ -- that any pair of complete flags in $\\mathbb R^d$ admits a common generating set of size $d$. We also deduce an analogue for $m$-tuples of flags with $m>3$."},"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":"2502.09530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-13T17:43:43Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"e712744b039e2183c12bdc902a5a727dc0a5a507ea49706b75dad7db4ad400bc","abstract_canon_sha256":"c5e064e3e82a457470a76b925c6d9d0f7cbfcadf9e35a8faf9bc50de7c14ae43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:59.029595Z","signature_b64":"pHGdXVE3zZAnW4tGdwNvI3Po4WDWO2IcsMTjOU0c62sCCI6yzLBgtqFinr5UtTRniDo8IS4bmoMDyWSnwSLdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bb393e1fe129e3a61f01e32eaf148428e0fe23d171d31ee1b828f806966b414","last_reissued_at":"2026-07-05T10:13:59.029114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:59.029114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous generating sets for flags","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Chayim Lowen, Federico Glaudo, Noah Kravitz","submitted_at":"2025-02-13T17:43:43Z","abstract_excerpt":"We prove that any triple of complete flags in $\\mathbb R^d$ admits a common generating set of size $\\lfloor 5d/3\\rfloor$ and that this bound is sharp. This result extends the classical linear-algebraic fact -- a consequence of the Bruhat decomposition of $\\text{GL}_d(\\mathbb R)$ -- that any pair of complete flags in $\\mathbb R^d$ admits a common generating set of size $d$. We also deduce an analogue for $m$-tuples of flags with $m>3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09530","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.09530/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.09530","created_at":"2026-07-05T10:13:59.029170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09530v1","created_at":"2026-07-05T10:13:59.029170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09530","created_at":"2026-07-05T10:13:59.029170+00:00"},{"alias_kind":"pith_short_12","alias_value":"POZZHYP6CKPD","created_at":"2026-07-05T10:13:59.029170+00:00"},{"alias_kind":"pith_short_16","alias_value":"POZZHYP6CKPDUYPQ","created_at":"2026-07-05T10:13:59.029170+00:00"},{"alias_kind":"pith_short_8","alias_value":"POZZHYP6","created_at":"2026-07-05T10:13:59.029170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07913","citing_title":"A majorization relation for a sum of two tensor products of positive semidefinite operators","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK","json":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK.json","graph_json":"https://pith.science/api/pith-number/POZZHYP6CKPDUYPQDYZOV4KIIK/graph.json","events_json":"https://pith.science/api/pith-number/POZZHYP6CKPDUYPQDYZOV4KIIK/events.json","paper":"https://pith.science/paper/POZZHYP6"},"agent_actions":{"view_html":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK","download_json":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK.json","view_paper":"https://pith.science/paper/POZZHYP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09530&json=true","fetch_graph":"https://pith.science/api/pith-number/POZZHYP6CKPDUYPQDYZOV4KIIK/graph.json","fetch_events":"https://pith.science/api/pith-number/POZZHYP6CKPDUYPQDYZOV4KIIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK/action/storage_attestation","attest_author":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK/action/author_attestation","sign_citation":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK/action/citation_signature","submit_replication":"https://pith.science/pith/POZZHYP6CKPDUYPQDYZOV4KIIK/action/replication_record"}},"created_at":"2026-07-05T10:13:59.029170+00:00","updated_at":"2026-07-05T10:13:59.029170+00:00"}