{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2E75KB2SO25IIZ65TKCREDGOJY","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":"23a4e7c6b4bdf03e117355d501e1dcf264dc69dccdbc7143cbbae7a113a0f564","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-11T13:30:55Z","title_canon_sha256":"722729c24f02234dfd608f5dac51beedee40f08e672ac69dda4c3c4f7cc885b1"},"schema_version":"1.0","source":{"id":"2207.04855","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.04855","created_at":"2026-07-05T11:28:56Z"},{"alias_kind":"arxiv_version","alias_value":"2207.04855v8","created_at":"2026-07-05T11:28:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04855","created_at":"2026-07-05T11:28:56Z"},{"alias_kind":"pith_short_12","alias_value":"2E75KB2SO25I","created_at":"2026-07-05T11:28:56Z"},{"alias_kind":"pith_short_16","alias_value":"2E75KB2SO25IIZ65","created_at":"2026-07-05T11:28:56Z"},{"alias_kind":"pith_short_8","alias_value":"2E75KB2S","created_at":"2026-07-05T11:28:56Z"}],"graph_snapshots":[{"event_id":"sha256:45406cebc5599bc34f0ee809da0d77b0e5170c9416d558c90983b3a5c354520e","target":"graph","created_at":"2026-07-05T11:28:56Z","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/2207.04855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as determined by the relative position of these parts, is described by a coarser $\\it model$. This is a simpler graph determined entirely by the decomposition, not imposed.\n  The model and decomposition are obtained as projections of the tangle-tree structure of a covering of the given graph that reflects its local structure while unfolding its global structure. In th","authors_text":"Jan Kurkofka, Paul Knappe, Raphael W. Jacobs, Reinhard Diestel","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-11T13:30:55Z","title":"Canonical graph decompositions via coverings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04855","kind":"arxiv","version":8},"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:4e432de877b5d3e4a61c42bc3e2e9fa71b6b1417c7cd038d7b04df5431dbc62a","target":"record","created_at":"2026-07-05T11:28:56Z","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":"23a4e7c6b4bdf03e117355d501e1dcf264dc69dccdbc7143cbbae7a113a0f564","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-11T13:30:55Z","title_canon_sha256":"722729c24f02234dfd608f5dac51beedee40f08e672ac69dda4c3c4f7cc885b1"},"schema_version":"1.0","source":{"id":"2207.04855","kind":"arxiv","version":8}},"canonical_sha256":"d13fd5075276ba8467dd9a85120cce4e2878f3854d7e9f1a4575ac77b0e2a1d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d13fd5075276ba8467dd9a85120cce4e2878f3854d7e9f1a4575ac77b0e2a1d7","first_computed_at":"2026-07-05T11:28:56.091584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:28:56.091584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gseZTcG/UxGP7UUZalFd/DvztFczDHMdjp0u0iNFJzlCnk03yF+lAc/LxQ2hKit9u+8MSfEivXfB4opmCOzyAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:28:56.092275Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.04855","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e432de877b5d3e4a61c42bc3e2e9fa71b6b1417c7cd038d7b04df5431dbc62a","sha256:45406cebc5599bc34f0ee809da0d77b0e5170c9416d558c90983b3a5c354520e"],"state_sha256":"aa571deefecbcf4abb0c2cd178bc94f55da547a7a471ced8de54f0cd23ff210c"}