{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HKVL2XPMNMBR4YHNLDSLQWYLBV","short_pith_number":"pith:HKVL2XPM","canonical_record":{"source":{"id":"1907.05168","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-11T12:59:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b29422d7b366a3275ef5850cd83c75992e596e42b733de2e29e304bed83f8463","abstract_canon_sha256":"2465728f6e3db9ee6d8909a72fdeb64362c90f7998d0a1002c7beb34d48a2504"},"schema_version":"1.0"},"canonical_sha256":"3aaabd5dec6b031e60ed58e4b85b0b0d6e77011492e9d2beacdf5bca1fd09d04","source":{"kind":"arxiv","id":"1907.05168","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05168","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05168v5","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05168","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"HKVL2XPMNMBR","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"pith_short_16","alias_value":"HKVL2XPMNMBR4YHN","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"pith_short_8","alias_value":"HKVL2XPM","created_at":"2026-07-05T05:17:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HKVL2XPMNMBR4YHNLDSLQWYLBV","target":"record","payload":{"canonical_record":{"source":{"id":"1907.05168","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-11T12:59:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b29422d7b366a3275ef5850cd83c75992e596e42b733de2e29e304bed83f8463","abstract_canon_sha256":"2465728f6e3db9ee6d8909a72fdeb64362c90f7998d0a1002c7beb34d48a2504"},"schema_version":"1.0"},"canonical_sha256":"3aaabd5dec6b031e60ed58e4b85b0b0d6e77011492e9d2beacdf5bca1fd09d04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:22.687984Z","signature_b64":"tv/OXh1XlGOndZSnskoqVD6h1AOV1IduQ9V2pljdnvaDwBe0Qm943j2cCQcENNWbnw1f0GKSyv6mkzNsnbJWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aaabd5dec6b031e60ed58e4b85b0b0d6e77011492e9d2beacdf5bca1fd09d04","last_reissued_at":"2026-07-05T05:17:22.687495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:22.687495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.05168","source_version":5,"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-05T05:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fzJ4+Y11ZgCjcfYwoCud6uynSOjht7GgJoQMFFGfYWACE49DDIw4RQndmrkmOspqvhvSjUv7oqi4chu2c4+ACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:43:17.104274Z"},"content_sha256":"0f8f4f25c9add09c42904d8f99dbc306f7d080a0b03b1d3def61de5f6ae556c1","schema_version":"1.0","event_id":"sha256:0f8f4f25c9add09c42904d8f99dbc306f7d080a0b03b1d3def61de5f6ae556c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HKVL2XPMNMBR4YHNLDSLQWYLBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph product structure for non-minor-closed classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","submitted_at":"2019-07-11T12:59:49Z","abstract_excerpt":"Dujmovi\\'c et al. [\\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or apex-minor-free graphs. These tools have been used to solve longstanding problems on queue layouts, non-repetitive colouring, $p$-centered colouring, and adjacency labelling. This paper proves analogous product structure theorems for various non-minor-closed classes. One noteable example is $k$-planar graphs (those with a drawing in the plane in which each edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05168","kind":"arxiv","version":5},"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/1907.05168/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-05T05:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wafsnVRE3g9GPd11NXAaHnCMNab44eENeADNwAwfEFFOmdPfndsxRPdBXjl0ODKHu4zoNCuYKBBS3k0JrnzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:43:17.104842Z"},"content_sha256":"ee671cb7ce19de1c5337e69af150005245150ab79b21b82c3eb75ad820d9e50f","schema_version":"1.0","event_id":"sha256:ee671cb7ce19de1c5337e69af150005245150ab79b21b82c3eb75ad820d9e50f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV/bundle.json","state_url":"https://pith.science/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV/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-16T22:43:17Z","links":{"resolver":"https://pith.science/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV","bundle":"https://pith.science/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV/bundle.json","state":"https://pith.science/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKVL2XPMNMBR4YHNLDSLQWYLBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HKVL2XPMNMBR4YHNLDSLQWYLBV","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":"2465728f6e3db9ee6d8909a72fdeb64362c90f7998d0a1002c7beb34d48a2504","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-11T12:59:49Z","title_canon_sha256":"b29422d7b366a3275ef5850cd83c75992e596e42b733de2e29e304bed83f8463"},"schema_version":"1.0","source":{"id":"1907.05168","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05168","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05168v5","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05168","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"HKVL2XPMNMBR","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"pith_short_16","alias_value":"HKVL2XPMNMBR4YHN","created_at":"2026-07-05T05:17:22Z"},{"alias_kind":"pith_short_8","alias_value":"HKVL2XPM","created_at":"2026-07-05T05:17:22Z"}],"graph_snapshots":[{"event_id":"sha256:ee671cb7ce19de1c5337e69af150005245150ab79b21b82c3eb75ad820d9e50f","target":"graph","created_at":"2026-07-05T05:17:22Z","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/1907.05168/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dujmovi\\'c et al. [\\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or apex-minor-free graphs. These tools have been used to solve longstanding problems on queue layouts, non-repetitive colouring, $p$-centered colouring, and adjacency labelling. This paper proves analogous product structure theorems for various non-minor-closed classes. One noteable example is $k$-planar graphs (those with a drawing in the plane in which each edg","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-11T12:59:49Z","title":"Graph product structure for non-minor-closed classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05168","kind":"arxiv","version":5},"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:0f8f4f25c9add09c42904d8f99dbc306f7d080a0b03b1d3def61de5f6ae556c1","target":"record","created_at":"2026-07-05T05:17:22Z","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":"2465728f6e3db9ee6d8909a72fdeb64362c90f7998d0a1002c7beb34d48a2504","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-11T12:59:49Z","title_canon_sha256":"b29422d7b366a3275ef5850cd83c75992e596e42b733de2e29e304bed83f8463"},"schema_version":"1.0","source":{"id":"1907.05168","kind":"arxiv","version":5}},"canonical_sha256":"3aaabd5dec6b031e60ed58e4b85b0b0d6e77011492e9d2beacdf5bca1fd09d04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aaabd5dec6b031e60ed58e4b85b0b0d6e77011492e9d2beacdf5bca1fd09d04","first_computed_at":"2026-07-05T05:17:22.687495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:22.687495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tv/OXh1XlGOndZSnskoqVD6h1AOV1IduQ9V2pljdnvaDwBe0Qm943j2cCQcENNWbnw1f0GKSyv6mkzNsnbJWCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:22.687984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05168","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f8f4f25c9add09c42904d8f99dbc306f7d080a0b03b1d3def61de5f6ae556c1","sha256:ee671cb7ce19de1c5337e69af150005245150ab79b21b82c3eb75ad820d9e50f"],"state_sha256":"f69413e260d9cdb4784c3fba41d5fcda79c4f9db2224ca7d2a4768471f55d2c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/WZgxz1qYmV83uHzKgCZOEDNrzI4GXNX00o/3F6WqA1WkVLGkf6tTJP1Rw8oUQTI8H1ansCisU+60jeQOgWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:43:17.109174Z","bundle_sha256":"14241108429b0fbb447b78c8c4bd4cf816b87d5922ab150f372bbc96809d4927"}}