{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VVOUGIWIE6N24JS4A7763EKGMM","short_pith_number":"pith:VVOUGIWI","canonical_record":{"source":{"id":"1901.01616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430","abstract_canon_sha256":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d"},"schema_version":"1.0"},"canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","source":{"kind":"arxiv","id":"1901.01616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01616","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01616v1","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01616","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"VVOUGIWIE6N2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VVOUGIWIE6N24JS4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VVOUGIWI","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VVOUGIWIE6N24JS4A7763EKGMM","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430","abstract_canon_sha256":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d"},"schema_version":"1.0"},"canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:51.616134Z","signature_b64":"2wUI9Wdz9+AHF152c1xb38hyezsWpu25H2ZaRuUOvc4G32kfkmis1KKh8TRyU4LmMAM1OHdLXaHAhgc8iKb8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","last_reissued_at":"2026-05-17T23:56:51.615635Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:51.615635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01616","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:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yh4B3ZUN85rTfCxl3DzD77RZ6wRNhDXZLEHnaKw3JRk1JCQnpVP6saXMcxhFezKKGinuC/XUhcHMfvtUicWOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:11.573426Z"},"content_sha256":"7d69d8dc286c22c9d08d513ee5064495c3e5595d520f29df0ee8737d80c44a3a","schema_version":"1.0","event_id":"sha256:7d69d8dc286c22c9d08d513ee5064495c3e5595d520f29df0ee8737d80c44a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VVOUGIWIE6N24JS4A7763EKGMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected-Intersecting Families of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Berger, Harish Vemuri, Michael Doppelt, Pat Devlin, Ross Berkowitz, Sonali Durham, Tessa Murthy","submitted_at":"2019-01-06T22:35:12Z","abstract_excerpt":"For a graph property $\\mathcal{P}$ and a common vertex set $V = \\{1, 2, \\ldots, n\\}$, a family of graphs on $V$ is \\emph{$\\mathcal{P}$-intersecting} iff $G \\cap H$ satisfies $\\mathcal{P}$ for all $G,H$ in the family. Addressing a question of Chung, Graham, Frankl, and Shearer, we explore---for various $\\mathcal{P}$---the maximum cardinality among all $\\mathcal{P}$-intersecting families of graphs. In the connected-intersecting case, we resolve the question completely by a short linear algebraic proof showing this maximum is attained by taking all graphs containing a fixed spanning tree (though "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01616","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:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/eCX2eXhgLGoRHEKM/z5hJvo8CATH31qRP0auPheIIiPHETOSyWQ1a5tcmUKnYAE9+upnuCWuKC0HCACjgkyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:11.573782Z"},"content_sha256":"233a1e124c71e717955979a93867c898fc1dba2a6debadc7f9c1a8b8cc77eae6","schema_version":"1.0","event_id":"sha256:233a1e124c71e717955979a93867c898fc1dba2a6debadc7f9c1a8b8cc77eae6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/bundle.json","state_url":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVOUGIWIE6N24JS4A7763EKGMM/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-02T14:17:11Z","links":{"resolver":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM","bundle":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/bundle.json","state":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVOUGIWIE6N24JS4A7763EKGMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VVOUGIWIE6N24JS4A7763EKGMM","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":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430"},"schema_version":"1.0","source":{"id":"1901.01616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01616","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01616v1","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01616","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"VVOUGIWIE6N2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VVOUGIWIE6N24JS4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VVOUGIWI","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:233a1e124c71e717955979a93867c898fc1dba2a6debadc7f9c1a8b8cc77eae6","target":"graph","created_at":"2026-05-17T23:56:51Z","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 property $\\mathcal{P}$ and a common vertex set $V = \\{1, 2, \\ldots, n\\}$, a family of graphs on $V$ is \\emph{$\\mathcal{P}$-intersecting} iff $G \\cap H$ satisfies $\\mathcal{P}$ for all $G,H$ in the family. Addressing a question of Chung, Graham, Frankl, and Shearer, we explore---for various $\\mathcal{P}$---the maximum cardinality among all $\\mathcal{P}$-intersecting families of graphs. In the connected-intersecting case, we resolve the question completely by a short linear algebraic proof showing this maximum is attained by taking all graphs containing a fixed spanning tree (though ","authors_text":"Aaron Berger, Harish Vemuri, Michael Doppelt, Pat Devlin, Ross Berkowitz, Sonali Durham, Tessa Murthy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","title":"Connected-Intersecting Families of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01616","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:7d69d8dc286c22c9d08d513ee5064495c3e5595d520f29df0ee8737d80c44a3a","target":"record","created_at":"2026-05-17T23:56:51Z","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":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430"},"schema_version":"1.0","source":{"id":"1901.01616","kind":"arxiv","version":1}},"canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","first_computed_at":"2026-05-17T23:56:51.615635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:51.615635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2wUI9Wdz9+AHF152c1xb38hyezsWpu25H2ZaRuUOvc4G32kfkmis1KKh8TRyU4LmMAM1OHdLXaHAhgc8iKb8AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:51.616134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d69d8dc286c22c9d08d513ee5064495c3e5595d520f29df0ee8737d80c44a3a","sha256:233a1e124c71e717955979a93867c898fc1dba2a6debadc7f9c1a8b8cc77eae6"],"state_sha256":"6e56083523806180cef779c4cc3d6064fc04609ee6952db7a67982977c7b4bb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mu1TPfjhwN8CHPFVSu6+lIbw7aTg9T448PdD8T3FTmDgIMmWbWzb/XGpwyVvkOYuiSnYhSLXtrjtJCfjYeKkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:17:11.575708Z","bundle_sha256":"55d107e0be268dfcf9c236d203b06eafec1dd41f61cad4c9892907b5ed82bb84"}}