{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2BMK6NIHV7CTERZPOUSUGDRLLD","short_pith_number":"pith:2BMK6NIH","canonical_record":{"source":{"id":"1903.03908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-10T02:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"d724a236cde18436283a2705b0efe89cba30c2ca2fb01ead34c184b017282cfa","abstract_canon_sha256":"13ac38312c72a565a29b4d2f26214c8f6d0754715879e06123f045889cf3bbce"},"schema_version":"1.0"},"canonical_sha256":"d058af3507afc532472f7525430e2b58ef57007021804bb2e140a096975e3455","source":{"kind":"arxiv","id":"1903.03908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03908","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03908v1","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03908","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"2BMK6NIHV7CT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2BMK6NIHV7CTERZP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2BMK6NIH","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2BMK6NIHV7CTERZPOUSUGDRLLD","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-10T02:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"d724a236cde18436283a2705b0efe89cba30c2ca2fb01ead34c184b017282cfa","abstract_canon_sha256":"13ac38312c72a565a29b4d2f26214c8f6d0754715879e06123f045889cf3bbce"},"schema_version":"1.0"},"canonical_sha256":"d058af3507afc532472f7525430e2b58ef57007021804bb2e140a096975e3455","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:40.623878Z","signature_b64":"vx18EpZD3BQUnig9p76CN7irp/XTGlU8UGKzX/866dJrxAzDzmp4E5K9VO/nNRoMLvJ60+RlaOm7y8xlk380Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d058af3507afc532472f7525430e2b58ef57007021804bb2e140a096975e3455","last_reissued_at":"2026-05-17T23:51:40.623267Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:40.623267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03908","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-17T23:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLsZvjskY1Hu1BLItN2XbN5jOMeXYAdYwdSAn+atPLaNyVAa5XtqRIyJfaL7NkCMxrd0eEdntGom9Dm17xzxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:58:02.500923Z"},"content_sha256":"6869250b7bb65cf7bb19c7b774555c5ef352861439e6753846b9f3686c3c671c","schema_version":"1.0","event_id":"sha256:6869250b7bb65cf7bb19c7b774555c5ef352861439e6753846b9f3686c3c671c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2BMK6NIHV7CTERZPOUSUGDRLLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Density of Graphs Excluding Disconnected Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rohan Kapadia, Sergey Norin, Yingjie Qian","submitted_at":"2019-03-10T02:58:46Z","abstract_excerpt":"For a graph $H$, let $$c_{\\infty}(H)= \\lim_{n \\to \\infty}\\max\\frac{|E(G)|}{n},$$ where the maximum is taken over all graphs $G$ on $n$ vertices not containing $H$ as a minor. Thus $c_{\\infty}(H)$ is the asymptotic maximum density of graphs not containing $H$ as a minor. Employing a structural lemma due to Eppstein, we prove new upper bounds on $c_{\\infty}(H)$ for disconnected graphs $H$. In particular, we determine $c_{\\infty}(H)$ whenever $H$ is union of cycles. Finally, we investigate the behaviour of $c_\\infty(sK_r)$ for fixed $r$, where $sK_r$ denotes the union of $s$ disjoint copies of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03908","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-17T23:51:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDkBuWbESkW2TYNq+31+cPTD33ZKQjPfaXmdzMO8BydAsPUBm8SKXY4RbDLSIbSnUtVfUJbfIztF/ZPzDzIcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:58:02.501657Z"},"content_sha256":"fbadc85c62152817d0454eda76d28844070e214803e0fde60198aa1739c08e76","schema_version":"1.0","event_id":"sha256:fbadc85c62152817d0454eda76d28844070e214803e0fde60198aa1739c08e76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BMK6NIHV7CTERZPOUSUGDRLLD/bundle.json","state_url":"https://pith.science/pith/2BMK6NIHV7CTERZPOUSUGDRLLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BMK6NIHV7CTERZPOUSUGDRLLD/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-05-25T14:58:02Z","links":{"resolver":"https://pith.science/pith/2BMK6NIHV7CTERZPOUSUGDRLLD","bundle":"https://pith.science/pith/2BMK6NIHV7CTERZPOUSUGDRLLD/bundle.json","state":"https://pith.science/pith/2BMK6NIHV7CTERZPOUSUGDRLLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BMK6NIHV7CTERZPOUSUGDRLLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2BMK6NIHV7CTERZPOUSUGDRLLD","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":"13ac38312c72a565a29b4d2f26214c8f6d0754715879e06123f045889cf3bbce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-10T02:58:46Z","title_canon_sha256":"d724a236cde18436283a2705b0efe89cba30c2ca2fb01ead34c184b017282cfa"},"schema_version":"1.0","source":{"id":"1903.03908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03908","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03908v1","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03908","created_at":"2026-05-17T23:51:40Z"},{"alias_kind":"pith_short_12","alias_value":"2BMK6NIHV7CT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2BMK6NIHV7CTERZP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2BMK6NIH","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:fbadc85c62152817d0454eda76d28844070e214803e0fde60198aa1739c08e76","target":"graph","created_at":"2026-05-17T23:51:40Z","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":"For a graph $H$, let $$c_{\\infty}(H)= \\lim_{n \\to \\infty}\\max\\frac{|E(G)|}{n},$$ where the maximum is taken over all graphs $G$ on $n$ vertices not containing $H$ as a minor. Thus $c_{\\infty}(H)$ is the asymptotic maximum density of graphs not containing $H$ as a minor. Employing a structural lemma due to Eppstein, we prove new upper bounds on $c_{\\infty}(H)$ for disconnected graphs $H$. In particular, we determine $c_{\\infty}(H)$ whenever $H$ is union of cycles. Finally, we investigate the behaviour of $c_\\infty(sK_r)$ for fixed $r$, where $sK_r$ denotes the union of $s$ disjoint copies of th","authors_text":"Rohan Kapadia, Sergey Norin, Yingjie Qian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-10T02:58:46Z","title":"Asymptotic Density of Graphs Excluding Disconnected Minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03908","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:6869250b7bb65cf7bb19c7b774555c5ef352861439e6753846b9f3686c3c671c","target":"record","created_at":"2026-05-17T23:51:40Z","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":"13ac38312c72a565a29b4d2f26214c8f6d0754715879e06123f045889cf3bbce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-10T02:58:46Z","title_canon_sha256":"d724a236cde18436283a2705b0efe89cba30c2ca2fb01ead34c184b017282cfa"},"schema_version":"1.0","source":{"id":"1903.03908","kind":"arxiv","version":1}},"canonical_sha256":"d058af3507afc532472f7525430e2b58ef57007021804bb2e140a096975e3455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d058af3507afc532472f7525430e2b58ef57007021804bb2e140a096975e3455","first_computed_at":"2026-05-17T23:51:40.623267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:40.623267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vx18EpZD3BQUnig9p76CN7irp/XTGlU8UGKzX/866dJrxAzDzmp4E5K9VO/nNRoMLvJ60+RlaOm7y8xlk380Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:40.623878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6869250b7bb65cf7bb19c7b774555c5ef352861439e6753846b9f3686c3c671c","sha256:fbadc85c62152817d0454eda76d28844070e214803e0fde60198aa1739c08e76"],"state_sha256":"8fefc429e8f411bc31b1096b81b805f485359fcb8d3ee1467300b7f2a29a921f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWKwsVFaf5zYknZUUeH8FvLL/MH+HvaUoEVKrjjN3Wf27rrMPUdhlbAV9Y3sq9/WYMl/byFqE4sv7Q92O4A6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:58:02.505669Z","bundle_sha256":"0c9207c9942c2fe40a0b3fdb17fc44ee2a053b4ad5ce2c54b74b15d27f6162cb"}}