{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KVAAUP6LCT5BM57JVY3C4L33BT","short_pith_number":"pith:KVAAUP6L","schema_version":"1.0","canonical_sha256":"55400a3fcb14fa1677e9ae362e2f7b0cf8844940e6f06455393f9a306c5bed34","source":{"kind":"arxiv","id":"2402.12148","version":2},"attestation_state":"computed","paper":{"title":"Local certification of forbidden subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Laurent Feuilloley, Linda Cook, Nicolas Bousquet, S\\'ebastien Zeitoun, Th\\'eo Pierron","submitted_at":"2024-02-19T14:01:34Z","abstract_excerpt":"Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. Our main question is: For a given graph $H$, what is the minimum certificate size that allows checking that the network does not contain $H$ as a (possibly in"},"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":"2402.12148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-02-19T14:01:34Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"f544c8c4ea44ead17aea594f8e522df3b46a52a7a9b588473136126e613da31a","abstract_canon_sha256":"31e912cc885f4b4adee44d24b0c9f744e2e0f202bf24ebdd105a01325abaaf33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:29.861165Z","signature_b64":"JgDhZdsnwL1SFTFk7//fzSP5TSC2voMryCX8BLSW6uWf5jX++HkwbRIvzjdCSamyOTMSzm138b34XfxtCeKkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55400a3fcb14fa1677e9ae362e2f7b0cf8844940e6f06455393f9a306c5bed34","last_reissued_at":"2026-07-05T09:15:29.860633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:29.860633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local certification of forbidden subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Laurent Feuilloley, Linda Cook, Nicolas Bousquet, S\\'ebastien Zeitoun, Th\\'eo Pierron","submitted_at":"2024-02-19T14:01:34Z","abstract_excerpt":"Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. Our main question is: For a given graph $H$, what is the minimum certificate size that allows checking that the network does not contain $H$ as a (possibly in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12148","kind":"arxiv","version":2},"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/2402.12148/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":"2402.12148","created_at":"2026-07-05T09:15:29.860687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12148v2","created_at":"2026-07-05T09:15:29.860687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12148","created_at":"2026-07-05T09:15:29.860687+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVAAUP6LCT5B","created_at":"2026-07-05T09:15:29.860687+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVAAUP6LCT5BM57J","created_at":"2026-07-05T09:15:29.860687+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVAAUP6L","created_at":"2026-07-05T09:15:29.860687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04934","citing_title":"The local complexity of certifying parity","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04934","citing_title":"The local complexity of certifying parity","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT","json":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT.json","graph_json":"https://pith.science/api/pith-number/KVAAUP6LCT5BM57JVY3C4L33BT/graph.json","events_json":"https://pith.science/api/pith-number/KVAAUP6LCT5BM57JVY3C4L33BT/events.json","paper":"https://pith.science/paper/KVAAUP6L"},"agent_actions":{"view_html":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT","download_json":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT.json","view_paper":"https://pith.science/paper/KVAAUP6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12148&json=true","fetch_graph":"https://pith.science/api/pith-number/KVAAUP6LCT5BM57JVY3C4L33BT/graph.json","fetch_events":"https://pith.science/api/pith-number/KVAAUP6LCT5BM57JVY3C4L33BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT/action/storage_attestation","attest_author":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT/action/author_attestation","sign_citation":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT/action/citation_signature","submit_replication":"https://pith.science/pith/KVAAUP6LCT5BM57JVY3C4L33BT/action/replication_record"}},"created_at":"2026-07-05T09:15:29.860687+00:00","updated_at":"2026-07-05T09:15:29.860687+00:00"}