{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GZ5NG26VYN5FB46J6O2IQLRR62","short_pith_number":"pith:GZ5NG26V","canonical_record":{"source":{"id":"1503.02380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-09T06:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"c78fd31f77165c4168e0f3d283246e709305c1c18f671737c2113f66fbcdfe11","abstract_canon_sha256":"ee6454b0d7516ca0d975566de3b8e4b6c288b7c295d6bdb03e58f515c8f79964"},"schema_version":"1.0"},"canonical_sha256":"367ad36bd5c37a50f3c9f3b4882e31f6a7381d3a6055af42a40eb2a7fcc28631","source":{"kind":"arxiv","id":"1503.02380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02380","created_at":"2026-05-18T01:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02380v1","created_at":"2026-05-18T01:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02380","created_at":"2026-05-18T01:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"GZ5NG26VYN5F","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GZ5NG26VYN5FB46J","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GZ5NG26V","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GZ5NG26VYN5FB46J6O2IQLRR62","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-09T06:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"c78fd31f77165c4168e0f3d283246e709305c1c18f671737c2113f66fbcdfe11","abstract_canon_sha256":"ee6454b0d7516ca0d975566de3b8e4b6c288b7c295d6bdb03e58f515c8f79964"},"schema_version":"1.0"},"canonical_sha256":"367ad36bd5c37a50f3c9f3b4882e31f6a7381d3a6055af42a40eb2a7fcc28631","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:23.988933Z","signature_b64":"V7lMqLNUbVYNSmUAkhODavAaizjCmryZ7qLhDcodZqaruioEdv45eXXHyDrnTzKtpsg3wZlqiA6vkIgF82/IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"367ad36bd5c37a50f3c9f3b4882e31f6a7381d3a6055af42a40eb2a7fcc28631","last_reissued_at":"2026-05-18T01:03:23.988466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:23.988466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02380","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-18T01:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qctqahjif8rGDcOLbi2U9QLCDfFL3+j0DD/CEWyM9UgY3NlLQPzw/NGqY7ZpunqIS7pIVgIVM4eH7KJCcUlkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:26:21.054962Z"},"content_sha256":"38da14e48f9d2f3362b04a0745f85f96b25e2f54d9ac261400a745ce41637d15","schema_version":"1.0","event_id":"sha256:38da14e48f9d2f3362b04a0745f85f96b25e2f54d9ac261400a745ce41637d15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GZ5NG26VYN5FB46J6O2IQLRR62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sigma clique covering of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akbar Davoodi, Behnaz Omoomi, Ramin Javadi","submitted_at":"2015-03-09T06:47:33Z","abstract_excerpt":"The sigma clique cover number (resp. sigma clique partition number) of graph G, denoted by scc(G) (resp. scp(G)), is defined as the smallest integer k for which there exists a collection of cliques of G, covering (resp. partitioning) all edges of G such that the sum of sizes of the cliques is at most k. In this paper, among some results we provide some tight bounds for scc and scp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02380","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-18T01:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPDreTnIFx/UkDqFiQBYzhISExit9FwpexyZGc/qErZGcuysDVzi7/E6ArUx4kMcyBAR0xBtC6bXl1qFn9nWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:26:21.055304Z"},"content_sha256":"9241053bc59d683a54e904ba838b53ce967d6a8dda5aebab42d0752e639286bc","schema_version":"1.0","event_id":"sha256:9241053bc59d683a54e904ba838b53ce967d6a8dda5aebab42d0752e639286bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZ5NG26VYN5FB46J6O2IQLRR62/bundle.json","state_url":"https://pith.science/pith/GZ5NG26VYN5FB46J6O2IQLRR62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZ5NG26VYN5FB46J6O2IQLRR62/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-02T21:26:21Z","links":{"resolver":"https://pith.science/pith/GZ5NG26VYN5FB46J6O2IQLRR62","bundle":"https://pith.science/pith/GZ5NG26VYN5FB46J6O2IQLRR62/bundle.json","state":"https://pith.science/pith/GZ5NG26VYN5FB46J6O2IQLRR62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZ5NG26VYN5FB46J6O2IQLRR62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GZ5NG26VYN5FB46J6O2IQLRR62","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":"ee6454b0d7516ca0d975566de3b8e4b6c288b7c295d6bdb03e58f515c8f79964","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-09T06:47:33Z","title_canon_sha256":"c78fd31f77165c4168e0f3d283246e709305c1c18f671737c2113f66fbcdfe11"},"schema_version":"1.0","source":{"id":"1503.02380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02380","created_at":"2026-05-18T01:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02380v1","created_at":"2026-05-18T01:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02380","created_at":"2026-05-18T01:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"GZ5NG26VYN5F","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GZ5NG26VYN5FB46J","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GZ5NG26V","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:9241053bc59d683a54e904ba838b53ce967d6a8dda5aebab42d0752e639286bc","target":"graph","created_at":"2026-05-18T01:03:23Z","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":"The sigma clique cover number (resp. sigma clique partition number) of graph G, denoted by scc(G) (resp. scp(G)), is defined as the smallest integer k for which there exists a collection of cliques of G, covering (resp. partitioning) all edges of G such that the sum of sizes of the cliques is at most k. In this paper, among some results we provide some tight bounds for scc and scp.","authors_text":"Akbar Davoodi, Behnaz Omoomi, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-09T06:47:33Z","title":"Sigma clique covering of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02380","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:38da14e48f9d2f3362b04a0745f85f96b25e2f54d9ac261400a745ce41637d15","target":"record","created_at":"2026-05-18T01:03:23Z","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":"ee6454b0d7516ca0d975566de3b8e4b6c288b7c295d6bdb03e58f515c8f79964","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-09T06:47:33Z","title_canon_sha256":"c78fd31f77165c4168e0f3d283246e709305c1c18f671737c2113f66fbcdfe11"},"schema_version":"1.0","source":{"id":"1503.02380","kind":"arxiv","version":1}},"canonical_sha256":"367ad36bd5c37a50f3c9f3b4882e31f6a7381d3a6055af42a40eb2a7fcc28631","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"367ad36bd5c37a50f3c9f3b4882e31f6a7381d3a6055af42a40eb2a7fcc28631","first_computed_at":"2026-05-18T01:03:23.988466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:23.988466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V7lMqLNUbVYNSmUAkhODavAaizjCmryZ7qLhDcodZqaruioEdv45eXXHyDrnTzKtpsg3wZlqiA6vkIgF82/IAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:23.988933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38da14e48f9d2f3362b04a0745f85f96b25e2f54d9ac261400a745ce41637d15","sha256:9241053bc59d683a54e904ba838b53ce967d6a8dda5aebab42d0752e639286bc"],"state_sha256":"823940f925e27dfec745ae1b05ae033cd1049880bf25b0a43cae56434f5af3b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rs/+KaR/gzELbqELoPLRMt8lvfTO7/KmjBn2r7POHyoZwqW89ieaY/pVGxAbEun3xSvQuYag3hfCn0U8p/8wBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:26:21.057206Z","bundle_sha256":"e316f5f45f702b2aa0e1b013eef6224ea25a5f8bdde4aed41a110e5a206a93b9"}}