{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:45XUDCMPYOFGAL3WL2TYIFXM6I","short_pith_number":"pith:45XUDCMP","schema_version":"1.0","canonical_sha256":"e76f41898fc38a602f765ea78416ecf215c2f03a5229296409a5bf2c049b97e9","source":{"kind":"arxiv","id":"1306.3797","version":1},"attestation_state":"computed","paper":{"title":"Greedy algorithms and poset matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Luca Ferrari","submitted_at":"2013-06-17T10:12:27Z","abstract_excerpt":"We generalize the matroid-theoretic approach to greedy algorithms to the setting of poset matroids, in the sense of Barnabei, Nicoletti and Pezzoli (1998) [BNP]. We illustrate our result by providing a generalization of Kruskal algorithm (which finds a minimum spanning subtree of a weighted graph) to abstract simplicial complexes."},"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":"1306.3797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-17T10:12:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"06f4e4e8f8b336e230f7fd5814e8ffa2b0a272554cbd2a54a091f70b2de8bbcc","abstract_canon_sha256":"29330bf57bd31fa25bce9e8fd87df25872f9ca9bf7548059e8383ae49e91a279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:46.407197Z","signature_b64":"fVl9K/8qvDR2IDwz55oNjRE5P03HQ8giqmF4BVIIKX6siD0t1IfnQMWUyET6rM5nMaEWYfBbD7PakmiOLaniDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e76f41898fc38a602f765ea78416ecf215c2f03a5229296409a5bf2c049b97e9","last_reissued_at":"2026-05-18T03:20:46.406363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:46.406363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy algorithms and poset matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Luca Ferrari","submitted_at":"2013-06-17T10:12:27Z","abstract_excerpt":"We generalize the matroid-theoretic approach to greedy algorithms to the setting of poset matroids, in the sense of Barnabei, Nicoletti and Pezzoli (1998) [BNP]. We illustrate our result by providing a generalization of Kruskal algorithm (which finds a minimum spanning subtree of a weighted graph) to abstract simplicial complexes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3797","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":"1306.3797","created_at":"2026-05-18T03:20:46.406495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3797v1","created_at":"2026-05-18T03:20:46.406495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3797","created_at":"2026-05-18T03:20:46.406495+00:00"},{"alias_kind":"pith_short_12","alias_value":"45XUDCMPYOFG","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"45XUDCMPYOFGAL3W","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"45XUDCMP","created_at":"2026-05-18T12:27:32.513160+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/45XUDCMPYOFGAL3WL2TYIFXM6I","json":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I.json","graph_json":"https://pith.science/api/pith-number/45XUDCMPYOFGAL3WL2TYIFXM6I/graph.json","events_json":"https://pith.science/api/pith-number/45XUDCMPYOFGAL3WL2TYIFXM6I/events.json","paper":"https://pith.science/paper/45XUDCMP"},"agent_actions":{"view_html":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I","download_json":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I.json","view_paper":"https://pith.science/paper/45XUDCMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3797&json=true","fetch_graph":"https://pith.science/api/pith-number/45XUDCMPYOFGAL3WL2TYIFXM6I/graph.json","fetch_events":"https://pith.science/api/pith-number/45XUDCMPYOFGAL3WL2TYIFXM6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I/action/storage_attestation","attest_author":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I/action/author_attestation","sign_citation":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I/action/citation_signature","submit_replication":"https://pith.science/pith/45XUDCMPYOFGAL3WL2TYIFXM6I/action/replication_record"}},"created_at":"2026-05-18T03:20:46.406495+00:00","updated_at":"2026-05-18T03:20:46.406495+00:00"}