{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7RFCAG7VPFU2B42ELAK7E6TISC","short_pith_number":"pith:7RFCAG7V","canonical_record":{"source":{"id":"1008.2170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-12T17:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"d1e33623507666b90093ff83532b2efda2bc30d041519feaa545f32e03a1a7eb","abstract_canon_sha256":"b476daac9e46930e4cc072b89d9719e391dfe15ff42085593c3ebb6817bf3e7a"},"schema_version":"1.0"},"canonical_sha256":"fc4a201bf57969a0f3445815f27a6890a26c457a908027f4e80f045e068a3568","source":{"kind":"arxiv","id":"1008.2170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2170","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2170v2","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2170","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"7RFCAG7VPFU2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7RFCAG7VPFU2B42E","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7RFCAG7V","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7RFCAG7VPFU2B42ELAK7E6TISC","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-12T17:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"d1e33623507666b90093ff83532b2efda2bc30d041519feaa545f32e03a1a7eb","abstract_canon_sha256":"b476daac9e46930e4cc072b89d9719e391dfe15ff42085593c3ebb6817bf3e7a"},"schema_version":"1.0"},"canonical_sha256":"fc4a201bf57969a0f3445815f27a6890a26c457a908027f4e80f045e068a3568","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:13.433879Z","signature_b64":"1guCLdQH3aTWdJxTnxKZ7ehouHaPRzucVtrswErzvPuxxcnrWo/Xp38izXkorGRWBTNnECIwGxEd5jJj0FXSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4a201bf57969a0f3445815f27a6890a26c457a908027f4e80f045e068a3568","last_reissued_at":"2026-05-18T04:42:13.433310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:13.433310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2170","source_version":2,"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:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VutRh5ud1y42PLEfBKgpVkKOC5JVNyEVeD5pEF82hI+3i01xKBULxgJFlozWP5vzf8dlOJTITX+dCO27Jl3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:15:53.735509Z"},"content_sha256":"1a492826b281092f2f7c72cf7fc51b3730a5f89cdfb35f09fdae5d45d10931fd","schema_version":"1.0","event_id":"sha256:1a492826b281092f2f7c72cf7fc51b3730a5f89cdfb35f09fdae5d45d10931fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7RFCAG7VPFU2B42ELAK7E6TISC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The overlap number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Bill Rosgen, Lorna Stewart","submitted_at":"2010-08-12T17:32:47Z","abstract_excerpt":"An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements needed to form such a representation. We find the overlap numbers of cliques and complete bipartite graphs by relating the problem to previous research in combinatorics. The overlap numbers of paths, cycles, and caterpillars are also established. Finally, we show the NP-completeness of the problems of extending an overlap representation and finding a minimum ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2170","kind":"arxiv","version":2},"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:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMuswp0wRGHZNqaqfBLO0LZH/joYwmbZaY1g0Kq3YfFwtKLi3QQ2D5mmU+Ur7di/cZqr2+sXGCeb3prWlMfODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:15:53.736110Z"},"content_sha256":"1096076e3c2150d29ffc5e904193500e71ec6906cf84f5635bb7fef05ffb7183","schema_version":"1.0","event_id":"sha256:1096076e3c2150d29ffc5e904193500e71ec6906cf84f5635bb7fef05ffb7183"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RFCAG7VPFU2B42ELAK7E6TISC/bundle.json","state_url":"https://pith.science/pith/7RFCAG7VPFU2B42ELAK7E6TISC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RFCAG7VPFU2B42ELAK7E6TISC/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-08T00:15:53Z","links":{"resolver":"https://pith.science/pith/7RFCAG7VPFU2B42ELAK7E6TISC","bundle":"https://pith.science/pith/7RFCAG7VPFU2B42ELAK7E6TISC/bundle.json","state":"https://pith.science/pith/7RFCAG7VPFU2B42ELAK7E6TISC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RFCAG7VPFU2B42ELAK7E6TISC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7RFCAG7VPFU2B42ELAK7E6TISC","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":"b476daac9e46930e4cc072b89d9719e391dfe15ff42085593c3ebb6817bf3e7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-12T17:32:47Z","title_canon_sha256":"d1e33623507666b90093ff83532b2efda2bc30d041519feaa545f32e03a1a7eb"},"schema_version":"1.0","source":{"id":"1008.2170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2170","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2170v2","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2170","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"7RFCAG7VPFU2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7RFCAG7VPFU2B42E","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7RFCAG7V","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:1096076e3c2150d29ffc5e904193500e71ec6906cf84f5635bb7fef05ffb7183","target":"graph","created_at":"2026-05-18T04:42:13Z","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 overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements needed to form such a representation. We find the overlap numbers of cliques and complete bipartite graphs by relating the problem to previous research in combinatorics. The overlap numbers of paths, cycles, and caterpillars are also established. Finally, we show the NP-completeness of the problems of extending an overlap representation and finding a minimum ov","authors_text":"Bill Rosgen, Lorna Stewart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-12T17:32:47Z","title":"The overlap number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2170","kind":"arxiv","version":2},"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:1a492826b281092f2f7c72cf7fc51b3730a5f89cdfb35f09fdae5d45d10931fd","target":"record","created_at":"2026-05-18T04:42:13Z","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":"b476daac9e46930e4cc072b89d9719e391dfe15ff42085593c3ebb6817bf3e7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-12T17:32:47Z","title_canon_sha256":"d1e33623507666b90093ff83532b2efda2bc30d041519feaa545f32e03a1a7eb"},"schema_version":"1.0","source":{"id":"1008.2170","kind":"arxiv","version":2}},"canonical_sha256":"fc4a201bf57969a0f3445815f27a6890a26c457a908027f4e80f045e068a3568","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4a201bf57969a0f3445815f27a6890a26c457a908027f4e80f045e068a3568","first_computed_at":"2026-05-18T04:42:13.433310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:13.433310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1guCLdQH3aTWdJxTnxKZ7ehouHaPRzucVtrswErzvPuxxcnrWo/Xp38izXkorGRWBTNnECIwGxEd5jJj0FXSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:13.433879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a492826b281092f2f7c72cf7fc51b3730a5f89cdfb35f09fdae5d45d10931fd","sha256:1096076e3c2150d29ffc5e904193500e71ec6906cf84f5635bb7fef05ffb7183"],"state_sha256":"a898a2a83151708a788c34198884daf3766cd9b1a584ef97bce777e3b0c739a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pls5dMb1VT1VhRKRColiLx3hbiYk88WVYSy8czNdN8K9/WlciGfUv5R+BNSVec3rcu1Uu1BGS6vgQieFD8Q3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T00:15:53.739885Z","bundle_sha256":"4c5189c4cde70ebd903230951a84fcabee0381680968b7c334f41432ee022e58"}}