{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EMZOHTG4MHZ34HGZ3W62UBB7CG","short_pith_number":"pith:EMZOHTG4","canonical_record":{"source":{"id":"2501.04166","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-07T22:27:31Z","cross_cats_sorted":["cs.DM","cs.DS","cs.LO"],"title_canon_sha256":"ccd541cc95c3661ab2a044477c1d1e21fb08a89a2b5fe394865e96d69576699d","abstract_canon_sha256":"c9b747c853acd28b2016df1db480e886d08fb1ab74f080277cc74d4e032786c7"},"schema_version":"1.0"},"canonical_sha256":"2332e3ccdc61f3be1cd9ddbdaa043f11abea0647e3005ca94f2aa288fd82ada7","source":{"kind":"arxiv","id":"2501.04166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04166","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04166v1","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04166","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"EMZOHTG4MHZ3","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"EMZOHTG4MHZ34HGZ","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"EMZOHTG4","created_at":"2026-07-05T09:58:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EMZOHTG4MHZ34HGZ3W62UBB7CG","target":"record","payload":{"canonical_record":{"source":{"id":"2501.04166","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-07T22:27:31Z","cross_cats_sorted":["cs.DM","cs.DS","cs.LO"],"title_canon_sha256":"ccd541cc95c3661ab2a044477c1d1e21fb08a89a2b5fe394865e96d69576699d","abstract_canon_sha256":"c9b747c853acd28b2016df1db480e886d08fb1ab74f080277cc74d4e032786c7"},"schema_version":"1.0"},"canonical_sha256":"2332e3ccdc61f3be1cd9ddbdaa043f11abea0647e3005ca94f2aa288fd82ada7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:31.137907Z","signature_b64":"Rda8oSDjw48NQeaeaskJOIgviZ7/ROKRSKSUx8SON4agmtHjMW9p6wfUDAw1l/mNk/yRznRvUHrGXpSzBIUpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2332e3ccdc61f3be1cd9ddbdaa043f11abea0647e3005ca94f2aa288fd82ada7","last_reissued_at":"2026-07-05T09:58:31.137378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:31.137378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.04166","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-07-05T09:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ni8/vXrYJV6m/vDZforxyrgzmx/F06WesUZwQ1skauXcuNYtWDJ9fX8/MXaRuA/P5mEFpCdXRZlftqzehuiOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:17:40.715173Z"},"content_sha256":"d66a5910d14365800897683ca240dad6d02dc64b5b57a98725ebd6f868d408a0","schema_version":"1.0","event_id":"sha256:d66a5910d14365800897683ca240dad6d02dc64b5b57a98725ebd6f868d408a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EMZOHTG4MHZ34HGZ3W62UBB7CG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph classes through the lens of logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.LO"],"primary_cat":"math.CO","authors_text":"Micha{\\l} Pilipczuk","submitted_at":"2025-01-07T22:27:31Z","abstract_excerpt":"Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of logical formulas, we obtain a new perspective on the landscape of graph classes and of their properties. The aim of this survey is to give a comprehensive presentation of this angle on structural graph theory.\n  We first give a logic-focused overview of classic graph-theoretic concepts, such as treedepth, shrubdepth, treewidth, cliquewidth, twin-width, bounded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04166","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/2501.04166/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"},"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-07-05T09:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSWulQAQ31q56xZyHIKP8e2t/3xLDkSiMTpaKOD4yauk6SH11OgOKuG8Ue16UiAv9Xscr7XRMNDIF5n5/0+KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:17:40.716194Z"},"content_sha256":"b4e3e858709e467d8a32a634bba2660b6f1c8a38777e15a48470fd4a48678f55","schema_version":"1.0","event_id":"sha256:b4e3e858709e467d8a32a634bba2660b6f1c8a38777e15a48470fd4a48678f55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG/bundle.json","state_url":"https://pith.science/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG/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-08-07T07:17:40Z","links":{"resolver":"https://pith.science/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG","bundle":"https://pith.science/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG/bundle.json","state":"https://pith.science/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMZOHTG4MHZ34HGZ3W62UBB7CG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EMZOHTG4MHZ34HGZ3W62UBB7CG","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":"c9b747c853acd28b2016df1db480e886d08fb1ab74f080277cc74d4e032786c7","cross_cats_sorted":["cs.DM","cs.DS","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-07T22:27:31Z","title_canon_sha256":"ccd541cc95c3661ab2a044477c1d1e21fb08a89a2b5fe394865e96d69576699d"},"schema_version":"1.0","source":{"id":"2501.04166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04166","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04166v1","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04166","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"EMZOHTG4MHZ3","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"EMZOHTG4MHZ34HGZ","created_at":"2026-07-05T09:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"EMZOHTG4","created_at":"2026-07-05T09:58:31Z"}],"graph_snapshots":[{"event_id":"sha256:b4e3e858709e467d8a32a634bba2660b6f1c8a38777e15a48470fd4a48678f55","target":"graph","created_at":"2026-07-05T09:58:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.04166/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of logical formulas, we obtain a new perspective on the landscape of graph classes and of their properties. The aim of this survey is to give a comprehensive presentation of this angle on structural graph theory.\n  We first give a logic-focused overview of classic graph-theoretic concepts, such as treedepth, shrubdepth, treewidth, cliquewidth, twin-width, bounded","authors_text":"Micha{\\l} Pilipczuk","cross_cats":["cs.DM","cs.DS","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04166","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:d66a5910d14365800897683ca240dad6d02dc64b5b57a98725ebd6f868d408a0","target":"record","created_at":"2026-07-05T09:58:31Z","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":"c9b747c853acd28b2016df1db480e886d08fb1ab74f080277cc74d4e032786c7","cross_cats_sorted":["cs.DM","cs.DS","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-07T22:27:31Z","title_canon_sha256":"ccd541cc95c3661ab2a044477c1d1e21fb08a89a2b5fe394865e96d69576699d"},"schema_version":"1.0","source":{"id":"2501.04166","kind":"arxiv","version":1}},"canonical_sha256":"2332e3ccdc61f3be1cd9ddbdaa043f11abea0647e3005ca94f2aa288fd82ada7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2332e3ccdc61f3be1cd9ddbdaa043f11abea0647e3005ca94f2aa288fd82ada7","first_computed_at":"2026-07-05T09:58:31.137378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:31.137378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rda8oSDjw48NQeaeaskJOIgviZ7/ROKRSKSUx8SON4agmtHjMW9p6wfUDAw1l/mNk/yRznRvUHrGXpSzBIUpCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:31.137907Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d66a5910d14365800897683ca240dad6d02dc64b5b57a98725ebd6f868d408a0","sha256:b4e3e858709e467d8a32a634bba2660b6f1c8a38777e15a48470fd4a48678f55"],"state_sha256":"a0a64541bff18952261d99c68518749328c411d9a63b8763972a7f29d33f2b81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOa2DegqVm8EA69wQ7D0BecDwKAl9hxbawxuOi3omYhpivOuK6lWsCk1I5F5WHb92oDqPBYaZrKw9k96qFxzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:17:40.722748Z","bundle_sha256":"c6e1eab0b023e5d71506b4ac11a157eedcd73d20835456f47da0732047e9863a"}}