{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HHBPGSOBGXMURTNBF5BHS7JUYI","short_pith_number":"pith:HHBPGSOB","canonical_record":{"source":{"id":"1101.2630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-13T18:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"da79b0586cdfcadcba6af992e2c938be3caed9f40cd5cec8ba54a8db37ebc2f3","abstract_canon_sha256":"d8bff4900f3b816c18aa744c697f11430ea0f396e61e723abd69a8bc44c2ea35"},"schema_version":"1.0"},"canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","source":{"kind":"arxiv","id":"1101.2630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2630","created_at":"2026-05-18T04:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2630v1","created_at":"2026-05-18T04:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2630","created_at":"2026-05-18T04:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"HHBPGSOBGXMU","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHBPGSOBGXMURTNB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHBPGSOB","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HHBPGSOBGXMURTNBF5BHS7JUYI","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-13T18:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"da79b0586cdfcadcba6af992e2c938be3caed9f40cd5cec8ba54a8db37ebc2f3","abstract_canon_sha256":"d8bff4900f3b816c18aa744c697f11430ea0f396e61e723abd69a8bc44c2ea35"},"schema_version":"1.0"},"canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:41.758625Z","signature_b64":"Aqc6tyHmChlU1rZoDiIS1ye4UNyWT+OR+ba5ejc6zZhY2jqpuijS7TlM8UNzpe3WWCAbszncF5GAk+/OYACnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","last_reissued_at":"2026-05-18T04:31:41.758106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:41.758106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2630","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-05-18T04:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wD7WKWFAnucb3DkWKmkJecsvq3c/oYqDeyej5LeWRtaK+WAfZt4XlH/xHDtylt8WsLb6Z5N+aIbOpyutpCEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:47:35.546906Z"},"content_sha256":"1f5cfcf139dffe36bc2763bd22f14af04b978c2d5acc26feb5b6a12df03e000f","schema_version":"1.0","event_id":"sha256:1f5cfcf139dffe36bc2763bd22f14af04b978c2d5acc26feb5b6a12df03e000f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HHBPGSOBGXMURTNBF5BHS7JUYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum degree condition forcing complete graph immersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Diego Scheide, Jacob Fox, Jessica McDonald, Matt DeVos, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2011-01-13T18:28:50Z","abstract_excerpt":"An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \\to V(G)$ and a collection of edge-disjoint paths in $G$, one for each edge of $H$, such that the path $P_{uv}$ corresponding to edge $uv$ has endpoints $f(u)$ and $f(v)$. The immersion is strong if the paths $P_{uv}$ are internally disjoint from $f(V(H))$. It is proved that for every positive integer $t$, every simple graph of minimum degree at least $200t$ contains a strong immersion of the complete graph $K_t$. For dense graphs one can say even more. If the graph has order $n$ and has $2cn^2$ edges, then there is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2630","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":""},"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-05-18T04:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBhJGo/C9tPoBvEeFpTV7YnE/2trU6JiX5m+TASMmNR9j9rVI5eiI6D6gjqMX+k94DHwFZz+GkcY+FBkd055BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:47:35.547254Z"},"content_sha256":"91e5ab4adeccb559605d5dee5d3d57df1c4ab3695fd310e696c0ebf2b1e50fdc","schema_version":"1.0","event_id":"sha256:91e5ab4adeccb559605d5dee5d3d57df1c4ab3695fd310e696c0ebf2b1e50fdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/bundle.json","state_url":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/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-06-02T09:47:35Z","links":{"resolver":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI","bundle":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/bundle.json","state":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HHBPGSOBGXMURTNBF5BHS7JUYI","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":"d8bff4900f3b816c18aa744c697f11430ea0f396e61e723abd69a8bc44c2ea35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-13T18:28:50Z","title_canon_sha256":"da79b0586cdfcadcba6af992e2c938be3caed9f40cd5cec8ba54a8db37ebc2f3"},"schema_version":"1.0","source":{"id":"1101.2630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2630","created_at":"2026-05-18T04:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2630v1","created_at":"2026-05-18T04:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2630","created_at":"2026-05-18T04:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"HHBPGSOBGXMU","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHBPGSOBGXMURTNB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHBPGSOB","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:91e5ab4adeccb559605d5dee5d3d57df1c4ab3695fd310e696c0ebf2b1e50fdc","target":"graph","created_at":"2026-05-18T04:31:41Z","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"},"paper":{"abstract_excerpt":"An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \\to V(G)$ and a collection of edge-disjoint paths in $G$, one for each edge of $H$, such that the path $P_{uv}$ corresponding to edge $uv$ has endpoints $f(u)$ and $f(v)$. The immersion is strong if the paths $P_{uv}$ are internally disjoint from $f(V(H))$. It is proved that for every positive integer $t$, every simple graph of minimum degree at least $200t$ contains a strong immersion of the complete graph $K_t$. For dense graphs one can say even more. If the graph has order $n$ and has $2cn^2$ edges, then there is a","authors_text":"Bojan Mohar, Diego Scheide, Jacob Fox, Jessica McDonald, Matt DeVos, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-13T18:28:50Z","title":"Minimum degree condition forcing complete graph immersion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2630","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:1f5cfcf139dffe36bc2763bd22f14af04b978c2d5acc26feb5b6a12df03e000f","target":"record","created_at":"2026-05-18T04:31:41Z","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":"d8bff4900f3b816c18aa744c697f11430ea0f396e61e723abd69a8bc44c2ea35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-13T18:28:50Z","title_canon_sha256":"da79b0586cdfcadcba6af992e2c938be3caed9f40cd5cec8ba54a8db37ebc2f3"},"schema_version":"1.0","source":{"id":"1101.2630","kind":"arxiv","version":1}},"canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","first_computed_at":"2026-05-18T04:31:41.758106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:41.758106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aqc6tyHmChlU1rZoDiIS1ye4UNyWT+OR+ba5ejc6zZhY2jqpuijS7TlM8UNzpe3WWCAbszncF5GAk+/OYACnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:41.758625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f5cfcf139dffe36bc2763bd22f14af04b978c2d5acc26feb5b6a12df03e000f","sha256:91e5ab4adeccb559605d5dee5d3d57df1c4ab3695fd310e696c0ebf2b1e50fdc"],"state_sha256":"3dbd7b555d250e7ae3d8440e14b9a8fc7b5e83242e91016b55d89d08dcdb0a41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LOX3nAO2JYJbQEyVoEKjzBuYdAkDQxHVsY+4v0KiXbZXBm+7X4w4oZC3L5r+ofyQpOUXSCVkFJNOTpBXuVmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:47:35.549266Z","bundle_sha256":"1d1abbd8cc3060bc36e1afa5f19258f755b25e88cf8c2566aa2538b0348150be"}}