{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KJY3LFSU4EM4LR7ZQUXUJ2JHUV","short_pith_number":"pith:KJY3LFSU","schema_version":"1.0","canonical_sha256":"5271b59654e119c5c7f9852f44e927a5417bbbccc235aa9dc3f6d23e5ce641a8","source":{"kind":"arxiv","id":"1103.2581","version":1},"attestation_state":"computed","paper":{"title":"Constant-Time Algorithms for Sparsity Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida","submitted_at":"2011-03-14T03:51:27Z","abstract_excerpt":"A graph $G=(V,E)$ is called $(k,\\ell)$-full if $G$ contains a subgraph $H=(V,F)$ of $k|V|-\\ell$ edges such that, for any non-empty $F' \\subseteq F$, $|F'| \\leq k|V(F')| - \\ell$ holds. Here, $V(F')$ denotes the set of vertices incident to $F'$. It is known that the family of edge sets of $(k,\\ell)$-full graphs forms a family of matroid, known as the sparsity matroid of $G$. In this paper, we give a constant-time approximation algorithm for the rank of the sparsity matroid of a degree-bounded undirected graph. This leads to a constant-time tester for $(k,\\ell)$-fullness in the bounded-degree mod"},"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":"1103.2581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T03:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"0d3312b57317eb0075776f6503b0ee265df20f3498f5ce1f00c9da3a71bb0348","abstract_canon_sha256":"b42f0b763fd57ad8fe8ea1ce2ce2ab1a20e500e53a87eb28605cd1d5dfc381ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:55.050517Z","signature_b64":"ZG3FyvGUur3OC2I0mtFCf7aW5grAao1wCDx64d0XOrAk35spa96NTbtM2vLojf0h7LJ5vq9wqYd+I0Yz8GpxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5271b59654e119c5c7f9852f44e927a5417bbbccc235aa9dc3f6d23e5ce641a8","last_reissued_at":"2026-05-18T04:26:55.050109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:55.050109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Time Algorithms for Sparsity Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida","submitted_at":"2011-03-14T03:51:27Z","abstract_excerpt":"A graph $G=(V,E)$ is called $(k,\\ell)$-full if $G$ contains a subgraph $H=(V,F)$ of $k|V|-\\ell$ edges such that, for any non-empty $F' \\subseteq F$, $|F'| \\leq k|V(F')| - \\ell$ holds. Here, $V(F')$ denotes the set of vertices incident to $F'$. It is known that the family of edge sets of $(k,\\ell)$-full graphs forms a family of matroid, known as the sparsity matroid of $G$. In this paper, we give a constant-time approximation algorithm for the rank of the sparsity matroid of a degree-bounded undirected graph. This leads to a constant-time tester for $(k,\\ell)$-fullness in the bounded-degree mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2581","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":"1103.2581","created_at":"2026-05-18T04:26:55.050168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2581v1","created_at":"2026-05-18T04:26:55.050168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2581","created_at":"2026-05-18T04:26:55.050168+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJY3LFSU4EM4","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJY3LFSU4EM4LR7Z","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJY3LFSU","created_at":"2026-05-18T12:26:32.869790+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/KJY3LFSU4EM4LR7ZQUXUJ2JHUV","json":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV.json","graph_json":"https://pith.science/api/pith-number/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/graph.json","events_json":"https://pith.science/api/pith-number/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/events.json","paper":"https://pith.science/paper/KJY3LFSU"},"agent_actions":{"view_html":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV","download_json":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV.json","view_paper":"https://pith.science/paper/KJY3LFSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2581&json=true","fetch_graph":"https://pith.science/api/pith-number/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/graph.json","fetch_events":"https://pith.science/api/pith-number/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/action/storage_attestation","attest_author":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/action/author_attestation","sign_citation":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/action/citation_signature","submit_replication":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/action/replication_record"}},"created_at":"2026-05-18T04:26:55.050168+00:00","updated_at":"2026-05-18T04:26:55.050168+00:00"}