{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HWECUL3BWO32QARPJKY64VUPK2","short_pith_number":"pith:HWECUL3B","schema_version":"1.0","canonical_sha256":"3d882a2f61b3b7a8022f4ab1ee568f56b8fb02112913f196b389d7fae96caa82","source":{"kind":"arxiv","id":"2608.01523","version":1},"attestation_state":"computed","paper":{"title":"A quantitative container characterization of one-sided testability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.CO","authors_text":"Cameron Seth, Gaia Carenini, Yuichi Yoshida","submitted_at":"2026-08-02T22:22:22Z","abstract_excerpt":"We give a quantitative combinatorial characterization of size-oblivious one-sided testability in the dense graph model, resolving a question of Alon, Fischer, Newman, and Shapira. For hereditary graph properties, we prove that one-sided testability is quantitatively equivalent to the existence of suitable hypergraph containers, a central and widely used tool in modern combinatorics. Combining this equivalence with the Alon-Shapira notion of semi-hereditariness yields a quantitative characterization of arbitrary graph properties. The correspondence is effective in both directions and provides e"},"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":"2608.01523","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-02T22:22:22Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"d9ccf2b7659c917498bb539265ec104818ad15f0d4cbf71e156169735d651fae","abstract_canon_sha256":"ac7c79f60b681ce3cb6a3c1bcbf91a501ea677f4584807967c71bf467d4c06b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:05:48.260124Z","signature_b64":"PnmXblniO3FPvOsdNpucz41akTuW+RMWwDPUE6U3N1y/7YwB2gqP3lDbqfD7s6dY+eWEYOHVreRHipOhZuCYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d882a2f61b3b7a8022f4ab1ee568f56b8fb02112913f196b389d7fae96caa82","last_reissued_at":"2026-08-04T02:05:48.258416Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:05:48.258416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantitative container characterization of one-sided testability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.CO","authors_text":"Cameron Seth, Gaia Carenini, Yuichi Yoshida","submitted_at":"2026-08-02T22:22:22Z","abstract_excerpt":"We give a quantitative combinatorial characterization of size-oblivious one-sided testability in the dense graph model, resolving a question of Alon, Fischer, Newman, and Shapira. For hereditary graph properties, we prove that one-sided testability is quantitatively equivalent to the existence of suitable hypergraph containers, a central and widely used tool in modern combinatorics. Combining this equivalence with the Alon-Shapira notion of semi-hereditariness yields a quantitative characterization of arbitrary graph properties. The correspondence is effective in both directions and provides e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01523","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.01523/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.01523","created_at":"2026-08-04T02:05:48.260040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01523v1","created_at":"2026-08-04T02:05:48.260040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01523","created_at":"2026-08-04T02:05:48.260040+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWECUL3BWO32","created_at":"2026-08-04T02:05:48.260040+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWECUL3BWO32QARP","created_at":"2026-08-04T02:05:48.260040+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWECUL3B","created_at":"2026-08-04T02:05:48.260040+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/HWECUL3BWO32QARPJKY64VUPK2","json":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2.json","graph_json":"https://pith.science/api/pith-number/HWECUL3BWO32QARPJKY64VUPK2/graph.json","events_json":"https://pith.science/api/pith-number/HWECUL3BWO32QARPJKY64VUPK2/events.json","paper":"https://pith.science/paper/HWECUL3B"},"agent_actions":{"view_html":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2","download_json":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2.json","view_paper":"https://pith.science/paper/HWECUL3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01523&json=true","fetch_graph":"https://pith.science/api/pith-number/HWECUL3BWO32QARPJKY64VUPK2/graph.json","fetch_events":"https://pith.science/api/pith-number/HWECUL3BWO32QARPJKY64VUPK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2/action/storage_attestation","attest_author":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2/action/author_attestation","sign_citation":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2/action/citation_signature","submit_replication":"https://pith.science/pith/HWECUL3BWO32QARPJKY64VUPK2/action/replication_record"}},"created_at":"2026-08-04T02:05:48.260040+00:00","updated_at":"2026-08-04T02:05:48.260040+00:00"}