{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CTTJCC2ZS74WSQYD6B7KIPQW6O","short_pith_number":"pith:CTTJCC2Z","canonical_record":{"source":{"id":"1205.2856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-13T13:04:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9a25f471e5fccf706d48d63df5dbb22d3087b0724ac6a1e5b77da746112ebcec","abstract_canon_sha256":"1719bfaba60c9d2619ee05f5a2f2ee7ce7fa8142660abcd5d410e2687ab909e4"},"schema_version":"1.0"},"canonical_sha256":"14e6910b5997f9694303f07ea43e16f3965f86caf0d151550370fba44211d6ca","source":{"kind":"arxiv","id":"1205.2856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2856","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2856v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2856","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"CTTJCC2ZS74W","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CTTJCC2ZS74WSQYD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CTTJCC2Z","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CTTJCC2ZS74WSQYD6B7KIPQW6O","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-13T13:04:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9a25f471e5fccf706d48d63df5dbb22d3087b0724ac6a1e5b77da746112ebcec","abstract_canon_sha256":"1719bfaba60c9d2619ee05f5a2f2ee7ce7fa8142660abcd5d410e2687ab909e4"},"schema_version":"1.0"},"canonical_sha256":"14e6910b5997f9694303f07ea43e16f3965f86caf0d151550370fba44211d6ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:45.843694Z","signature_b64":"CuX5rdSpQnsXMpjj1vz5YAorMluDovY+U4u2G1wmY75ObQSpl6JMyzfkRPZTw+qYDPKUvicVj5Cv64P8U+BiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e6910b5997f9694303f07ea43e16f3965f86caf0d151550370fba44211d6ca","last_reissued_at":"2026-05-18T03:55:45.842970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:45.842970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2856","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:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4bpFqRYEy88T700RaAtGpoqKP/5HmMo+TWnP6CioWQdcmlktsaR1LAn0fZgHV3/ip9U4UIqQfzsgQ0DH4+zBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:54:56.163234Z"},"content_sha256":"3fec8caa7339e19ad6764ae5ca7753747062297f630799d40018ce07ce2d730c","schema_version":"1.0","event_id":"sha256:3fec8caa7339e19ad6764ae5ca7753747062297f630799d40018ce07ce2d730c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CTTJCC2ZS74WSQYD6B7KIPQW6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Manouchehr Zaker","submitted_at":"2012-05-13T13:04:25Z","abstract_excerpt":"A graph $G$ is said to be a $k$-degenerate graph if any subgraph of $G$ contains a vertex of degree at most $k$. Let $\\kappa$ be any non-negative function on the vertex set of $G$. We first define a $\\kappa$-degenerate graph. Next we give an efficient algorithm to determine whether a graph is $\\kappa$-degenerate. We revisit the concept of dynamic monopolies in graphs. The latter notion is used in formulation and analysis of spread of influence such as disease or opinion in social networks. We consider dynamic monopolies with (not necessarily positive) but integral threshold assignments. We obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2856","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:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DC5+pNAOe8Cil9RzixHnwzBxsUVdKfnCqFVL4kFv2oBrGuSygGgDOQ9YvSdsUF1J7Edib8oMt0C6LQQDITq8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:54:56.163593Z"},"content_sha256":"283ff8db5ba1447f67e011df7966b81ff223a675a3a31b23cab30153ddebe63d","schema_version":"1.0","event_id":"sha256:283ff8db5ba1447f67e011df7966b81ff223a675a3a31b23cab30153ddebe63d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O/bundle.json","state_url":"https://pith.science/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O/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-26T09:54:56Z","links":{"resolver":"https://pith.science/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O","bundle":"https://pith.science/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O/bundle.json","state":"https://pith.science/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTTJCC2ZS74WSQYD6B7KIPQW6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CTTJCC2ZS74WSQYD6B7KIPQW6O","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":"1719bfaba60c9d2619ee05f5a2f2ee7ce7fa8142660abcd5d410e2687ab909e4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-13T13:04:25Z","title_canon_sha256":"9a25f471e5fccf706d48d63df5dbb22d3087b0724ac6a1e5b77da746112ebcec"},"schema_version":"1.0","source":{"id":"1205.2856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2856","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2856v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2856","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"CTTJCC2ZS74W","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CTTJCC2ZS74WSQYD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CTTJCC2Z","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:283ff8db5ba1447f67e011df7966b81ff223a675a3a31b23cab30153ddebe63d","target":"graph","created_at":"2026-05-18T03:55:45Z","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 graph $G$ is said to be a $k$-degenerate graph if any subgraph of $G$ contains a vertex of degree at most $k$. Let $\\kappa$ be any non-negative function on the vertex set of $G$. We first define a $\\kappa$-degenerate graph. Next we give an efficient algorithm to determine whether a graph is $\\kappa$-degenerate. We revisit the concept of dynamic monopolies in graphs. The latter notion is used in formulation and analysis of spread of influence such as disease or opinion in social networks. We consider dynamic monopolies with (not necessarily positive) but integral threshold assignments. We obt","authors_text":"Manouchehr Zaker","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-13T13:04:25Z","title":"Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2856","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:3fec8caa7339e19ad6764ae5ca7753747062297f630799d40018ce07ce2d730c","target":"record","created_at":"2026-05-18T03:55:45Z","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":"1719bfaba60c9d2619ee05f5a2f2ee7ce7fa8142660abcd5d410e2687ab909e4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-13T13:04:25Z","title_canon_sha256":"9a25f471e5fccf706d48d63df5dbb22d3087b0724ac6a1e5b77da746112ebcec"},"schema_version":"1.0","source":{"id":"1205.2856","kind":"arxiv","version":1}},"canonical_sha256":"14e6910b5997f9694303f07ea43e16f3965f86caf0d151550370fba44211d6ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14e6910b5997f9694303f07ea43e16f3965f86caf0d151550370fba44211d6ca","first_computed_at":"2026-05-18T03:55:45.842970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:45.842970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CuX5rdSpQnsXMpjj1vz5YAorMluDovY+U4u2G1wmY75ObQSpl6JMyzfkRPZTw+qYDPKUvicVj5Cv64P8U+BiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:45.843694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fec8caa7339e19ad6764ae5ca7753747062297f630799d40018ce07ce2d730c","sha256:283ff8db5ba1447f67e011df7966b81ff223a675a3a31b23cab30153ddebe63d"],"state_sha256":"6dd0a4220038d472b8f49fa90798841fd5e38b36bdb662c63182909c78f4d11f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YnjPe9ZHqEWmSso6DwY75ipST+aqobgZl0BVHVym6593Vf7vtzZ4o9Th/3HoL3WaOdyqzJqXQst5ji68HZf3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:54:56.165478Z","bundle_sha256":"20b02f035084bea18d9af5d4293304b9f06fed45341e9ddcb8431fadbdc34123"}}