{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GMPDSIODUTMLW3FNGJRPBOHLIO","short_pith_number":"pith:GMPDSIOD","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"},"canonical_sha256":"331e3921c3a4d8bb6cad3262f0b8eb43b3f08f1be4f34d9a4de9ba5c41535ba9","source":{"kind":"arxiv","id":"1107.4301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4301","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4301v1","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4301","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"GMPDSIODUTML","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GMPDSIODUTMLW3FN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GMPDSIOD","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GMPDSIODUTMLW3FNGJRPBOHLIO","target":"record","payload":{"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"},"canonical_sha256":"331e3921c3a4d8bb6cad3262f0b8eb43b3f08f1be4f34d9a4de9ba5c41535ba9","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"},"source_kind":"arxiv","source_id":"1107.4301","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXdCEHn/iEThoC7nTPYXc5ed9uf9CYaNGMt4N32BP6BYLWvaRE5I2fkafFVGbMXofrSNuFjZR4vmlhHtfk4aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:26:35.075224Z"},"content_sha256":"c9a7c7e3351dd3be7776628870fe00c12601756e32dcabfd4e7efffe43a6fac7","schema_version":"1.0","event_id":"sha256:c9a7c7e3351dd3be7776628870fe00c12601756e32dcabfd4e7efffe43a6fac7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GMPDSIODUTMLW3FNGJRPBOHLIO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBYCVdiMcdqb9GIV2bgwlupIMOzPPdWgUvS/2faOL72Z8rvUHRtv1dVVuO2Sq976auNBs3fiCeVUdoYDFlfPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:26:35.075605Z"},"content_sha256":"34f4e628d6b48843f83729697a01059146610768dba2e4a92fca6c6f32e00c21","schema_version":"1.0","event_id":"sha256:34f4e628d6b48843f83729697a01059146610768dba2e4a92fca6c6f32e00c21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/bundle.json","state_url":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T05:26:35Z","links":{"resolver":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO","bundle":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/bundle.json","state":"https://pith.science/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMPDSIODUTMLW3FNGJRPBOHLIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GMPDSIODUTMLW3FNGJRPBOHLIO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3c9459c5b53d859d5ff5275c1ebb5706148dcffdc9e206a6bf9067473a4077ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-21T15:49:32Z","title_canon_sha256":"5bad77c7bfc2b534201b6ea367e17cb9715eb9338989d9772eef112dc36b7c29"},"schema_version":"1.0","source":{"id":"1107.4301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4301","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4301v1","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4301","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"GMPDSIODUTML","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GMPDSIODUTMLW3FN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GMPDSIOD","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:34f4e628d6b48843f83729697a01059146610768dba2e4a92fca6c6f32e00c21","target":"graph","created_at":"2026-05-18T04:17:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"A. Montina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-21T15:49:32Z","title":"Output-sensitive algorithm for generating the flats of a matroid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4301","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c9a7c7e3351dd3be7776628870fe00c12601756e32dcabfd4e7efffe43a6fac7","target":"record","created_at":"2026-05-18T04:17:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3c9459c5b53d859d5ff5275c1ebb5706148dcffdc9e206a6bf9067473a4077ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-21T15:49:32Z","title_canon_sha256":"5bad77c7bfc2b534201b6ea367e17cb9715eb9338989d9772eef112dc36b7c29"},"schema_version":"1.0","source":{"id":"1107.4301","kind":"arxiv","version":1}},"canonical_sha256":"331e3921c3a4d8bb6cad3262f0b8eb43b3f08f1be4f34d9a4de9ba5c41535ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"331e3921c3a4d8bb6cad3262f0b8eb43b3f08f1be4f34d9a4de9ba5c41535ba9","first_computed_at":"2026-05-18T04:17:12.801412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:12.801412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C3CXpHCqr3d5N93tdE9y2kLhY0Dv9qEWU3LSKhlJSmROTMTHV/iSy401r8CdGbwGvLYVfiG7qrJHOECFQK4bAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:12.802070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9a7c7e3351dd3be7776628870fe00c12601756e32dcabfd4e7efffe43a6fac7","sha256:34f4e628d6b48843f83729697a01059146610768dba2e4a92fca6c6f32e00c21"],"state_sha256":"eb0d11b9095c14e06c9730854b98c8706f4560a950644ceb559484f018c128a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anDqiDAb6UwLzsJIMPOwjSvJ7SI3slYeDIDmYGpdiovZ58V4KYo8xAh/Gb6zTAW+ZJZhQjgouSXnVPJTfh9OBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T05:26:35.078868Z","bundle_sha256":"5b4d0e1df36ebe569c446447409ffe76b09a4a8ca8d8eb67ba1776ce6dfe6ad9"}}