{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SZ46HPUL3CR3XDTQECPQFLPDLQ","short_pith_number":"pith:SZ46HPUL","canonical_record":{"source":{"id":"1107.4879","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-25T09:55:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"33538111311f2c57a281937f2909a946a45adb032596f0e05cf33e5a6bbf9fe2","abstract_canon_sha256":"c7f7c2a14623d63a462686991d009799777e43fb05e3f3521d7dfcf32f9fe9a6"},"schema_version":"1.0"},"canonical_sha256":"9679e3be8bd8a3bb8e70209f02ade35c03ccefbe57c348c4381a8538d67cb36f","source":{"kind":"arxiv","id":"1107.4879","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4879","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4879v3","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4879","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"SZ46HPUL3CR3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZ46HPUL3CR3XDTQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZ46HPUL","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SZ46HPUL3CR3XDTQECPQFLPDLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4879","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-25T09:55:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"33538111311f2c57a281937f2909a946a45adb032596f0e05cf33e5a6bbf9fe2","abstract_canon_sha256":"c7f7c2a14623d63a462686991d009799777e43fb05e3f3521d7dfcf32f9fe9a6"},"schema_version":"1.0"},"canonical_sha256":"9679e3be8bd8a3bb8e70209f02ade35c03ccefbe57c348c4381a8538d67cb36f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:09.028988Z","signature_b64":"i/VeJ/MOH169IgnqvhXGoNFds96kGFnN+LVK3wccKYdi3voB6PAUsvTMFtJ6dB9dL6oMkpuxHSbkAsu+PPyzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9679e3be8bd8a3bb8e70209f02ade35c03ccefbe57c348c4381a8538d67cb36f","last_reissued_at":"2026-05-18T01:25:09.028427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:09.028427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4879","source_version":3,"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:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JflPHhMeVrKLhTGrE55k/vD0ecKgyUakjoZSWVTusi9Zyq8fx8OISu2dTfk+PNpol1GYgdMvIi2QEmU7bzFEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:14:14.577621Z"},"content_sha256":"831e27d7113ac50b6d2729dc405081daf21341c967aca09a7ba21e1405bb9279","schema_version":"1.0","event_id":"sha256:831e27d7113ac50b6d2729dc405081daf21341c967aca09a7ba21e1405bb9279"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SZ46HPUL3CR3XDTQECPQFLPDLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On strongly spanning $k$-edge-colorable subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gagik N. Vardanyan, Vahan V. Mkrtchyan","submitted_at":"2011-07-25T09:55:39Z","abstract_excerpt":"A subgraph $H$ of a multigraph $G$ is called strongly spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is proper $k$-edge-colorable and has the largest size. We introduce a graph-parameter $sp(G)$, that coincides with the smallest $k$ that a graph $G$ has a strongly spanning maximum $k$-edge-colorable subgraph. Our first result offers some alternative definitions of $sp(G)$. Next, we show that $\\Delta(G)$ is an upper bound for $sp(G)$, and then we characterize the class of graphs $G$ that satisfy $sp(G)=\\Delta(G)$. Finally, we prove s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4879","kind":"arxiv","version":3},"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:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSrSUr97skouN8kV1Jvk6K/3dT2VBErchikYKmE1Ma5MYeVfDjv/QVeIcZUxpOPlKKz2CurMmNBBnrbQfu4JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:14:14.577953Z"},"content_sha256":"7002b5a5b62b335de193b60be7cd929658c74bd866fbc60b359537f937672c32","schema_version":"1.0","event_id":"sha256:7002b5a5b62b335de193b60be7cd929658c74bd866fbc60b359537f937672c32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ/bundle.json","state_url":"https://pith.science/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ/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-21T08:14:14Z","links":{"resolver":"https://pith.science/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ","bundle":"https://pith.science/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ/bundle.json","state":"https://pith.science/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ46HPUL3CR3XDTQECPQFLPDLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SZ46HPUL3CR3XDTQECPQFLPDLQ","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":"c7f7c2a14623d63a462686991d009799777e43fb05e3f3521d7dfcf32f9fe9a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-25T09:55:39Z","title_canon_sha256":"33538111311f2c57a281937f2909a946a45adb032596f0e05cf33e5a6bbf9fe2"},"schema_version":"1.0","source":{"id":"1107.4879","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4879","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4879v3","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4879","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"SZ46HPUL3CR3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZ46HPUL3CR3XDTQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZ46HPUL","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:7002b5a5b62b335de193b60be7cd929658c74bd866fbc60b359537f937672c32","target":"graph","created_at":"2026-05-18T01:25:09Z","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":"A subgraph $H$ of a multigraph $G$ is called strongly spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is proper $k$-edge-colorable and has the largest size. We introduce a graph-parameter $sp(G)$, that coincides with the smallest $k$ that a graph $G$ has a strongly spanning maximum $k$-edge-colorable subgraph. Our first result offers some alternative definitions of $sp(G)$. Next, we show that $\\Delta(G)$ is an upper bound for $sp(G)$, and then we characterize the class of graphs $G$ that satisfy $sp(G)=\\Delta(G)$. Finally, we prove s","authors_text":"Gagik N. Vardanyan, Vahan V. Mkrtchyan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-25T09:55:39Z","title":"On strongly spanning $k$-edge-colorable subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4879","kind":"arxiv","version":3},"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:831e27d7113ac50b6d2729dc405081daf21341c967aca09a7ba21e1405bb9279","target":"record","created_at":"2026-05-18T01:25:09Z","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":"c7f7c2a14623d63a462686991d009799777e43fb05e3f3521d7dfcf32f9fe9a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-25T09:55:39Z","title_canon_sha256":"33538111311f2c57a281937f2909a946a45adb032596f0e05cf33e5a6bbf9fe2"},"schema_version":"1.0","source":{"id":"1107.4879","kind":"arxiv","version":3}},"canonical_sha256":"9679e3be8bd8a3bb8e70209f02ade35c03ccefbe57c348c4381a8538d67cb36f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9679e3be8bd8a3bb8e70209f02ade35c03ccefbe57c348c4381a8538d67cb36f","first_computed_at":"2026-05-18T01:25:09.028427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:09.028427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i/VeJ/MOH169IgnqvhXGoNFds96kGFnN+LVK3wccKYdi3voB6PAUsvTMFtJ6dB9dL6oMkpuxHSbkAsu+PPyzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:09.028988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4879","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:831e27d7113ac50b6d2729dc405081daf21341c967aca09a7ba21e1405bb9279","sha256:7002b5a5b62b335de193b60be7cd929658c74bd866fbc60b359537f937672c32"],"state_sha256":"cfbc17ba890543c0b3d9e59ff629de0dfdd48e5083de59944444ebdfb83a0a53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uaOD6vwX9W+Etbux+/snVxh46iGmYJIyMvwOj26osyNEZlqU91QX31pPmvnBd/3uSNIiOB0iyLGNWy2krd8AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T08:14:14.579884Z","bundle_sha256":"44537bfc62386604f2b77bc5e4a8721e4153b4b5243b390253f13e44af558cd2"}}