{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7HE7V6A6MPOY6O4XGWLFP2YZXE","short_pith_number":"pith:7HE7V6A6","canonical_record":{"source":{"id":"1007.0804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-06T04:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"fe0a3859bfdfe7168678043ab8644dcbadab9bac40776c777b5606676b253a8b","abstract_canon_sha256":"44cb07b774450c357372dcc37bad56794a8ef2355ca9abebc80236a861fce94e"},"schema_version":"1.0"},"canonical_sha256":"f9c9faf81e63dd8f3b97359657eb19b915d2f8dcbcff4a442c8f50f2d1c41a82","source":{"kind":"arxiv","id":"1007.0804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0804","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0804v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0804","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"7HE7V6A6MPOY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HE7V6A6MPOY6O4X","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HE7V6A6","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7HE7V6A6MPOY6O4XGWLFP2YZXE","target":"record","payload":{"canonical_record":{"source":{"id":"1007.0804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-06T04:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"fe0a3859bfdfe7168678043ab8644dcbadab9bac40776c777b5606676b253a8b","abstract_canon_sha256":"44cb07b774450c357372dcc37bad56794a8ef2355ca9abebc80236a861fce94e"},"schema_version":"1.0"},"canonical_sha256":"f9c9faf81e63dd8f3b97359657eb19b915d2f8dcbcff4a442c8f50f2d1c41a82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.632514Z","signature_b64":"E/u/23+HBjkQcwhMaBlRiuveSdidemA8IVHEneFHZTNk51S6ZXkh/m7Ur+X3wIhKW0sfBqQUryCBQNHn6Pm2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9c9faf81e63dd8f3b97359657eb19b915d2f8dcbcff4a442c8f50f2d1c41a82","last_reissued_at":"2026-05-18T03:41:02.631949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.631949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.0804","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-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYea5vc52akb4T3IY+9veazyvRw7siGADmoYflDDNMLJ4tRTo+yQVNgPVWriCO/rkAVKn4su289OZ0CVJy5vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:02:52.804407Z"},"content_sha256":"94237091cb94b9a46987a18a183af2a772832433cc2373a18b2cd5e731f3e694","schema_version":"1.0","event_id":"sha256:94237091cb94b9a46987a18a183af2a772832433cc2373a18b2cd5e731f3e694"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7HE7V6A6MPOY6O4XGWLFP2YZXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overlap Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Stocker, Daniel W. Cranston, Douglas B. West, Jennifer Vandenbussche, Kevin Milans, Nitish Korula, Timothy D. LeSaulnier","submitted_at":"2010-07-06T04:04:01Z","abstract_excerpt":"An {\\it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The {\\it overlap number} $\\ol(G)$ (introduced by Rosgen) is the minimum size of the union of the sets in such a representation. We prove the following: (1) An optimal overlap representation of a tree can be produced in linear time, and its size is the number of vertices in the largest subtree in which the neighbor of any leaf has degree 2. (2) If $\\delta(G)\\ge 2$ and $G\\ne K_3$, then $\\ol(G)\\le |E(G)|-1$, with equa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0804","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-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLb1Kkq7YSMlRFiVm4hlpyPI3zMR4EzhQeJj/dmCZ9O2573hyh4bL6nEHYiAFW2zkOhNg1RqkyftdsRElGh5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:02:52.805056Z"},"content_sha256":"27797e93274d057bb9aa58ebee7f97df9d2f70e8412eaf5733322db60715744d","schema_version":"1.0","event_id":"sha256:27797e93274d057bb9aa58ebee7f97df9d2f70e8412eaf5733322db60715744d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE/bundle.json","state_url":"https://pith.science/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE/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-21T21:02:52Z","links":{"resolver":"https://pith.science/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE","bundle":"https://pith.science/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE/bundle.json","state":"https://pith.science/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HE7V6A6MPOY6O4XGWLFP2YZXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7HE7V6A6MPOY6O4XGWLFP2YZXE","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":"44cb07b774450c357372dcc37bad56794a8ef2355ca9abebc80236a861fce94e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-06T04:04:01Z","title_canon_sha256":"fe0a3859bfdfe7168678043ab8644dcbadab9bac40776c777b5606676b253a8b"},"schema_version":"1.0","source":{"id":"1007.0804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0804","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0804v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0804","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"7HE7V6A6MPOY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HE7V6A6MPOY6O4X","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HE7V6A6","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:27797e93274d057bb9aa58ebee7f97df9d2f70e8412eaf5733322db60715744d","target":"graph","created_at":"2026-05-18T03:41:02Z","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 {\\it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The {\\it overlap number} $\\ol(G)$ (introduced by Rosgen) is the minimum size of the union of the sets in such a representation. We prove the following: (1) An optimal overlap representation of a tree can be produced in linear time, and its size is the number of vertices in the largest subtree in which the neighbor of any leaf has degree 2. (2) If $\\delta(G)\\ge 2$ and $G\\ne K_3$, then $\\ol(G)\\le |E(G)|-1$, with equa","authors_text":"Christopher Stocker, Daniel W. Cranston, Douglas B. West, Jennifer Vandenbussche, Kevin Milans, Nitish Korula, Timothy D. LeSaulnier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-06T04:04:01Z","title":"Overlap Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0804","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:94237091cb94b9a46987a18a183af2a772832433cc2373a18b2cd5e731f3e694","target":"record","created_at":"2026-05-18T03:41:02Z","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":"44cb07b774450c357372dcc37bad56794a8ef2355ca9abebc80236a861fce94e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-06T04:04:01Z","title_canon_sha256":"fe0a3859bfdfe7168678043ab8644dcbadab9bac40776c777b5606676b253a8b"},"schema_version":"1.0","source":{"id":"1007.0804","kind":"arxiv","version":1}},"canonical_sha256":"f9c9faf81e63dd8f3b97359657eb19b915d2f8dcbcff4a442c8f50f2d1c41a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9c9faf81e63dd8f3b97359657eb19b915d2f8dcbcff4a442c8f50f2d1c41a82","first_computed_at":"2026-05-18T03:41:02.631949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:02.631949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E/u/23+HBjkQcwhMaBlRiuveSdidemA8IVHEneFHZTNk51S6ZXkh/m7Ur+X3wIhKW0sfBqQUryCBQNHn6Pm2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:02.632514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.0804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94237091cb94b9a46987a18a183af2a772832433cc2373a18b2cd5e731f3e694","sha256:27797e93274d057bb9aa58ebee7f97df9d2f70e8412eaf5733322db60715744d"],"state_sha256":"a95fde6e62117d1db7bcd2dd0009fc61701770a7e19a818f28417501122aeac9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsRJHwzbkadzIWNPThBZzT1IS9+eocrT32v7+blpFkvTBBcXJD2AuBD5OiP2uiM6+Bsz5+i7RhoNaHmmjXPFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T21:02:52.808265Z","bundle_sha256":"151800689ae556bbe40ab4133c0dd6412bbe5a4a12f43d0f2cc5b66a9a2fae96"}}