{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KJY3LFSU4EM4LR7ZQUXUJ2JHUV","short_pith_number":"pith:KJY3LFSU","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"},"canonical_sha256":"5271b59654e119c5c7f9852f44e927a5417bbbccc235aa9dc3f6d23e5ce641a8","source":{"kind":"arxiv","id":"1103.2581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2581","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2581v1","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2581","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"KJY3LFSU4EM4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KJY3LFSU4EM4LR7Z","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KJY3LFSU","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KJY3LFSU4EM4LR7ZQUXUJ2JHUV","target":"record","payload":{"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"},"canonical_sha256":"5271b59654e119c5c7f9852f44e927a5417bbbccc235aa9dc3f6d23e5ce641a8","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"},"source_kind":"arxiv","source_id":"1103.2581","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:26:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1/yq6WW8cRnOUq8aA9nIIZnqezXQYKkVi5bxneRK3cITuGDAWGOsX0BhSHo/LZ6Mon/bcfQw39F5vmINit8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:00:34.431060Z"},"content_sha256":"02c301e7ab04dd5499888793c13d7eefc8e5eb4420300742c930640ae852125b","schema_version":"1.0","event_id":"sha256:02c301e7ab04dd5499888793c13d7eefc8e5eb4420300742c930640ae852125b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KJY3LFSU4EM4LR7ZQUXUJ2JHUV","target":"graph","payload":{"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"},"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:26:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wkzp8r9N0PJwpGemO2qdk1aQlam2Ys+sPRqXknpb3xqzLm7Hgu/H2dJ8x2arPKgCUacgbRqRg8SzdMGGo0GDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:00:34.431702Z"},"content_sha256":"dc317ad1b8c5e7e7d8642eadffdc74bbc929469f02d1fa14db6ef1e70ee0a77f","schema_version":"1.0","event_id":"sha256:dc317ad1b8c5e7e7d8642eadffdc74bbc929469f02d1fa14db6ef1e70ee0a77f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/bundle.json","state_url":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/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-27T15:00:34Z","links":{"resolver":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV","bundle":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/bundle.json","state":"https://pith.science/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJY3LFSU4EM4LR7ZQUXUJ2JHUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KJY3LFSU4EM4LR7ZQUXUJ2JHUV","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":"b42f0b763fd57ad8fe8ea1ce2ce2ab1a20e500e53a87eb28605cd1d5dfc381ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T03:51:27Z","title_canon_sha256":"0d3312b57317eb0075776f6503b0ee265df20f3498f5ce1f00c9da3a71bb0348"},"schema_version":"1.0","source":{"id":"1103.2581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2581","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2581v1","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2581","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"KJY3LFSU4EM4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KJY3LFSU4EM4LR7Z","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KJY3LFSU","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:dc317ad1b8c5e7e7d8642eadffdc74bbc929469f02d1fa14db6ef1e70ee0a77f","target":"graph","created_at":"2026-05-18T04:26:55Z","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":"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","authors_text":"Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T03:51:27Z","title":"Constant-Time Algorithms for Sparsity Matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2581","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:02c301e7ab04dd5499888793c13d7eefc8e5eb4420300742c930640ae852125b","target":"record","created_at":"2026-05-18T04:26:55Z","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":"b42f0b763fd57ad8fe8ea1ce2ce2ab1a20e500e53a87eb28605cd1d5dfc381ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-14T03:51:27Z","title_canon_sha256":"0d3312b57317eb0075776f6503b0ee265df20f3498f5ce1f00c9da3a71bb0348"},"schema_version":"1.0","source":{"id":"1103.2581","kind":"arxiv","version":1}},"canonical_sha256":"5271b59654e119c5c7f9852f44e927a5417bbbccc235aa9dc3f6d23e5ce641a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5271b59654e119c5c7f9852f44e927a5417bbbccc235aa9dc3f6d23e5ce641a8","first_computed_at":"2026-05-18T04:26:55.050109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:55.050109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZG3FyvGUur3OC2I0mtFCf7aW5grAao1wCDx64d0XOrAk35spa96NTbtM2vLojf0h7LJ5vq9wqYd+I0Yz8GpxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:55.050517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c301e7ab04dd5499888793c13d7eefc8e5eb4420300742c930640ae852125b","sha256:dc317ad1b8c5e7e7d8642eadffdc74bbc929469f02d1fa14db6ef1e70ee0a77f"],"state_sha256":"5112b87ed6e1380130f68c0afbbfe5b229cf492669b64a67cdf2f3baef97675d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjWLg0P8MULXZ3zUnpDnjSludCM21DBlWR+/xZn7XT3vRh8bYlxZ8tny/BKGhvM1ETg0hJGXet463h6rVAOQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:00:34.435189Z","bundle_sha256":"3a7f3834121b2704ed8061a75b8f622aef493598e74d435a3cf2cb9a9e44c4e6"}}