{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GMPDSIODUTMLW3FNGJRPBOHLIO","short_pith_number":"pith:GMPDSIOD","schema_version":"1.0","canonical_sha256":"331e3921c3a4d8bb6cad3262f0b8eb43b3f08f1be4f34d9a4de9ba5c41535ba9","source":{"kind":"arxiv","id":"1107.4301","version":1},"attestation_state":"computed","paper":{"title":"Output-sensitive algorithm for generating the flats of a matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Montina","submitted_at":"2011-07-21T15:49:32Z","abstract_excerpt":"We present an output-sensitive algorithm for generating the whole set of flats of a finite matroid. Given a procedure, P, that decides in S_P time steps if a set is independent, the time complexity of the algorithm is O(N^2 M S_P), where N and M are the input and output size, respectively. In the case of vectorial matroids, a specific algorithm is reported whose time complexity is equal to O(N^2 M d^2), d being the rank of the matroid. In some cases this algorithm can provide an efficient method for computing zonotopes in $H$-representation, given their representation in terms of Minkowski 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":"1107.4301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-21T15:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"5bad77c7bfc2b534201b6ea367e17cb9715eb9338989d9772eef112dc36b7c29","abstract_canon_sha256":"3c9459c5b53d859d5ff5275c1ebb5706148dcffdc9e206a6bf9067473a4077ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:12.802070Z","signature_b64":"C3CXpHCqr3d5N93tdE9y2kLhY0Dv9qEWU3LSKhlJSmROTMTHV/iSy401r8CdGbwGvLYVfiG7qrJHOECFQK4bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"331e3921c3a4d8bb6cad3262f0b8eb43b3f08f1be4f34d9a4de9ba5c41535ba9","last_reissued_at":"2026-05-18T04:17:12.801412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:12.801412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Output-sensitive algorithm for generating the flats of a matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Montina","submitted_at":"2011-07-21T15:49:32Z","abstract_excerpt":"We present an output-sensitive algorithm for generating the whole set of flats of a finite matroid. Given a procedure, P, that decides in S_P time steps if a set is independent, the time complexity of the algorithm is O(N^2 M S_P), where N and M are the input and output size, respectively. In the case of vectorial matroids, a specific algorithm is reported whose time complexity is equal to O(N^2 M d^2), d being the rank of the matroid. In some cases this algorithm can provide an efficient method for computing zonotopes in $H$-representation, given their representation in terms of Minkowski sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4301","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":"1107.4301","created_at":"2026-05-18T04:17:12.801525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4301v1","created_at":"2026-05-18T04:17:12.801525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4301","created_at":"2026-05-18T04:17:12.801525+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMPDSIODUTML","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMPDSIODUTMLW3FN","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMPDSIOD","created_at":"2026-05-18T12:26:30.835961+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/GMPDSIODUTMLW3FNGJRPBOHLIO","json":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO.json","graph_json":"https://pith.science/api/pith-number/GMPDSIODUTMLW3FNGJRPBOHLIO/graph.json","events_json":"https://pith.science/api/pith-number/GMPDSIODUTMLW3FNGJRPBOHLIO/events.json","paper":"https://pith.science/paper/GMPDSIOD"},"agent_actions":{"view_html":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO","download_json":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO.json","view_paper":"https://pith.science/paper/GMPDSIOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4301&json=true","fetch_graph":"https://pith.science/api/pith-number/GMPDSIODUTMLW3FNGJRPBOHLIO/graph.json","fetch_events":"https://pith.science/api/pith-number/GMPDSIODUTMLW3FNGJRPBOHLIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/action/storage_attestation","attest_author":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/action/author_attestation","sign_citation":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/action/citation_signature","submit_replication":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/action/replication_record"}},"created_at":"2026-05-18T04:17:12.801525+00:00","updated_at":"2026-05-18T04:17:12.801525+00:00"}